./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.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/mix051_tso.oepc.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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:28:19,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:28:19,745 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:28:19,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:28:19,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:28:19,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:28:19,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:28:19,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:28:19,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:28:19,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:28:19,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:28:19,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:28:19,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:28:19,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:28:19,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:19,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:19,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:28:19,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:28:19,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:28:19,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:28:19,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:28:19,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:28:19,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:28:19,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:28:19,766 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2025-01-09 16:28:19,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:28:19,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:28:19,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:28:19,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:28:19,997 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:28:19,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2025-01-09 16:28:21,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0749cd261/feca9d36a0054a3594e2d26820d8f8cb/FLAG655ac64ab [2025-01-09 16:28:21,490 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:28:21,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2025-01-09 16:28:21,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0749cd261/feca9d36a0054a3594e2d26820d8f8cb/FLAG655ac64ab [2025-01-09 16:28:21,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0749cd261/feca9d36a0054a3594e2d26820d8f8cb [2025-01-09 16:28:21,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:28:21,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:28:21,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:28:21,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:28:21,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:28:21,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:21" (1/1) ... [2025-01-09 16:28:21,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436c86d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:21, skipping insertion in model container [2025-01-09 16:28:21,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:21" (1/1) ... [2025-01-09 16:28:21,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:28:21,928 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/mix051_tso.oepc.i[949,962] [2025-01-09 16:28:22,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:28:22,083 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:28:22,093 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/mix051_tso.oepc.i[949,962] [2025-01-09 16:28:22,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:28:22,159 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:28:22,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22 WrapperNode [2025-01-09 16:28:22,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:28:22,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:28:22,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:28:22,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:28:22,167 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:28:22" (1/1) ... [2025-01-09 16:28:22,178 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:28:22" (1/1) ... [2025-01-09 16:28:22,197 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2025-01-09 16:28:22,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:28:22,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:28:22,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:28:22,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:28:22,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,219 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:28:22,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:28:22,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:28:22,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:28:22,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:28:22,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (1/1) ... [2025-01-09 16:28:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:22,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:28:22,276 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:28:22,283 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:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:28:22,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:28:22,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:28:22,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-09 16:28:22,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-09 16:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:28:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:28:22,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:28:22,306 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:28:22,416 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:28:22,418 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:28:22,685 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:28:22,685 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:28:22,859 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:28:22,860 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:28:22,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:22 BoogieIcfgContainer [2025-01-09 16:28:22,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:28:22,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:28:22,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:28:22,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:28:22,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:28:21" (1/3) ... [2025-01-09 16:28:22,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b24eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:22, skipping insertion in model container [2025-01-09 16:28:22,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:22" (2/3) ... [2025-01-09 16:28:22,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b24eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:22, skipping insertion in model container [2025-01-09 16:28:22,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:22" (3/3) ... [2025-01-09 16:28:22,869 INFO L128 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2025-01-09 16:28:22,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:28:22,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_tso.oepc.i that has 5 procedures, 48 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-09 16:28:22,882 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:28:22,932 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:28:22,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2025-01-09 16:28:22,996 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2025-01-09 16:28:22,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:28:23,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2025-01-09 16:28:23,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2025-01-09 16:28:23,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2025-01-09 16:28:23,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:28:23,025 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;@f87587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:28:23,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:28:23,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:28:23,032 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-09 16:28:23,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:28:23,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:23,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 16:28:23,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:23,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash -996313560, now seen corresponding path program 1 times [2025-01-09 16:28:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:23,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363702829] [2025-01-09 16:28:23,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:23,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:28:23,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:28:23,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:23,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:23,449 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:28:23,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:23,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363702829] [2025-01-09 16:28:23,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363702829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:23,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:23,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:28:23,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125764484] [2025-01-09 16:28:23,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:23,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:28:23,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:23,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:28:23,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:28:23,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2025-01-09 16:28:23,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:23,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:23,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2025-01-09 16:28:23,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:24,138 INFO L124 PetriNetUnfolderBase]: 2160/3608 cut-off events. [2025-01-09 16:28:24,139 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-09 16:28:24,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 3608 events. 2160/3608 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24770 event pairs, 384 based on Foata normal form. 108/3632 useless extension candidates. Maximal degree in co-relation 6725. Up to 2416 conditions per place. [2025-01-09 16:28:24,167 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 35 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-01-09 16:28:24,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 212 flow [2025-01-09 16:28:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:28:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:28:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-01-09 16:28:24,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-01-09 16:28:24,180 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 111 transitions. [2025-01-09 16:28:24,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 212 flow [2025-01-09 16:28:24,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:24,191 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2025-01-09 16:28:24,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-01-09 16:28:24,197 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2025-01-09 16:28:24,197 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2025-01-09 16:28:24,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:24,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:24,199 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:28:24,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:28:24,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:24,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 998320935, now seen corresponding path program 1 times [2025-01-09 16:28:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831432432] [2025-01-09 16:28:24,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:24,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:28:24,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:28:24,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:24,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:24,962 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:28:24,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831432432] [2025-01-09 16:28:24,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831432432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:24,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:24,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544765444] [2025-01-09 16:28:24,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:24,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:24,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:24,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:24,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-09 16:28:24,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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:28:24,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:24,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-09 16:28:24,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:25,936 INFO L124 PetriNetUnfolderBase]: 4352/6814 cut-off events. [2025-01-09 16:28:25,936 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-01-09 16:28:25,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13385 conditions, 6814 events. 4352/6814 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 48899 event pairs, 983 based on Foata normal form. 0/6656 useless extension candidates. Maximal degree in co-relation 13375. Up to 3913 conditions per place. [2025-01-09 16:28:25,977 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 36 selfloop transitions, 3 changer transitions 48/103 dead transitions. [2025-01-09 16:28:25,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 103 transitions, 410 flow [2025-01-09 16:28:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2025-01-09 16:28:25,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2025-01-09 16:28:25,983 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 8 states and 249 transitions. [2025-01-09 16:28:25,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 103 transitions, 410 flow [2025-01-09 16:28:25,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 103 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:25,986 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 123 flow [2025-01-09 16:28:25,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2025-01-09 16:28:25,987 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2025-01-09 16:28:25,988 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 123 flow [2025-01-09 16:28:25,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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:28:25,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:25,988 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:28:25,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:28:25,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1641187607, now seen corresponding path program 1 times [2025-01-09 16:28:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596381919] [2025-01-09 16:28:25,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:26,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:28:26,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:28:26,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:26,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:26,621 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:28:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596381919] [2025-01-09 16:28:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596381919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:26,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:26,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775694857] [2025-01-09 16:28:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:26,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:26,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:26,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:26,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-09 16:28:26,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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:28:26,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:26,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-09 16:28:26,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:27,354 INFO L124 PetriNetUnfolderBase]: 3518/5553 cut-off events. [2025-01-09 16:28:27,354 INFO L125 PetriNetUnfolderBase]: For 3599/3599 co-relation queries the response was YES. [2025-01-09 16:28:27,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13283 conditions, 5553 events. 3518/5553 cut-off events. For 3599/3599 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 36336 event pairs, 2058 based on Foata normal form. 116/5646 useless extension candidates. Maximal degree in co-relation 13268. Up to 3935 conditions per place. [2025-01-09 16:28:27,384 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 45 selfloop transitions, 7 changer transitions 33/101 dead transitions. [2025-01-09 16:28:27,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 461 flow [2025-01-09 16:28:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions. [2025-01-09 16:28:27,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6432291666666666 [2025-01-09 16:28:27,385 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 123 flow. Second operand 8 states and 247 transitions. [2025-01-09 16:28:27,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 461 flow [2025-01-09 16:28:27,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 450 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:27,397 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 183 flow [2025-01-09 16:28:27,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=183, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-01-09 16:28:27,398 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2025-01-09 16:28:27,398 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 183 flow [2025-01-09 16:28:27,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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:28:27,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:27,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:27,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:28:27,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:27,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash -538760536, now seen corresponding path program 1 times [2025-01-09 16:28:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-01-09 16:28:27,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:27,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:28:27,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:28:27,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:27,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:27,621 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:28:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-01-09 16:28:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949203763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647854621] [2025-01-09 16:28:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:27,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:27,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:27,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:27,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-09 16:28:27,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:28:27,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:27,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-09 16:28:27,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:28,623 INFO L124 PetriNetUnfolderBase]: 3583/5761 cut-off events. [2025-01-09 16:28:28,623 INFO L125 PetriNetUnfolderBase]: For 12107/12157 co-relation queries the response was YES. [2025-01-09 16:28:28,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18462 conditions, 5761 events. 3583/5761 cut-off events. For 12107/12157 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 39984 event pairs, 483 based on Foata normal form. 120/5817 useless extension candidates. Maximal degree in co-relation 18443. Up to 3429 conditions per place. [2025-01-09 16:28:28,669 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 52 selfloop transitions, 9 changer transitions 33/110 dead transitions. [2025-01-09 16:28:28,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 643 flow [2025-01-09 16:28:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 251 transitions. [2025-01-09 16:28:28,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6536458333333334 [2025-01-09 16:28:28,670 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 183 flow. Second operand 8 states and 251 transitions. [2025-01-09 16:28:28,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 643 flow [2025-01-09 16:28:28,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 616 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:28,698 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 234 flow [2025-01-09 16:28:28,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=234, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2025-01-09 16:28:28,699 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2025-01-09 16:28:28,699 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 234 flow [2025-01-09 16:28:28,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:28:28,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:28,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:28,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:28:28,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:28,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:28,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1212021600, now seen corresponding path program 2 times [2025-01-09 16:28:28,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:28,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124548857] [2025-01-09 16:28:28,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:28:28,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:28,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:28:28,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:28:28,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:28:28,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:28,946 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:28:28,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:28,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124548857] [2025-01-09 16:28:28,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:28,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:28,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755847612] [2025-01-09 16:28:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:28,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:28,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:28,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:28,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-09 16:28:28,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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:28:28,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:28,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-09 16:28:28,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:29,628 INFO L124 PetriNetUnfolderBase]: 3358/5311 cut-off events. [2025-01-09 16:28:29,628 INFO L125 PetriNetUnfolderBase]: For 15295/15370 co-relation queries the response was YES. [2025-01-09 16:28:29,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19032 conditions, 5311 events. 3358/5311 cut-off events. For 15295/15370 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 35975 event pairs, 467 based on Foata normal form. 132/5379 useless extension candidates. Maximal degree in co-relation 19010. Up to 3348 conditions per place. [2025-01-09 16:28:29,655 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 49 selfloop transitions, 9 changer transitions 33/107 dead transitions. [2025-01-09 16:28:29,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 680 flow [2025-01-09 16:28:29,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 248 transitions. [2025-01-09 16:28:29,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-01-09 16:28:29,657 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 234 flow. Second operand 8 states and 248 transitions. [2025-01-09 16:28:29,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 680 flow [2025-01-09 16:28:29,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 634 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-09 16:28:29,679 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 238 flow [2025-01-09 16:28:29,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-01-09 16:28:29,680 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2025-01-09 16:28:29,680 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 238 flow [2025-01-09 16:28:29,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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:28:29,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:29,680 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:28:29,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:28:29,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 204509962, now seen corresponding path program 1 times [2025-01-09 16:28:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733047945] [2025-01-09 16:28:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:29,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:28:29,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:28:29,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:29,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:29,798 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:28:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733047945] [2025-01-09 16:28:29,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733047945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:29,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:29,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:28:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171368877] [2025-01-09 16:28:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:29,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:28:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:29,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:28:29,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:28:29,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-09 16:28:29,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:29,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:29,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-09 16:28:29,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:30,766 INFO L124 PetriNetUnfolderBase]: 8735/12654 cut-off events. [2025-01-09 16:28:30,767 INFO L125 PetriNetUnfolderBase]: For 29366/29485 co-relation queries the response was YES. [2025-01-09 16:28:30,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41283 conditions, 12654 events. 8735/12654 cut-off events. For 29366/29485 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 81808 event pairs, 985 based on Foata normal form. 532/12912 useless extension candidates. Maximal degree in co-relation 41259. Up to 6837 conditions per place. [2025-01-09 16:28:30,839 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 76 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-01-09 16:28:30,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 97 transitions, 636 flow [2025-01-09 16:28:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:28:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:28:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-01-09 16:28:30,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2025-01-09 16:28:30,841 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 238 flow. Second operand 4 states and 131 transitions. [2025-01-09 16:28:30,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 97 transitions, 636 flow [2025-01-09 16:28:30,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 576 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-01-09 16:28:30,857 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 252 flow [2025-01-09 16:28:30,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-01-09 16:28:30,858 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2025-01-09 16:28:30,858 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 252 flow [2025-01-09 16:28:30,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:30,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:30,858 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:28:30,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:28:30,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:30,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:30,859 INFO L85 PathProgramCache]: Analyzing trace with hash -218313075, now seen corresponding path program 1 times [2025-01-09 16:28:30,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:30,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523571090] [2025-01-09 16:28:30,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:30,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:28:30,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:28:30,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:30,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:31,005 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:28:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523571090] [2025-01-09 16:28:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523571090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:28:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774728862] [2025-01-09 16:28:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:31,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:28:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:31,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:28:31,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:28:31,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-09 16:28:31,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:28:31,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:31,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-09 16:28:31,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:32,045 INFO L124 PetriNetUnfolderBase]: 7543/11094 cut-off events. [2025-01-09 16:28:32,045 INFO L125 PetriNetUnfolderBase]: For 21266/21377 co-relation queries the response was YES. [2025-01-09 16:28:32,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36605 conditions, 11094 events. 7543/11094 cut-off events. For 21266/21377 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 70748 event pairs, 545 based on Foata normal form. 486/11299 useless extension candidates. Maximal degree in co-relation 36584. Up to 4321 conditions per place. [2025-01-09 16:28:32,130 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 91 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2025-01-09 16:28:32,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 116 transitions, 741 flow [2025-01-09 16:28:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:28:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:28:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-01-09 16:28:32,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-09 16:28:32,132 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 252 flow. Second operand 5 states and 168 transitions. [2025-01-09 16:28:32,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 116 transitions, 741 flow [2025-01-09 16:28:32,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 734 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:32,141 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 313 flow [2025-01-09 16:28:32,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-01-09 16:28:32,142 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2025-01-09 16:28:32,142 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 313 flow [2025-01-09 16:28:32,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:28:32,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:32,142 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:28:32,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:28:32,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash -160055579, now seen corresponding path program 1 times [2025-01-09 16:28:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722053403] [2025-01-09 16:28:32,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:32,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:28:32,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:28:32,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:32,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:32,384 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:28:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722053403] [2025-01-09 16:28:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722053403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:32,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500325482] [2025-01-09 16:28:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:32,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:32,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:32,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:32,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-09 16:28:32,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 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:28:32,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:32,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-09 16:28:32,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:33,155 INFO L124 PetriNetUnfolderBase]: 5975/8834 cut-off events. [2025-01-09 16:28:33,155 INFO L125 PetriNetUnfolderBase]: For 22482/22585 co-relation queries the response was YES. [2025-01-09 16:28:33,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31428 conditions, 8834 events. 5975/8834 cut-off events. For 22482/22585 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 53864 event pairs, 397 based on Foata normal form. 350/8904 useless extension candidates. Maximal degree in co-relation 31405. Up to 2720 conditions per place. [2025-01-09 16:28:33,195 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 99 selfloop transitions, 14 changer transitions 0/128 dead transitions. [2025-01-09 16:28:33,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 128 transitions, 870 flow [2025-01-09 16:28:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:28:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:28:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-01-09 16:28:33,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7048611111111112 [2025-01-09 16:28:33,196 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 313 flow. Second operand 6 states and 203 transitions. [2025-01-09 16:28:33,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 128 transitions, 870 flow [2025-01-09 16:28:33,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 128 transitions, 854 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:33,204 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 377 flow [2025-01-09 16:28:33,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-09 16:28:33,205 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2025-01-09 16:28:33,205 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 377 flow [2025-01-09 16:28:33,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 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:28:33,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:33,205 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:28:33,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:28:33,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:33,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:33,206 INFO L85 PathProgramCache]: Analyzing trace with hash 798117322, now seen corresponding path program 1 times [2025-01-09 16:28:33,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:33,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731484099] [2025-01-09 16:28:33,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:33,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:33,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:28:33,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:28:33,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:33,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:33,401 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:28:33,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:33,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731484099] [2025-01-09 16:28:33,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731484099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:33,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:33,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152990804] [2025-01-09 16:28:33,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:33,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:33,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:33,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:33,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-09 16:28:33,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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:28:33,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:33,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-09 16:28:33,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:34,082 INFO L124 PetriNetUnfolderBase]: 5215/7642 cut-off events. [2025-01-09 16:28:34,083 INFO L125 PetriNetUnfolderBase]: For 26478/26581 co-relation queries the response was YES. [2025-01-09 16:28:34,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29344 conditions, 7642 events. 5215/7642 cut-off events. For 26478/26581 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 45786 event pairs, 397 based on Foata normal form. 198/7560 useless extension candidates. Maximal degree in co-relation 29319. Up to 2720 conditions per place. [2025-01-09 16:28:34,112 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 92 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2025-01-09 16:28:34,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 860 flow [2025-01-09 16:28:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:28:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:28:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2025-01-09 16:28:34,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2025-01-09 16:28:34,113 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 377 flow. Second operand 7 states and 218 transitions. [2025-01-09 16:28:34,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 860 flow [2025-01-09 16:28:34,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 798 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:34,142 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 388 flow [2025-01-09 16:28:34,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-01-09 16:28:34,143 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2025-01-09 16:28:34,143 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 388 flow [2025-01-09 16:28:34,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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:28:34,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:34,143 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, 1, 1] [2025-01-09 16:28:34,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:28:34,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:34,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash 40785539, now seen corresponding path program 1 times [2025-01-09 16:28:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:34,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152095188] [2025-01-09 16:28:34,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:34,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:28:34,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:28:34,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:34,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:34,489 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:28:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:34,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152095188] [2025-01-09 16:28:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152095188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:34,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:34,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:28:34,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418975723] [2025-01-09 16:28:34,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:34,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:34,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:34,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:34,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2025-01-09 16:28:34,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 388 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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:28:34,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:34,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2025-01-09 16:28:34,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:35,612 INFO L124 PetriNetUnfolderBase]: 8677/14006 cut-off events. [2025-01-09 16:28:35,612 INFO L125 PetriNetUnfolderBase]: For 35303/38683 co-relation queries the response was YES. [2025-01-09 16:28:35,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44422 conditions, 14006 events. 8677/14006 cut-off events. For 35303/38683 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 104551 event pairs, 1901 based on Foata normal form. 295/13053 useless extension candidates. Maximal degree in co-relation 44396. Up to 5691 conditions per place. [2025-01-09 16:28:35,693 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 51 selfloop transitions, 5 changer transitions 52/139 dead transitions. [2025-01-09 16:28:35,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 139 transitions, 879 flow [2025-01-09 16:28:35,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 225 transitions. [2025-01-09 16:28:35,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2025-01-09 16:28:35,695 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 388 flow. Second operand 8 states and 225 transitions. [2025-01-09 16:28:35,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 139 transitions, 879 flow [2025-01-09 16:28:35,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 139 transitions, 792 flow, removed 32 selfloop flow, removed 6 redundant places. [2025-01-09 16:28:35,853 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 375 flow [2025-01-09 16:28:35,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=375, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2025-01-09 16:28:35,853 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2025-01-09 16:28:35,853 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 375 flow [2025-01-09 16:28:35,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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:28:35,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:35,854 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, 1, 1] [2025-01-09 16:28:35,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:28:35,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1711464353, now seen corresponding path program 2 times [2025-01-09 16:28:35,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:35,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880758303] [2025-01-09 16:28:35,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:28:35,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:35,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:28:35,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:28:35,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:28:35,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:36,168 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:28:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880758303] [2025-01-09 16:28:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880758303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:28:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977065216] [2025-01-09 16:28:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:36,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:36,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:36,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2025-01-09 16:28:36,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 375 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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:28:36,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:36,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2025-01-09 16:28:36,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:37,357 INFO L124 PetriNetUnfolderBase]: 7442/12154 cut-off events. [2025-01-09 16:28:37,358 INFO L125 PetriNetUnfolderBase]: For 18002/19922 co-relation queries the response was YES. [2025-01-09 16:28:37,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35378 conditions, 12154 events. 7442/12154 cut-off events. For 18002/19922 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 92258 event pairs, 949 based on Foata normal form. 220/11012 useless extension candidates. Maximal degree in co-relation 35348. Up to 4955 conditions per place. [2025-01-09 16:28:37,452 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 74 selfloop transitions, 9 changer transitions 12/126 dead transitions. [2025-01-09 16:28:37,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 126 transitions, 790 flow [2025-01-09 16:28:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2025-01-09 16:28:37,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2025-01-09 16:28:37,454 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 375 flow. Second operand 8 states and 215 transitions. [2025-01-09 16:28:37,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 126 transitions, 790 flow [2025-01-09 16:28:37,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 780 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:37,598 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 420 flow [2025-01-09 16:28:37,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=420, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2025-01-09 16:28:37,599 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2025-01-09 16:28:37,599 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 420 flow [2025-01-09 16:28:37,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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:28:37,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:37,599 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, 1, 1] [2025-01-09 16:28:37,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:28:37,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:37,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash -997496171, now seen corresponding path program 3 times [2025-01-09 16:28:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:37,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403480780] [2025-01-09 16:28:37,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:28:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:37,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:28:37,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:28:37,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:28:37,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:37,997 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:28:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403480780] [2025-01-09 16:28:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403480780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:37,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:28:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553023043] [2025-01-09 16:28:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:37,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:37,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:37,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:38,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2025-01-09 16:28:38,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 420 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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:28:38,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:38,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2025-01-09 16:28:38,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:39,637 INFO L124 PetriNetUnfolderBase]: 12337/20758 cut-off events. [2025-01-09 16:28:39,637 INFO L125 PetriNetUnfolderBase]: For 33624/36628 co-relation queries the response was YES. [2025-01-09 16:28:39,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62000 conditions, 20758 events. 12337/20758 cut-off events. For 33624/36628 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 177355 event pairs, 1927 based on Foata normal form. 367/18827 useless extension candidates. Maximal degree in co-relation 61967. Up to 7429 conditions per place. [2025-01-09 16:28:39,791 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 40 selfloop transitions, 4 changer transitions 57/132 dead transitions. [2025-01-09 16:28:39,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 132 transitions, 890 flow [2025-01-09 16:28:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2025-01-09 16:28:39,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-01-09 16:28:39,793 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 420 flow. Second operand 8 states and 210 transitions. [2025-01-09 16:28:39,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 132 transitions, 890 flow [2025-01-09 16:28:40,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 132 transitions, 875 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:40,231 INFO L231 Difference]: Finished difference. Result has 95 places, 62 transitions, 355 flow [2025-01-09 16:28:40,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=95, PETRI_TRANSITIONS=62} [2025-01-09 16:28:40,232 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places. [2025-01-09 16:28:40,232 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 62 transitions, 355 flow [2025-01-09 16:28:40,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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:28:40,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:40,232 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, 1, 1] [2025-01-09 16:28:40,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:28:40,232 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:40,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash -95273471, now seen corresponding path program 4 times [2025-01-09 16:28:40,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:40,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380360781] [2025-01-09 16:28:40,233 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:28:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:40,246 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:28:40,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:28:40,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:28:40,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:41,102 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:28:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:41,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380360781] [2025-01-09 16:28:41,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380360781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:41,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:41,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:28:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370507299] [2025-01-09 16:28:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:41,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:28:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:41,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:28:41,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:28:41,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:28:41,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 62 transitions, 355 flow. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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:28:41,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:41,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:28:41,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:41,801 INFO L124 PetriNetUnfolderBase]: 4613/8282 cut-off events. [2025-01-09 16:28:41,802 INFO L125 PetriNetUnfolderBase]: For 12100/13609 co-relation queries the response was YES. [2025-01-09 16:28:41,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24296 conditions, 8282 events. 4613/8282 cut-off events. For 12100/13609 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 64874 event pairs, 1011 based on Foata normal form. 128/7436 useless extension candidates. Maximal degree in co-relation 24260. Up to 3288 conditions per place. [2025-01-09 16:28:41,869 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 40 selfloop transitions, 8 changer transitions 12/93 dead transitions. [2025-01-09 16:28:41,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 583 flow [2025-01-09 16:28:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:28:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:28:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2025-01-09 16:28:41,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-09 16:28:41,870 INFO L175 Difference]: Start difference. First operand has 95 places, 62 transitions, 355 flow. Second operand 7 states and 203 transitions. [2025-01-09 16:28:41,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 583 flow [2025-01-09 16:28:41,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 547 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-01-09 16:28:41,977 INFO L231 Difference]: Finished difference. Result has 90 places, 65 transitions, 381 flow [2025-01-09 16:28:41,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=381, PETRI_PLACES=90, PETRI_TRANSITIONS=65} [2025-01-09 16:28:41,978 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 34 predicate places. [2025-01-09 16:28:41,978 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 65 transitions, 381 flow [2025-01-09 16:28:41,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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:28:41,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:41,978 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, 1, 1] [2025-01-09 16:28:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:28:41,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:41,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1525627265, now seen corresponding path program 5 times [2025-01-09 16:28:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793859987] [2025-01-09 16:28:41,979 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:28:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:41,985 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:28:42,003 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:28:42,003 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:28:42,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:43,130 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:28:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:43,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793859987] [2025-01-09 16:28:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793859987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:43,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:43,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:28:43,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449622044] [2025-01-09 16:28:43,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:43,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:28:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:43,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:28:43,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:28:43,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-09 16:28:43,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 65 transitions, 381 flow. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 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:28:43,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:43,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-09 16:28:43,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:44,038 INFO L124 PetriNetUnfolderBase]: 5465/9923 cut-off events. [2025-01-09 16:28:44,038 INFO L125 PetriNetUnfolderBase]: For 17320/19072 co-relation queries the response was YES. [2025-01-09 16:28:44,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30490 conditions, 9923 events. 5465/9923 cut-off events. For 17320/19072 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 81332 event pairs, 1777 based on Foata normal form. 161/9005 useless extension candidates. Maximal degree in co-relation 30457. Up to 4221 conditions per place. [2025-01-09 16:28:44,107 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 39 selfloop transitions, 9 changer transitions 28/109 dead transitions. [2025-01-09 16:28:44,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 109 transitions, 687 flow [2025-01-09 16:28:44,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:28:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:28:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 249 transitions. [2025-01-09 16:28:44,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-01-09 16:28:44,108 INFO L175 Difference]: Start difference. First operand has 90 places, 65 transitions, 381 flow. Second operand 9 states and 249 transitions. [2025-01-09 16:28:44,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 109 transitions, 687 flow [2025-01-09 16:28:44,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 109 transitions, 677 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:44,268 INFO L231 Difference]: Finished difference. Result has 96 places, 65 transitions, 402 flow [2025-01-09 16:28:44,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=402, PETRI_PLACES=96, PETRI_TRANSITIONS=65} [2025-01-09 16:28:44,268 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 40 predicate places. [2025-01-09 16:28:44,268 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 65 transitions, 402 flow [2025-01-09 16:28:44,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 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:28:44,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:44,269 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, 1, 1] [2025-01-09 16:28:44,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:28:44,269 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:44,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash -452568347, now seen corresponding path program 6 times [2025-01-09 16:28:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466701518] [2025-01-09 16:28:44,269 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:28:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:44,278 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:28:44,312 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:28:44,312 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:28:44,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:28:44,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:28:44,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:28:44,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:28:44,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:44,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:28:44,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:28:44,380 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:28:44,381 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-01-09 16:28:44,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-01-09 16:28:44,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 16:28:44,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-09 16:28:44,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-09 16:28:44,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-09 16:28:44,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-01-09 16:28:44,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:28:44,383 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:44,448 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:28:44,448 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:28:44,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:28:44 BasicIcfg [2025-01-09 16:28:44,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:28:44,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:28:44,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:28:44,452 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:28:44,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:22" (3/4) ... [2025-01-09 16:28:44,453 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:28:44,538 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 16:28:44,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:28:44,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:28:44,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:28:44,578 INFO L158 Benchmark]: Toolchain (without parser) took 22822.47ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 112.4MB in the beginning and 856.6MB in the end (delta: -744.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-01-09 16:28:44,578 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:28:44,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.65ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 88.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:28:44,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.18ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:28:44,581 INFO L158 Benchmark]: Boogie Preprocessor took 45.85ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 82.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:28:44,581 INFO L158 Benchmark]: RCFGBuilder took 616.20ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 96.2MB in the end (delta: -13.7MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-01-09 16:28:44,581 INFO L158 Benchmark]: TraceAbstraction took 21588.41ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 95.4MB in the beginning and 877.6MB in the end (delta: -782.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 16:28:44,581 INFO L158 Benchmark]: Witness Printer took 124.18ms. Allocated memory is still 2.0GB. Free memory was 877.6MB in the beginning and 856.6MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:28:44,582 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.65ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 88.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.18ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.85ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 82.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 616.20ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 96.2MB in the end (delta: -13.7MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21588.41ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 95.4MB in the beginning and 877.6MB in the end (delta: -782.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 124.18ms. Allocated memory is still 2.0GB. Free memory was 877.6MB in the beginning and 856.6MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L826] 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) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 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 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 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}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: 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, 81 locations, 7 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: 21.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 992 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2496 IncrementalHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 36 mSDtfsCounter, 2496 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=11, InterpolantAutomatonStates: 97, 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, 5.5s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 3379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:28:44,605 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