./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix017.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/mix017.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 a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:26:10,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:26:10,654 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:26:10,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:26:10,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:26:10,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:26:10,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:26:10,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:26:10,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:26:10,688 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:26:10,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:26:10,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:26:10,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:26:10,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:26:10,689 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:26:10,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:26:10,690 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:26:10,690 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:26:10,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:26:10,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:26:10,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:26:10,691 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 -> a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 [2025-01-09 16:26:10,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:26:10,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:26:10,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:26:10,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:26:10,944 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:26:10,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix017.oepc.i [2025-01-09 16:26:12,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04cc7cb56/c61ccedd78f141c898e9d0a6c652bace/FLAG08a3e0036 [2025-01-09 16:26:12,365 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:26:12,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix017.oepc.i [2025-01-09 16:26:12,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04cc7cb56/c61ccedd78f141c898e9d0a6c652bace/FLAG08a3e0036 [2025-01-09 16:26:12,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04cc7cb56/c61ccedd78f141c898e9d0a6c652bace [2025-01-09 16:26:12,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:26:12,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:26:12,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:26:12,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:26:12,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:26:12,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28828d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12, skipping insertion in model container [2025-01-09 16:26:12,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:26:12,576 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/mix017.oepc.i[945,958] [2025-01-09 16:26:12,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:26:12,775 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:26:12,785 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/mix017.oepc.i[945,958] [2025-01-09 16:26:12,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:26:12,872 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:26:12,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12 WrapperNode [2025-01-09 16:26:12,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:26:12,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:26:12,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:26:12,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:26:12,879 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:26:12" (1/1) ... [2025-01-09 16:26:12,889 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:26:12" (1/1) ... [2025-01-09 16:26:12,907 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-01-09 16:26:12,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:26:12,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:26:12,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:26:12,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:26:12,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,936 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:26:12,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,944 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:26:12,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:26:12,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:26:12,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:26:12,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (1/1) ... [2025-01-09 16:26:12,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:26:12,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:26:12,983 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:26:12,986 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:26:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:26:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:26:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:26:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:26:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:26:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:26:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:26:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:26:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-09 16:26:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-09 16:26:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:26:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:26:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:26:13,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:26:13,009 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:26:13,111 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:26:13,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:26:13,384 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:26:13,384 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:26:13,554 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:26:13,555 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:26:13,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:26:13 BoogieIcfgContainer [2025-01-09 16:26:13,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:26:13,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:26:13,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:26:13,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:26:13,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:26:12" (1/3) ... [2025-01-09 16:26:13,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638e95cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:26:13, skipping insertion in model container [2025-01-09 16:26:13,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:12" (2/3) ... [2025-01-09 16:26:13,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638e95cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:26:13, skipping insertion in model container [2025-01-09 16:26:13,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:26:13" (3/3) ... [2025-01-09 16:26:13,564 INFO L128 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2025-01-09 16:26:13,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:26:13,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix017.oepc.i that has 5 procedures, 49 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-09 16:26:13,575 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:26:13,624 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:26:13,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2025-01-09 16:26:13,679 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2025-01-09 16:26:13,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:26:13,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-01-09 16:26:13,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2025-01-09 16:26:13,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2025-01-09 16:26:13,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:26:13,704 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;@3ff12c4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:26:13,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:26:13,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:26:13,708 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-09 16:26:13,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:26:13,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:13,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-09 16:26:13,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:13,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash 12023700, now seen corresponding path program 1 times [2025-01-09 16:26:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329700327] [2025-01-09 16:26:13,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:26:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:13,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 16:26:13,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 16:26:13,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:26:13,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:14,042 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:26:14,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:14,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329700327] [2025-01-09 16:26:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329700327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:26:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126273513] [2025-01-09 16:26:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:14,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:26:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:14,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:26:14,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:26:14,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2025-01-09 16:26:14,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:26:14,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:14,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2025-01-09 16:26:14,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:14,714 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2025-01-09 16:26:14,716 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 16:26:14,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 4136 events. 2495/4136 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28535 event pairs, 443 based on Foata normal form. 135/4200 useless extension candidates. Maximal degree in co-relation 7700. Up to 2779 conditions per place. [2025-01-09 16:26:14,750 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2025-01-09 16:26:14,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2025-01-09 16:26:14,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:26:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:26:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-01-09 16:26:14,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2025-01-09 16:26:14,764 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2025-01-09 16:26:14,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2025-01-09 16:26:14,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:26:14,771 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2025-01-09 16:26:14,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-01-09 16:26:14,777 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2025-01-09 16:26:14,778 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2025-01-09 16:26:14,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:26:14,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:14,780 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:26:14,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:26:14,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:14,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1673571900, now seen corresponding path program 1 times [2025-01-09 16:26:14,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:14,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415884964] [2025-01-09 16:26:14,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:26:14,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:14,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:26:14,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:26:14,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:26:14,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:15,048 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:26:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415884964] [2025-01-09 16:26:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415884964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:15,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:26:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159908524] [2025-01-09 16:26:15,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:15,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:26:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:15,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:26:15,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:26:15,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2025-01-09 16:26:15,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:26:15,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:15,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2025-01-09 16:26:15,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:16,752 INFO L124 PetriNetUnfolderBase]: 13249/19196 cut-off events. [2025-01-09 16:26:16,752 INFO L125 PetriNetUnfolderBase]: For 918/918 co-relation queries the response was YES. [2025-01-09 16:26:16,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38182 conditions, 19196 events. 13249/19196 cut-off events. For 918/918 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 128823 event pairs, 7720 based on Foata normal form. 0/18787 useless extension candidates. Maximal degree in co-relation 38172. Up to 11671 conditions per place. [2025-01-09 16:26:16,852 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 37 selfloop transitions, 5 changer transitions 58/113 dead transitions. [2025-01-09 16:26:16,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 113 transitions, 456 flow [2025-01-09 16:26:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:26:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:26:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2025-01-09 16:26:16,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-01-09 16:26:16,854 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 8 states and 238 transitions. [2025-01-09 16:26:16,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 113 transitions, 456 flow [2025-01-09 16:26:16,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 113 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:26:16,857 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 147 flow [2025-01-09 16:26:16,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=147, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-01-09 16:26:16,858 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2025-01-09 16:26:16,858 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 147 flow [2025-01-09 16:26:16,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:26:16,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:16,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] [2025-01-09 16:26:16,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:26:16,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1502900189, now seen corresponding path program 1 times [2025-01-09 16:26:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528746174] [2025-01-09 16:26:16,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:26:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:16,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:26:16,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:26:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:26:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:17,062 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:26:17,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528746174] [2025-01-09 16:26:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528746174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:17,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:26:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535412803] [2025-01-09 16:26:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:17,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:26:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:17,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:26:17,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:26:17,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2025-01-09 16:26:17,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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:26:17,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:17,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2025-01-09 16:26:17,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:18,524 INFO L124 PetriNetUnfolderBase]: 10019/14530 cut-off events. [2025-01-09 16:26:18,525 INFO L125 PetriNetUnfolderBase]: For 14250/14253 co-relation queries the response was YES. [2025-01-09 16:26:18,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39463 conditions, 14530 events. 10019/14530 cut-off events. For 14250/14253 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 92654 event pairs, 1683 based on Foata normal form. 390/14849 useless extension candidates. Maximal degree in co-relation 39448. Up to 9073 conditions per place. [2025-01-09 16:26:18,602 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 42 selfloop transitions, 3 changer transitions 51/109 dead transitions. [2025-01-09 16:26:18,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 579 flow [2025-01-09 16:26:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:26:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:26:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2025-01-09 16:26:18,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6209912536443148 [2025-01-09 16:26:18,608 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 147 flow. Second operand 7 states and 213 transitions. [2025-01-09 16:26:18,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 579 flow [2025-01-09 16:26:18,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 109 transitions, 566 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:26:18,691 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 157 flow [2025-01-09 16:26:18,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-01-09 16:26:18,692 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2025-01-09 16:26:18,692 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 157 flow [2025-01-09 16:26:18,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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:26:18,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:18,693 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:26:18,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:26:18,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:18,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:18,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1094328144, now seen corresponding path program 1 times [2025-01-09 16:26:18,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:18,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177956520] [2025-01-09 16:26:18,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:26:18,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:18,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:26:18,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:26:18,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:26:18,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:18,833 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:26:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177956520] [2025-01-09 16:26:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177956520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:18,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:18,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:26:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415288994] [2025-01-09 16:26:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:18,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:26:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:18,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:26:18,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:26:18,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-01-09 16:26:18,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:26:18,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:18,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-01-09 16:26:18,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:20,179 INFO L124 PetriNetUnfolderBase]: 13591/20365 cut-off events. [2025-01-09 16:26:20,179 INFO L125 PetriNetUnfolderBase]: For 9627/9807 co-relation queries the response was YES. [2025-01-09 16:26:20,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46526 conditions, 20365 events. 13591/20365 cut-off events. For 9627/9807 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 143684 event pairs, 2484 based on Foata normal form. 681/20267 useless extension candidates. Maximal degree in co-relation 46507. Up to 9547 conditions per place. [2025-01-09 16:26:20,328 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 53 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2025-01-09 16:26:20,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 345 flow [2025-01-09 16:26:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:26:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:26:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-01-09 16:26:20,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2025-01-09 16:26:20,330 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 157 flow. Second operand 4 states and 137 transitions. [2025-01-09 16:26:20,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 345 flow [2025-01-09 16:26:20,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 331 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-09 16:26:20,447 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 189 flow [2025-01-09 16:26:20,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-01-09 16:26:20,448 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2025-01-09 16:26:20,448 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 189 flow [2025-01-09 16:26:20,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:26:20,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:20,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:26:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:26:20,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2057947707, now seen corresponding path program 1 times [2025-01-09 16:26:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370014707] [2025-01-09 16:26:20,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:26:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:20,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:26:20,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:26:20,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:26:20,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:20,675 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:26:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:20,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370014707] [2025-01-09 16:26:20,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370014707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:20,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:20,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:26:20,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301405496] [2025-01-09 16:26:20,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:20,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:26:20,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:20,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:26:20,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:26:20,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-01-09 16:26:20,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:26:20,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:20,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-01-09 16:26:20,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:22,395 INFO L124 PetriNetUnfolderBase]: 11180/16762 cut-off events. [2025-01-09 16:26:22,396 INFO L125 PetriNetUnfolderBase]: For 5969/6083 co-relation queries the response was YES. [2025-01-09 16:26:22,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40643 conditions, 16762 events. 11180/16762 cut-off events. For 5969/6083 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 113530 event pairs, 1467 based on Foata normal form. 602/16714 useless extension candidates. Maximal degree in co-relation 40626. Up to 5576 conditions per place. [2025-01-09 16:26:22,542 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 69 selfloop transitions, 10 changer transitions 0/97 dead transitions. [2025-01-09 16:26:22,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 470 flow [2025-01-09 16:26:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:26:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:26:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-01-09 16:26:22,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183673469387755 [2025-01-09 16:26:22,544 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 189 flow. Second operand 5 states and 176 transitions. [2025-01-09 16:26:22,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 470 flow [2025-01-09 16:26:22,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:26:22,549 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 254 flow [2025-01-09 16:26:22,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2025-01-09 16:26:22,550 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2025-01-09 16:26:22,550 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 254 flow [2025-01-09 16:26:22,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:26:22,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:22,550 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] [2025-01-09 16:26:22,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:26:22,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:22,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash -246178957, now seen corresponding path program 1 times [2025-01-09 16:26:22,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:22,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562248190] [2025-01-09 16:26:22,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:26:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:22,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:26:22,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:26:22,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:26:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:23,202 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:26:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562248190] [2025-01-09 16:26:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562248190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:23,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:23,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:26:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68982820] [2025-01-09 16:26:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:23,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:26:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:23,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:26:23,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:26:23,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2025-01-09 16:26:23,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 254 flow. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 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:26:23,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:23,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2025-01-09 16:26:23,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:25,649 INFO L124 PetriNetUnfolderBase]: 20706/32193 cut-off events. [2025-01-09 16:26:25,649 INFO L125 PetriNetUnfolderBase]: For 38688/44172 co-relation queries the response was YES. [2025-01-09 16:26:25,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91692 conditions, 32193 events. 20706/32193 cut-off events. For 38688/44172 co-relation queries the response was YES. Maximal size of possible extension queue 1717. Compared 254937 event pairs, 5597 based on Foata normal form. 609/30793 useless extension candidates. Maximal degree in co-relation 91672. Up to 12177 conditions per place. [2025-01-09 16:26:25,881 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 127 selfloop transitions, 32 changer transitions 12/194 dead transitions. [2025-01-09 16:26:25,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 194 transitions, 1085 flow [2025-01-09 16:26:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:26:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:26:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 410 transitions. [2025-01-09 16:26:25,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.597667638483965 [2025-01-09 16:26:25,883 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 254 flow. Second operand 14 states and 410 transitions. [2025-01-09 16:26:25,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 194 transitions, 1085 flow [2025-01-09 16:26:25,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 194 transitions, 1070 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:26:25,892 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 518 flow [2025-01-09 16:26:25,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=518, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2025-01-09 16:26:25,893 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2025-01-09 16:26:25,893 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 518 flow [2025-01-09 16:26:25,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 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:26:25,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:25,893 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] [2025-01-09 16:26:25,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:26:25,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:25,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:25,894 INFO L85 PathProgramCache]: Analyzing trace with hash 745626647, now seen corresponding path program 2 times [2025-01-09 16:26:25,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:25,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481105535] [2025-01-09 16:26:25,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:26:25,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:25,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:26:25,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:26:25,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:26:25,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:26,111 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:26:26,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481105535] [2025-01-09 16:26:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481105535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:26,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:26,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:26:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892046564] [2025-01-09 16:26:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:26,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:26:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:26,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:26:26,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:26:26,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-01-09 16:26:26,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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:26:26,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:26,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-01-09 16:26:26,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:28,573 INFO L124 PetriNetUnfolderBase]: 22487/33244 cut-off events. [2025-01-09 16:26:28,573 INFO L125 PetriNetUnfolderBase]: For 57973/60138 co-relation queries the response was YES. [2025-01-09 16:26:28,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107483 conditions, 33244 events. 22487/33244 cut-off events. For 57973/60138 co-relation queries the response was YES. Maximal size of possible extension queue 1337. Compared 230250 event pairs, 1780 based on Foata normal form. 1438/33840 useless extension candidates. Maximal degree in co-relation 107453. Up to 11270 conditions per place. [2025-01-09 16:26:28,845 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 118 selfloop transitions, 14 changer transitions 10/170 dead transitions. [2025-01-09 16:26:28,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 170 transitions, 1198 flow [2025-01-09 16:26:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:26:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:26:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2025-01-09 16:26:28,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2025-01-09 16:26:28,850 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 518 flow. Second operand 6 states and 213 transitions. [2025-01-09 16:26:28,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 170 transitions, 1198 flow [2025-01-09 16:26:28,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 170 transitions, 1145 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-01-09 16:26:28,895 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 526 flow [2025-01-09 16:26:28,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=526, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2025-01-09 16:26:28,896 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2025-01-09 16:26:28,896 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 526 flow [2025-01-09 16:26:28,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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:26:28,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:28,896 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] [2025-01-09 16:26:28,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:26:28,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:28,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash -713801392, now seen corresponding path program 1 times [2025-01-09 16:26:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963272918] [2025-01-09 16:26:28,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:26:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:28,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:26:28,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:26:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:26:28,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:29,660 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:26:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963272918] [2025-01-09 16:26:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963272918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:29,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:26:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422345188] [2025-01-09 16:26:29,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:29,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:26:29,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:29,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:26:29,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:26:29,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-09 16:26:29,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 526 flow. Second operand has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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:26:29,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:29,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-09 16:26:29,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:32,172 INFO L124 PetriNetUnfolderBase]: 17013/29197 cut-off events. [2025-01-09 16:26:32,172 INFO L125 PetriNetUnfolderBase]: For 66420/75957 co-relation queries the response was YES. [2025-01-09 16:26:32,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94459 conditions, 29197 events. 17013/29197 cut-off events. For 66420/75957 co-relation queries the response was YES. Maximal size of possible extension queue 1997. Compared 263997 event pairs, 5372 based on Foata normal form. 1193/27479 useless extension candidates. Maximal degree in co-relation 94428. Up to 9325 conditions per place. [2025-01-09 16:26:32,426 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 80 selfloop transitions, 22 changer transitions 26/171 dead transitions. [2025-01-09 16:26:32,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 171 transitions, 1187 flow [2025-01-09 16:26:32,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:26:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:26:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 289 transitions. [2025-01-09 16:26:32,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655328798185941 [2025-01-09 16:26:32,428 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 526 flow. Second operand 9 states and 289 transitions. [2025-01-09 16:26:32,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 171 transitions, 1187 flow [2025-01-09 16:26:32,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 171 transitions, 1140 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-09 16:26:32,641 INFO L231 Difference]: Finished difference. Result has 95 places, 98 transitions, 663 flow [2025-01-09 16:26:32,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=663, PETRI_PLACES=95, PETRI_TRANSITIONS=98} [2025-01-09 16:26:32,642 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2025-01-09 16:26:32,642 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 98 transitions, 663 flow [2025-01-09 16:26:32,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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:26:32,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:32,642 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] [2025-01-09 16:26:32,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:26:32,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:32,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1086634778, now seen corresponding path program 2 times [2025-01-09 16:26:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318679023] [2025-01-09 16:26:32,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:26:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:32,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:26:32,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:26:32,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:26:32,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:32,841 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:26:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318679023] [2025-01-09 16:26:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318679023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:32,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:32,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:26:32,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291001473] [2025-01-09 16:26:32,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:32,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:26:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:32,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:26:32,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:26:32,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2025-01-09 16:26:32,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 98 transitions, 663 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 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:26:32,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:32,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2025-01-09 16:26:32,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:38,170 INFO L124 PetriNetUnfolderBase]: 35671/56474 cut-off events. [2025-01-09 16:26:38,170 INFO L125 PetriNetUnfolderBase]: For 181255/194075 co-relation queries the response was YES. [2025-01-09 16:26:38,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201551 conditions, 56474 events. 35671/56474 cut-off events. For 181255/194075 co-relation queries the response was YES. Maximal size of possible extension queue 3958. Compared 505595 event pairs, 10912 based on Foata normal form. 1530/51913 useless extension candidates. Maximal degree in co-relation 201516. Up to 22005 conditions per place. [2025-01-09 16:26:38,768 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 160 selfloop transitions, 16 changer transitions 34/237 dead transitions. [2025-01-09 16:26:38,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 237 transitions, 2011 flow [2025-01-09 16:26:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:26:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:26:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 246 transitions. [2025-01-09 16:26:38,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6275510204081632 [2025-01-09 16:26:38,770 INFO L175 Difference]: Start difference. First operand has 95 places, 98 transitions, 663 flow. Second operand 8 states and 246 transitions. [2025-01-09 16:26:38,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 237 transitions, 2011 flow [2025-01-09 16:26:39,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 237 transitions, 1944 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-01-09 16:26:39,877 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 739 flow [2025-01-09 16:26:39,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=739, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2025-01-09 16:26:39,878 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 40 predicate places. [2025-01-09 16:26:39,878 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 739 flow [2025-01-09 16:26:39,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 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:26:39,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:39,878 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] [2025-01-09 16:26:39,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:26:39,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:39,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:39,879 INFO L85 PathProgramCache]: Analyzing trace with hash -13104314, now seen corresponding path program 3 times [2025-01-09 16:26:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:39,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291019294] [2025-01-09 16:26:39,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:26:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:39,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:26:39,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:26:39,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:26:39,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:40,075 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:26:40,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:40,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291019294] [2025-01-09 16:26:40,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291019294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:40,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:40,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:26:40,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711819205] [2025-01-09 16:26:40,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:40,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:26:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:40,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:26:40,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:26:40,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-01-09 16:26:40,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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:26:40,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:40,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-01-09 16:26:40,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:47,157 INFO L124 PetriNetUnfolderBase]: 50522/73645 cut-off events. [2025-01-09 16:26:47,157 INFO L125 PetriNetUnfolderBase]: For 199461/207734 co-relation queries the response was YES. [2025-01-09 16:26:47,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267780 conditions, 73645 events. 50522/73645 cut-off events. For 199461/207734 co-relation queries the response was YES. Maximal size of possible extension queue 3579. Compared 564462 event pairs, 3428 based on Foata normal form. 2862/74847 useless extension candidates. Maximal degree in co-relation 267744. Up to 28056 conditions per place. [2025-01-09 16:26:47,744 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 123 selfloop transitions, 18 changer transitions 55/216 dead transitions. [2025-01-09 16:26:47,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 216 transitions, 1773 flow [2025-01-09 16:26:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:26:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:26:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2025-01-09 16:26:47,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6647230320699709 [2025-01-09 16:26:47,745 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 739 flow. Second operand 7 states and 228 transitions. [2025-01-09 16:26:47,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 216 transitions, 1773 flow [2025-01-09 16:26:51,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 216 transitions, 1734 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-01-09 16:26:51,025 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 552 flow [2025-01-09 16:26:51,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=552, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2025-01-09 16:26:51,027 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 42 predicate places. [2025-01-09 16:26:51,028 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 552 flow [2025-01-09 16:26:51,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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:26:51,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:51,028 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, 1] [2025-01-09 16:26:51,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:26:51,028 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:51,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1685479483, now seen corresponding path program 1 times [2025-01-09 16:26:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:51,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882630221] [2025-01-09 16:26:51,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:26:51,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:51,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:26:51,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:26:51,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:26:51,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:51,291 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:26:51,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:51,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882630221] [2025-01-09 16:26:51,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882630221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:51,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:51,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:26:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048607356] [2025-01-09 16:26:51,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:51,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:26:51,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:51,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:26:51,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:26:51,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2025-01-09 16:26:51,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 552 flow. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 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:26:51,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:51,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2025-01-09 16:26:51,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:53,544 INFO L124 PetriNetUnfolderBase]: 15004/24754 cut-off events. [2025-01-09 16:26:53,544 INFO L125 PetriNetUnfolderBase]: For 101581/109435 co-relation queries the response was YES. [2025-01-09 16:26:53,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89669 conditions, 24754 events. 15004/24754 cut-off events. For 101581/109435 co-relation queries the response was YES. Maximal size of possible extension queue 2009. Compared 211916 event pairs, 2427 based on Foata normal form. 474/22497 useless extension candidates. Maximal degree in co-relation 89633. Up to 9418 conditions per place. [2025-01-09 16:26:53,920 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 86 selfloop transitions, 9 changer transitions 36/160 dead transitions. [2025-01-09 16:26:53,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 160 transitions, 1246 flow [2025-01-09 16:26:53,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:26:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:26:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2025-01-09 16:26:53,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2025-01-09 16:26:53,921 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 552 flow. Second operand 8 states and 217 transitions. [2025-01-09 16:26:53,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 160 transitions, 1246 flow [2025-01-09 16:26:54,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 160 transitions, 1128 flow, removed 43 selfloop flow, removed 10 redundant places. [2025-01-09 16:26:54,386 INFO L231 Difference]: Finished difference. Result has 97 places, 81 transitions, 503 flow [2025-01-09 16:26:54,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=503, PETRI_PLACES=97, PETRI_TRANSITIONS=81} [2025-01-09 16:26:54,387 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 40 predicate places. [2025-01-09 16:26:54,387 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 81 transitions, 503 flow [2025-01-09 16:26:54,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 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:26:54,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:54,387 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, 1] [2025-01-09 16:26:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:26:54,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -31532281, now seen corresponding path program 2 times [2025-01-09 16:26:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568143658] [2025-01-09 16:26:54,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:26:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:54,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:26:54,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:26:54,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:26:54,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:55,325 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:26:55,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:55,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568143658] [2025-01-09 16:26:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568143658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:55,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:26:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995302462] [2025-01-09 16:26:55,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:55,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:26:55,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:55,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:26:55,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:26:55,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-01-09 16:26:55,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 81 transitions, 503 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:26:55,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:55,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-01-09 16:26:55,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:26:57,758 INFO L124 PetriNetUnfolderBase]: 11565/20709 cut-off events. [2025-01-09 16:26:57,758 INFO L125 PetriNetUnfolderBase]: For 51882/59789 co-relation queries the response was YES. [2025-01-09 16:26:57,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65395 conditions, 20709 events. 11565/20709 cut-off events. For 51882/59789 co-relation queries the response was YES. Maximal size of possible extension queue 1730. Compared 192097 event pairs, 3094 based on Foata normal form. 859/19156 useless extension candidates. Maximal degree in co-relation 65361. Up to 6602 conditions per place. [2025-01-09 16:26:57,979 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 66 selfloop transitions, 10 changer transitions 16/133 dead transitions. [2025-01-09 16:26:57,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 133 transitions, 873 flow [2025-01-09 16:26:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:26:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:26:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 266 transitions. [2025-01-09 16:26:57,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-01-09 16:26:57,981 INFO L175 Difference]: Start difference. First operand has 97 places, 81 transitions, 503 flow. Second operand 9 states and 266 transitions. [2025-01-09 16:26:57,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 133 transitions, 873 flow [2025-01-09 16:26:58,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 133 transitions, 867 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:26:58,632 INFO L231 Difference]: Finished difference. Result has 105 places, 82 transitions, 540 flow [2025-01-09 16:26:58,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=105, PETRI_TRANSITIONS=82} [2025-01-09 16:26:58,633 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 48 predicate places. [2025-01-09 16:26:58,633 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 82 transitions, 540 flow [2025-01-09 16:26:58,633 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:26:58,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:26:58,633 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, 1] [2025-01-09 16:26:58,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:26:58,633 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:26:58,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:26:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1021104187, now seen corresponding path program 3 times [2025-01-09 16:26:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:26:58,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77691305] [2025-01-09 16:26:58,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:26:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:26:58,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:26:58,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:26:58,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:26:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:26:58,805 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:26:58,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:26:58,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77691305] [2025-01-09 16:26:58,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77691305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:26:58,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:26:58,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:26:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851636206] [2025-01-09 16:26:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:26:58,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:26:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:26:58,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:26:58,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:26:58,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-01-09 16:26:58,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 82 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:26:58,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:26:58,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-01-09 16:26:58,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:27:01,916 INFO L124 PetriNetUnfolderBase]: 22765/39156 cut-off events. [2025-01-09 16:27:01,916 INFO L125 PetriNetUnfolderBase]: For 118512/130675 co-relation queries the response was YES. [2025-01-09 16:27:02,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126168 conditions, 39156 events. 22765/39156 cut-off events. For 118512/130675 co-relation queries the response was YES. Maximal size of possible extension queue 3367. Compared 381786 event pairs, 5845 based on Foata normal form. 910/35092 useless extension candidates. Maximal degree in co-relation 126130. Up to 14489 conditions per place. [2025-01-09 16:27:02,480 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 41 selfloop transitions, 1 changer transitions 65/140 dead transitions. [2025-01-09 16:27:02,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 140 transitions, 1119 flow [2025-01-09 16:27:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:27:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:27:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-01-09 16:27:02,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5884353741496599 [2025-01-09 16:27:02,484 INFO L175 Difference]: Start difference. First operand has 105 places, 82 transitions, 540 flow. Second operand 6 states and 173 transitions. [2025-01-09 16:27:02,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 140 transitions, 1119 flow [2025-01-09 16:27:03,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 140 transitions, 1084 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-01-09 16:27:03,629 INFO L231 Difference]: Finished difference. Result has 105 places, 67 transitions, 403 flow [2025-01-09 16:27:03,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=105, PETRI_TRANSITIONS=67} [2025-01-09 16:27:03,632 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 48 predicate places. [2025-01-09 16:27:03,632 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 67 transitions, 403 flow [2025-01-09 16:27:03,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:27:03,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:27:03,632 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, 1] [2025-01-09 16:27:03,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:27:03,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:27:03,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:27:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1790338969, now seen corresponding path program 4 times [2025-01-09 16:27:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:27:03,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620862097] [2025-01-09 16:27:03,633 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:27:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:27:03,641 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:27:03,687 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:27:03,688 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:27:03,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:27:03,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:27:03,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:27:03,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:27:03,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:27:03,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:27:03,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:27:03,770 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:27:03,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-01-09 16:27:03,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-01-09 16:27:03,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 16:27:03,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-09 16:27:03,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-09 16:27:03,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-09 16:27:03,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-01-09 16:27:03,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:27:03,773 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:27:03,865 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:27:03,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:27:03,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:27:03 BasicIcfg [2025-01-09 16:27:03,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:27:03,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:27:03,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:27:03,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:27:03,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:26:13" (3/4) ... [2025-01-09 16:27:03,873 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:27:03,968 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 16:27:04,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:27:04,010 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:27:04,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:27:04,012 INFO L158 Benchmark]: Toolchain (without parser) took 51604.58ms. Allocated memory was 142.6MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 110.5MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-01-09 16:27:04,012 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:27:04,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.10ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 86.2MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:27:04,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.12ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:27:04,013 INFO L158 Benchmark]: Boogie Preprocessor took 48.28ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 80.8MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:27:04,014 INFO L158 Benchmark]: RCFGBuilder took 599.02ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 92.7MB in the end (delta: -11.9MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-01-09 16:27:04,014 INFO L158 Benchmark]: TraceAbstraction took 50313.23ms. Allocated memory was 142.6MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 92.0MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-01-09 16:27:04,014 INFO L158 Benchmark]: Witness Printer took 139.17ms. Allocated memory is still 11.3GB. Free memory was 9.2GB in the beginning and 9.2GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:27:04,016 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.23ms. Allocated memory is still 226.5MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.10ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 86.2MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.12ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.28ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 80.8MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 599.02ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 92.7MB in the end (delta: -11.9MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 50313.23ms. Allocated memory was 142.6MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 92.0MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 139.17ms. Allocated memory is still 11.3GB. Free memory was 9.2GB in the beginning and 9.2GB 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L868] 0 pthread_t t433; [L869] FCALL, FORK 0 pthread_create(&t433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t433=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; [L871] FCALL, FORK 0 pthread_create(&t434, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t433=-2, t434=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] 0 pthread_t t435; [L873] FCALL, FORK 0 pthread_create(&t435, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t433=-2, t434=-1, t435=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L874] 0 pthread_t t436; [L875] FCALL, FORK 0 pthread_create(&t436, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t433=-2, t434=-1, t435=0, t436=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L810] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L824] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L827] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L846] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, weak$$choice2=0, x=1, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L853] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433=-2, t434=-1, t435=0, t436=1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433=-2, t434=-1, t435=0, t436=1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433=-2, t434=-1, t435=0, t436=1, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L890] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, 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: 871]: 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: 869]: 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: 873]: 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: 875]: 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, 83 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: 50.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 45.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1085 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1043 mSDsluCounter, 427 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2907 IncrementalHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 91 mSDtfsCounter, 2907 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=739occurred in iteration=9, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 2649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:27:04,032 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