./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:28:00,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:28:00,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:28:00,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:28:00,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:28:00,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:28:00,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:28:00,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:28:00,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:28:00,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:28:00,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:28:00,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:28:00,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:28:00,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:28:00,653 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:28:00,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:28:00,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:00,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:28:00,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:00,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:28:00,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:28:00,655 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 -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2025-01-09 16:28:00,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:28:00,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:28:00,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:28:00,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:28:00,917 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:28:00,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2025-01-09 16:28:02,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b137c484/83b4b465078d4e3c9cf7b54239b1e991/FLAG73e267485 [2025-01-09 16:28:02,350 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:28:02,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2025-01-09 16:28:02,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b137c484/83b4b465078d4e3c9cf7b54239b1e991/FLAG73e267485 [2025-01-09 16:28:02,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b137c484/83b4b465078d4e3c9cf7b54239b1e991 [2025-01-09 16:28:02,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:28:02,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:28:02,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:28:02,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:28:02,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:28:02,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:02,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd58d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02, skipping insertion in model container [2025-01-09 16:28:02,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:02,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:28:02,757 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/mix044_tso.oepc.i[949,962] [2025-01-09 16:28:02,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:28:02,859 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:28:02,866 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/mix044_tso.oepc.i[949,962] [2025-01-09 16:28:02,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:28:02,924 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:28:02,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02 WrapperNode [2025-01-09 16:28:02,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:28:02,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:28:02,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:28:02,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:28:02,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:02,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:02,960 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2025-01-09 16:28:02,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:28:02,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:28:02,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:28:02,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:28:02,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:02,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:02,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:02,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:28:02,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:02,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:03,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:03,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:03,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:03,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:03,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:03,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:28:03,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:28:03,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:28:03,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:28:03,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (1/1) ... [2025-01-09 16:28:03,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:28:03,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:28:03,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:28:03,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:28:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:28:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:28:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:28:03,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:28:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:28:03,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:28:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:28:03,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:28:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-09 16:28:03,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-09 16:28:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:28:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:28:03,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:28:03,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:28:03,077 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:28:03,193 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:28:03,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:28:03,442 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:28:03,443 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:28:03,631 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:28:03,632 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:28:03,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:03 BoogieIcfgContainer [2025-01-09 16:28:03,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:28:03,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:28:03,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:28:03,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:28:03,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:28:02" (1/3) ... [2025-01-09 16:28:03,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f63cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:03, skipping insertion in model container [2025-01-09 16:28:03,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:02" (2/3) ... [2025-01-09 16:28:03,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f63cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:03, skipping insertion in model container [2025-01-09 16:28:03,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:03" (3/3) ... [2025-01-09 16:28:03,639 INFO L128 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2025-01-09 16:28:03,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:28:03,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix044_tso.oepc.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-09 16:28:03,651 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:28:03,696 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:28:03,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2025-01-09 16:28:03,781 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-01-09 16:28:03,786 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:28:03,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-01-09 16:28:03,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2025-01-09 16:28:03,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2025-01-09 16:28:03,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:28:03,822 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;@7e3050ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:28:03,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:28:03,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:28:03,830 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-09 16:28:03,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:28:03,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:03,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 16:28:03,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:03,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1330141704, now seen corresponding path program 1 times [2025-01-09 16:28:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:03,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983525328] [2025-01-09 16:28:03,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:03,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:03,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:28:04,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:28:04,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:04,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983525328] [2025-01-09 16:28:04,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983525328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:04,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:04,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:28:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665808947] [2025-01-09 16:28:04,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:04,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:28:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:04,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:28:04,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:28:04,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2025-01-09 16:28:04,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:04,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:04,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2025-01-09 16:28:04,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:04,924 INFO L124 PetriNetUnfolderBase]: 2160/3536 cut-off events. [2025-01-09 16:28:04,925 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-09 16:28:04,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6665 conditions, 3536 events. 2160/3536 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 22828 event pairs, 996 based on Foata normal form. 108/3547 useless extension candidates. Maximal degree in co-relation 6653. Up to 2416 conditions per place. [2025-01-09 16:28:04,961 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 35 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-01-09 16:28:04,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 216 flow [2025-01-09 16:28:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:28:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:28:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-01-09 16:28:04,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78 [2025-01-09 16:28:04,973 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 117 transitions. [2025-01-09 16:28:04,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 216 flow [2025-01-09 16:28:04,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:04,981 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2025-01-09 16:28:04,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-01-09 16:28:04,986 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-01-09 16:28:04,988 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2025-01-09 16:28:04,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:04,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:04,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:04,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:28:04,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:04,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1737666393, now seen corresponding path program 1 times [2025-01-09 16:28:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729296005] [2025-01-09 16:28:04,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:05,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:28:05,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:28:05,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:05,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:05,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729296005] [2025-01-09 16:28:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729296005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:05,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:05,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903855456] [2025-01-09 16:28:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:05,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:05,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:05,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:05,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-09 16:28:05,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:05,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:05,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-09 16:28:05,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:07,585 INFO L124 PetriNetUnfolderBase]: 12252/17474 cut-off events. [2025-01-09 16:28:07,586 INFO L125 PetriNetUnfolderBase]: For 858/858 co-relation queries the response was YES. [2025-01-09 16:28:07,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35043 conditions, 17474 events. 12252/17474 cut-off events. For 858/858 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 113137 event pairs, 2039 based on Foata normal form. 0/17098 useless extension candidates. Maximal degree in co-relation 35033. Up to 7327 conditions per place. [2025-01-09 16:28:07,670 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 44 selfloop transitions, 11 changer transitions 98/167 dead transitions. [2025-01-09 16:28:07,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 167 transitions, 672 flow [2025-01-09 16:28:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:28:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:28:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 372 transitions. [2025-01-09 16:28:07,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-01-09 16:28:07,677 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 12 states and 372 transitions. [2025-01-09 16:28:07,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 167 transitions, 672 flow [2025-01-09 16:28:07,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 167 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:07,683 INFO L231 Difference]: Finished difference. Result has 74 places, 51 transitions, 236 flow [2025-01-09 16:28:07,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, 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=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=236, PETRI_PLACES=74, PETRI_TRANSITIONS=51} [2025-01-09 16:28:07,685 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2025-01-09 16:28:07,685 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 51 transitions, 236 flow [2025-01-09 16:28:07,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:07,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:07,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:07,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:28:07,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:07,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1732130473, now seen corresponding path program 1 times [2025-01-09 16:28:07,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:07,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663783593] [2025-01-09 16:28:07,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:07,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:28:07,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:28:07,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:07,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663783593] [2025-01-09 16:28:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663783593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:08,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:08,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873462272] [2025-01-09 16:28:08,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:08,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:08,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:08,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:08,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-01-09 16:28:08,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 51 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:08,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:08,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-01-09 16:28:08,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:09,702 INFO L124 PetriNetUnfolderBase]: 9178/13478 cut-off events. [2025-01-09 16:28:09,703 INFO L125 PetriNetUnfolderBase]: For 27656/31004 co-relation queries the response was YES. [2025-01-09 16:28:09,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52273 conditions, 13478 events. 9178/13478 cut-off events. For 27656/31004 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 91837 event pairs, 2590 based on Foata normal form. 440/13122 useless extension candidates. Maximal degree in co-relation 52252. Up to 8502 conditions per place. [2025-01-09 16:28:09,800 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 45 selfloop transitions, 4 changer transitions 51/121 dead transitions. [2025-01-09 16:28:09,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 121 transitions, 832 flow [2025-01-09 16:28:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:28:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:28:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2025-01-09 16:28:09,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-01-09 16:28:09,802 INFO L175 Difference]: Start difference. First operand has 74 places, 51 transitions, 236 flow. Second operand 7 states and 230 transitions. [2025-01-09 16:28:09,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 121 transitions, 832 flow [2025-01-09 16:28:10,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 121 transitions, 760 flow, removed 35 selfloop flow, removed 5 redundant places. [2025-01-09 16:28:10,050 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 266 flow [2025-01-09 16:28:10,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2025-01-09 16:28:10,051 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2025-01-09 16:28:10,051 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 266 flow [2025-01-09 16:28:10,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:10,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:10,051 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:28:10,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:28:10,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:10,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1372756331, now seen corresponding path program 1 times [2025-01-09 16:28:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:10,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279458321] [2025-01-09 16:28:10,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:10,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:28:10,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:28:10,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:10,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279458321] [2025-01-09 16:28:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279458321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:10,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:10,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:10,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025054261] [2025-01-09 16:28:10,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:10,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:10,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:10,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:10,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-01-09 16:28:10,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:10,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:10,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-01-09 16:28:10,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:12,138 INFO L124 PetriNetUnfolderBase]: 9055/13561 cut-off events. [2025-01-09 16:28:12,139 INFO L125 PetriNetUnfolderBase]: For 25537/28635 co-relation queries the response was YES. [2025-01-09 16:28:12,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50584 conditions, 13561 events. 9055/13561 cut-off events. For 25537/28635 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 94038 event pairs, 2575 based on Foata normal form. 351/13161 useless extension candidates. Maximal degree in co-relation 50561. Up to 8555 conditions per place. [2025-01-09 16:28:12,220 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 55 selfloop transitions, 11 changer transitions 47/134 dead transitions. [2025-01-09 16:28:12,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 134 transitions, 912 flow [2025-01-09 16:28:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 263 transitions. [2025-01-09 16:28:12,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6575 [2025-01-09 16:28:12,222 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 266 flow. Second operand 8 states and 263 transitions. [2025-01-09 16:28:12,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 134 transitions, 912 flow [2025-01-09 16:28:12,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 134 transitions, 896 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-09 16:28:12,369 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 387 flow [2025-01-09 16:28:12,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2025-01-09 16:28:12,369 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2025-01-09 16:28:12,369 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 387 flow [2025-01-09 16:28:12,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:12,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:12,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:12,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:28:12,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1233351312, now seen corresponding path program 1 times [2025-01-09 16:28:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:12,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568860221] [2025-01-09 16:28:12,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:12,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:28:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:28:12,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:12,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568860221] [2025-01-09 16:28:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568860221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:12,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:12,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100568898] [2025-01-09 16:28:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:12,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:12,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:12,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:12,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-01-09 16:28:12,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:12,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:12,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-01-09 16:28:12,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:14,212 INFO L124 PetriNetUnfolderBase]: 9023/13374 cut-off events. [2025-01-09 16:28:14,213 INFO L125 PetriNetUnfolderBase]: For 58093/62344 co-relation queries the response was YES. [2025-01-09 16:28:14,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63024 conditions, 13374 events. 9023/13374 cut-off events. For 58093/62344 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 90740 event pairs, 1487 based on Foata normal form. 314/12984 useless extension candidates. Maximal degree in co-relation 62999. Up to 7556 conditions per place. [2025-01-09 16:28:14,322 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 64 selfloop transitions, 16 changer transitions 49/150 dead transitions. [2025-01-09 16:28:14,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 150 transitions, 1327 flow [2025-01-09 16:28:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 267 transitions. [2025-01-09 16:28:14,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6675 [2025-01-09 16:28:14,324 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 387 flow. Second operand 8 states and 267 transitions. [2025-01-09 16:28:14,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 150 transitions, 1327 flow [2025-01-09 16:28:14,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 150 transitions, 1296 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:14,514 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 535 flow [2025-01-09 16:28:14,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=535, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-01-09 16:28:14,515 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-01-09 16:28:14,515 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 535 flow [2025-01-09 16:28:14,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:14,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:14,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:14,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:28:14,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:14,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash -159448582, now seen corresponding path program 2 times [2025-01-09 16:28:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596659357] [2025-01-09 16:28:14,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:28:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:14,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:28:14,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:28:14,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:28:14,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596659357] [2025-01-09 16:28:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596659357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:14,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:14,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005734402] [2025-01-09 16:28:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:14,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:14,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:14,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:14,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-01-09 16:28:14,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 535 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:14,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:14,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-01-09 16:28:14,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:16,318 INFO L124 PetriNetUnfolderBase]: 8604/12815 cut-off events. [2025-01-09 16:28:16,318 INFO L125 PetriNetUnfolderBase]: For 73047/77869 co-relation queries the response was YES. [2025-01-09 16:28:16,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64580 conditions, 12815 events. 8604/12815 cut-off events. For 73047/77869 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 85810 event pairs, 1535 based on Foata normal form. 386/12483 useless extension candidates. Maximal degree in co-relation 64552. Up to 7472 conditions per place. [2025-01-09 16:28:16,436 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 61 selfloop transitions, 16 changer transitions 49/147 dead transitions. [2025-01-09 16:28:16,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 147 transitions, 1415 flow [2025-01-09 16:28:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2025-01-09 16:28:16,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-01-09 16:28:16,438 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 535 flow. Second operand 8 states and 264 transitions. [2025-01-09 16:28:16,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 147 transitions, 1415 flow [2025-01-09 16:28:16,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 1340 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-01-09 16:28:16,703 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 536 flow [2025-01-09 16:28:16,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2025-01-09 16:28:16,704 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2025-01-09 16:28:16,704 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 536 flow [2025-01-09 16:28:16,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:16,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:16,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:16,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:28:16,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:16,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 64772556, now seen corresponding path program 1 times [2025-01-09 16:28:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:16,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218381593] [2025-01-09 16:28:16,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:16,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:16,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:28:16,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:28:16,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:16,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:16,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:16,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218381593] [2025-01-09 16:28:16,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218381593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:16,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:16,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:28:16,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453814398] [2025-01-09 16:28:16,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:16,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:28:16,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:16,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:28:16,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:28:16,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:16,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 536 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:16,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:16,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:16,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:19,002 INFO L124 PetriNetUnfolderBase]: 17980/25581 cut-off events. [2025-01-09 16:28:19,002 INFO L125 PetriNetUnfolderBase]: For 165778/171167 co-relation queries the response was YES. [2025-01-09 16:28:19,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115770 conditions, 25581 events. 17980/25581 cut-off events. For 165778/171167 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 166007 event pairs, 2834 based on Foata normal form. 1442/25425 useless extension candidates. Maximal degree in co-relation 115740. Up to 13135 conditions per place. [2025-01-09 16:28:19,279 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 113 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-01-09 16:28:19,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 139 transitions, 1416 flow [2025-01-09 16:28:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:28:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:28:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-01-09 16:28:19,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.695 [2025-01-09 16:28:19,280 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 536 flow. Second operand 4 states and 139 transitions. [2025-01-09 16:28:19,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 139 transitions, 1416 flow [2025-01-09 16:28:19,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 139 transitions, 1316 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-01-09 16:28:19,467 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 534 flow [2025-01-09 16:28:19,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=534, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2025-01-09 16:28:19,468 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2025-01-09 16:28:19,468 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 534 flow [2025-01-09 16:28:19,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:19,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:19,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:19,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:28:19,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:19,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash 746853713, now seen corresponding path program 1 times [2025-01-09 16:28:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:19,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865672524] [2025-01-09 16:28:19,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:19,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:28:19,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:28:19,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:19,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865672524] [2025-01-09 16:28:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865672524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:19,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:28:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017104004] [2025-01-09 16:28:19,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:19,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:28:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:19,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:28:19,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:28:19,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:19,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 534 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:19,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:19,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:19,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:21,142 INFO L124 PetriNetUnfolderBase]: 14083/20447 cut-off events. [2025-01-09 16:28:21,143 INFO L125 PetriNetUnfolderBase]: For 120775/124020 co-relation queries the response was YES. [2025-01-09 16:28:21,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91657 conditions, 20447 events. 14083/20447 cut-off events. For 120775/124020 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 131681 event pairs, 1663 based on Foata normal form. 1240/20407 useless extension candidates. Maximal degree in co-relation 91630. Up to 8223 conditions per place. [2025-01-09 16:28:21,289 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 126 selfloop transitions, 10 changer transitions 0/156 dead transitions. [2025-01-09 16:28:21,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 156 transitions, 1499 flow [2025-01-09 16:28:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:28:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:28:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2025-01-09 16:28:21,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.712 [2025-01-09 16:28:21,293 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 534 flow. Second operand 5 states and 178 transitions. [2025-01-09 16:28:21,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 156 transitions, 1499 flow [2025-01-09 16:28:21,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 156 transitions, 1492 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:21,316 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 585 flow [2025-01-09 16:28:21,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=585, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2025-01-09 16:28:21,317 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-01-09 16:28:21,317 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 585 flow [2025-01-09 16:28:21,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:21,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:21,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:21,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:28:21,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:21,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1111014057, now seen corresponding path program 1 times [2025-01-09 16:28:21,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:21,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418837690] [2025-01-09 16:28:21,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:21,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:21,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:28:21,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:28:21,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:21,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418837690] [2025-01-09 16:28:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418837690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:21,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:21,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269254909] [2025-01-09 16:28:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:21,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:21,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:21,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:21,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:21,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:21,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 585 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:21,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:21,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:21,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:22,801 INFO L124 PetriNetUnfolderBase]: 10931/15899 cut-off events. [2025-01-09 16:28:22,801 INFO L125 PetriNetUnfolderBase]: For 110619/113435 co-relation queries the response was YES. [2025-01-09 16:28:22,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75629 conditions, 15899 events. 10931/15899 cut-off events. For 110619/113435 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 99102 event pairs, 1211 based on Foata normal form. 882/15621 useless extension candidates. Maximal degree in co-relation 75600. Up to 6191 conditions per place. [2025-01-09 16:28:22,891 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 131 selfloop transitions, 14 changer transitions 0/165 dead transitions. [2025-01-09 16:28:22,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 165 transitions, 1596 flow [2025-01-09 16:28:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:28:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:28:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-01-09 16:28:22,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-01-09 16:28:22,893 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 585 flow. Second operand 6 states and 215 transitions. [2025-01-09 16:28:22,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 165 transitions, 1596 flow [2025-01-09 16:28:22,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 165 transitions, 1580 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:22,910 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 647 flow [2025-01-09 16:28:22,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2025-01-09 16:28:22,912 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2025-01-09 16:28:22,913 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 647 flow [2025-01-09 16:28:22,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:22,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:22,913 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] [2025-01-09 16:28:22,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:28:22,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:22,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -870319831, now seen corresponding path program 1 times [2025-01-09 16:28:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188541898] [2025-01-09 16:28:22,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:22,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:28:22,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:28:22,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:22,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:23,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188541898] [2025-01-09 16:28:23,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188541898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:23,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:23,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:23,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085221332] [2025-01-09 16:28:23,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:23,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:23,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:23,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:23,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:23,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 647 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:23,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:23,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:23,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:24,196 INFO L124 PetriNetUnfolderBase]: 9867/14227 cut-off events. [2025-01-09 16:28:24,196 INFO L125 PetriNetUnfolderBase]: For 114623/117399 co-relation queries the response was YES. [2025-01-09 16:28:24,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71592 conditions, 14227 events. 9867/14227 cut-off events. For 114623/117399 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 88011 event pairs, 1163 based on Foata normal form. 586/13669 useless extension candidates. Maximal degree in co-relation 71561. Up to 5679 conditions per place. [2025-01-09 16:28:24,300 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 122 selfloop transitions, 18 changer transitions 0/160 dead transitions. [2025-01-09 16:28:24,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 160 transitions, 1530 flow [2025-01-09 16:28:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:28:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:28:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2025-01-09 16:28:24,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2025-01-09 16:28:24,301 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 647 flow. Second operand 7 states and 232 transitions. [2025-01-09 16:28:24,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 160 transitions, 1530 flow [2025-01-09 16:28:24,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 1446 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-09 16:28:24,448 INFO L231 Difference]: Finished difference. Result has 86 places, 84 transitions, 633 flow [2025-01-09 16:28:24,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=633, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2025-01-09 16:28:24,449 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2025-01-09 16:28:24,449 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 633 flow [2025-01-09 16:28:24,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:24,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:24,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:28:24,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:24,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash -330295706, now seen corresponding path program 1 times [2025-01-09 16:28:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:24,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043331385] [2025-01-09 16:28:24,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:24,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:24,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:24,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:24,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:24,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043331385] [2025-01-09 16:28:24,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043331385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592751848] [2025-01-09 16:28:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:24,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:24,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:24,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:24,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-09 16:28:24,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 633 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:24,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:24,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-09 16:28:24,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:25,663 INFO L124 PetriNetUnfolderBase]: 8376/14384 cut-off events. [2025-01-09 16:28:25,663 INFO L125 PetriNetUnfolderBase]: For 69568/72674 co-relation queries the response was YES. [2025-01-09 16:28:25,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60576 conditions, 14384 events. 8376/14384 cut-off events. For 69568/72674 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 116887 event pairs, 1350 based on Foata normal form. 401/13434 useless extension candidates. Maximal degree in co-relation 60545. Up to 5322 conditions per place. [2025-01-09 16:28:25,749 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 62 selfloop transitions, 3 changer transitions 32/134 dead transitions. [2025-01-09 16:28:25,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 134 transitions, 1179 flow [2025-01-09 16:28:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:28:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:28:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2025-01-09 16:28:25,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-01-09 16:28:25,752 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 633 flow. Second operand 6 states and 186 transitions. [2025-01-09 16:28:25,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 134 transitions, 1179 flow [2025-01-09 16:28:25,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 940 flow, removed 108 selfloop flow, removed 8 redundant places. [2025-01-09 16:28:26,001 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 488 flow [2025-01-09 16:28:26,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-01-09 16:28:26,001 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-01-09 16:28:26,002 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 488 flow [2025-01-09 16:28:26,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:26,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:26,003 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, 1] [2025-01-09 16:28:26,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:28:26,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:26,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1109780074, now seen corresponding path program 2 times [2025-01-09 16:28:26,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:26,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077987575] [2025-01-09 16:28:26,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:28:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:26,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:26,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:26,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:28:26,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077987575] [2025-01-09 16:28:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077987575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:26,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:26,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:28:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943855809] [2025-01-09 16:28:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:26,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:26,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:26,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:26,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-01-09 16:28:26,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 488 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:26,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:26,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-01-09 16:28:26,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:28,775 INFO L124 PetriNetUnfolderBase]: 19576/31559 cut-off events. [2025-01-09 16:28:28,775 INFO L125 PetriNetUnfolderBase]: For 65282/72103 co-relation queries the response was YES. [2025-01-09 16:28:28,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102249 conditions, 31559 events. 19576/31559 cut-off events. For 65282/72103 co-relation queries the response was YES. Maximal size of possible extension queue 2009. Compared 261288 event pairs, 4329 based on Foata normal form. 667/29498 useless extension candidates. Maximal degree in co-relation 102219. Up to 12836 conditions per place. [2025-01-09 16:28:28,992 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 59 selfloop transitions, 32 changer transitions 74/196 dead transitions. [2025-01-09 16:28:28,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 196 transitions, 1433 flow [2025-01-09 16:28:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:28:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:28:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 246 transitions. [2025-01-09 16:28:28,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615 [2025-01-09 16:28:28,994 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 488 flow. Second operand 8 states and 246 transitions. [2025-01-09 16:28:28,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 196 transitions, 1433 flow [2025-01-09 16:28:29,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 196 transitions, 1426 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:29,697 INFO L231 Difference]: Finished difference. Result has 96 places, 98 transitions, 780 flow [2025-01-09 16:28:29,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=780, PETRI_PLACES=96, PETRI_TRANSITIONS=98} [2025-01-09 16:28:29,699 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2025-01-09 16:28:29,699 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 98 transitions, 780 flow [2025-01-09 16:28:29,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:29,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:29,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:29,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:28:29,701 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -33308756, now seen corresponding path program 3 times [2025-01-09 16:28:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871162387] [2025-01-09 16:28:29,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:28:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:29,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:29,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:29,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:28:29,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871162387] [2025-01-09 16:28:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871162387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:29,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:29,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611949800] [2025-01-09 16:28:29,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:29,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:29,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:29,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:29,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-09 16:28:29,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:29,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:29,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-09 16:28:29,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:31,851 INFO L124 PetriNetUnfolderBase]: 16520/27992 cut-off events. [2025-01-09 16:28:31,851 INFO L125 PetriNetUnfolderBase]: For 91478/96326 co-relation queries the response was YES. [2025-01-09 16:28:32,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104671 conditions, 27992 events. 16520/27992 cut-off events. For 91478/96326 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 246918 event pairs, 5228 based on Foata normal form. 605/25731 useless extension candidates. Maximal degree in co-relation 104635. Up to 11439 conditions per place. [2025-01-09 16:28:32,113 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 44 selfloop transitions, 5 changer transitions 59/140 dead transitions. [2025-01-09 16:28:32,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 140 transitions, 1229 flow [2025-01-09 16:28:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:28:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:28:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-01-09 16:28:32,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5766666666666667 [2025-01-09 16:28:32,114 INFO L175 Difference]: Start difference. First operand has 96 places, 98 transitions, 780 flow. Second operand 6 states and 173 transitions. [2025-01-09 16:28:32,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 140 transitions, 1229 flow [2025-01-09 16:28:32,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 1213 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:32,979 INFO L231 Difference]: Finished difference. Result has 98 places, 67 transitions, 433 flow [2025-01-09 16:28:32,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=433, PETRI_PLACES=98, PETRI_TRANSITIONS=67} [2025-01-09 16:28:32,980 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2025-01-09 16:28:32,980 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 67 transitions, 433 flow [2025-01-09 16:28:32,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:32,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:32,980 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, 1] [2025-01-09 16:28:32,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:28:32,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:32,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash 278063834, now seen corresponding path program 4 times [2025-01-09 16:28:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:32,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766823217] [2025-01-09 16:28:32,982 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:28:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:32,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-09 16:28:33,036 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:33,036 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:28:33,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:34,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766823217] [2025-01-09 16:28:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766823217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:28:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690240920] [2025-01-09 16:28:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:34,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:28:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:34,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:28:34,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:28:34,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2025-01-09 16:28:34,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 67 transitions, 433 flow. Second operand has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:34,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:34,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2025-01-09 16:28:34,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:35,310 INFO L124 PetriNetUnfolderBase]: 5783/10488 cut-off events. [2025-01-09 16:28:35,311 INFO L125 PetriNetUnfolderBase]: For 24992/26347 co-relation queries the response was YES. [2025-01-09 16:28:35,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34823 conditions, 10488 events. 5783/10488 cut-off events. For 24992/26347 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 84349 event pairs, 1247 based on Foata normal form. 135/9579 useless extension candidates. Maximal degree in co-relation 34785. Up to 2168 conditions per place. [2025-01-09 16:28:35,383 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 53 selfloop transitions, 6 changer transitions 33/128 dead transitions. [2025-01-09 16:28:35,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 128 transitions, 891 flow [2025-01-09 16:28:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:28:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:28:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 293 transitions. [2025-01-09 16:28:35,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511111111111111 [2025-01-09 16:28:35,385 INFO L175 Difference]: Start difference. First operand has 98 places, 67 transitions, 433 flow. Second operand 9 states and 293 transitions. [2025-01-09 16:28:35,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 128 transitions, 891 flow [2025-01-09 16:28:35,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 128 transitions, 812 flow, removed 29 selfloop flow, removed 11 redundant places. [2025-01-09 16:28:35,551 INFO L231 Difference]: Finished difference. Result has 96 places, 66 transitions, 409 flow [2025-01-09 16:28:35,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=409, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2025-01-09 16:28:35,552 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2025-01-09 16:28:35,552 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 409 flow [2025-01-09 16:28:35,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:28:35,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:35,553 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, 1] [2025-01-09 16:28:35,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:28:35,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:35,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1089600090, now seen corresponding path program 5 times [2025-01-09 16:28:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807687631] [2025-01-09 16:28:35,553 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:28:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:35,559 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:35,599 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:35,599 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:28:35,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:28:35,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:28:35,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:35,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:35,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:35,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:28:35,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:28:35,670 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:28:35,671 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-01-09 16:28:35,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-01-09 16:28:35,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 16:28:35,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-09 16:28:35,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-09 16:28:35,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-09 16:28:35,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-01-09 16:28:35,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:28:35,673 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:35,765 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:28:35,766 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:28:35,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:28:35 BasicIcfg [2025-01-09 16:28:35,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:28:35,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:28:35,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:28:35,776 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:28:35,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:03" (3/4) ... [2025-01-09 16:28:35,777 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:28:35,862 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 16:28:35,918 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:28:35,918 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:28:35,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:28:35,919 INFO L158 Benchmark]: Toolchain (without parser) took 33295.55ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 113.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-01-09 16:28:35,919 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:28:35,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.36ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 89.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:28:35,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:28:35,919 INFO L158 Benchmark]: Boogie Preprocessor took 47.19ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 82.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:28:35,920 INFO L158 Benchmark]: RCFGBuilder took 619.95ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 96.0MB in the end (delta: -13.1MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-01-09 16:28:35,920 INFO L158 Benchmark]: TraceAbstraction took 32140.60ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 96.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-01-09 16:28:35,920 INFO L158 Benchmark]: Witness Printer took 142.49ms. Allocated memory is still 3.5GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:28:35,921 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.18ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.36ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 89.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.19ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 82.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 619.95ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 96.0MB in the end (delta: -13.1MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32140.60ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 96.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 142.49ms. Allocated memory is still 3.5GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185=-1, t1186=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185=-1, t1186=0, t1187=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185=-1, t1186=0, t1187=1, t1188=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L822] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L825] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185=-1, t1186=0, t1187=1, t1188=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185=-1, t1186=0, t1187=1, t1188=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185=-1, t1186=0, t1187=1, t1188=2, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - 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: 861]: 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: 857]: 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: 859]: 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: 863]: 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, 85 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: 31.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 954 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 911 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2636 IncrementalHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 62 mSDtfsCounter, 2636 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=12, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 2687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:28:35,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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