./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:19:22,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:19:22,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:19:22,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:19:22,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:19:22,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:19:22,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:19:22,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:19:22,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:19:22,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:19:22,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:19:22,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:19:22,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:19:22,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:19:22,609 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:19:22,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:19:22,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:19:22,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:19:22,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:19:22,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:19:22,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:19:22,611 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc [2025-03-08 17:19:22,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:19:22,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:19:22,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:19:22,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:19:22,904 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:19:22,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2025-03-08 17:19:24,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3015c167/063244c9dfc04bcf8a282ef167fc25b5/FLAGc37b3a943 [2025-03-08 17:19:24,436 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:19:24,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2025-03-08 17:19:24,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3015c167/063244c9dfc04bcf8a282ef167fc25b5/FLAGc37b3a943 [2025-03-08 17:19:24,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3015c167/063244c9dfc04bcf8a282ef167fc25b5 [2025-03-08 17:19:24,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:19:24,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:19:24,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:19:24,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:19:24,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:19:24,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1510aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24, skipping insertion in model container [2025-03-08 17:19:24,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:19:24,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2025-03-08 17:19:24,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:19:24,740 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:19:24,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2025-03-08 17:19:24,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:19:24,819 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:19:24,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24 WrapperNode [2025-03-08 17:19:24,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:19:24,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:19:24,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:19:24,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:19:24,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,859 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-03-08 17:19:24,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:19:24,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:19:24,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:19:24,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:19:24,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,896 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-03-08 17:19:24,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:19:24,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:19:24,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:19:24,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:19:24,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (1/1) ... [2025-03-08 17:19:24,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:19:24,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:19:24,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:19:24,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:19:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:19:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:19:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-08 17:19:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-08 17:19:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-08 17:19:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-08 17:19:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-08 17:19:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-08 17:19:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:19:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:19:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:19:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:19:24,967 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:19:25,071 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:19:25,073 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:19:25,296 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:19:25,296 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:19:25,448 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:19:25,448 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:19:25,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:25 BoogieIcfgContainer [2025-03-08 17:19:25,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:19:25,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:19:25,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:19:25,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:19:25,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:19:24" (1/3) ... [2025-03-08 17:19:25,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc81804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:19:25, skipping insertion in model container [2025-03-08 17:19:25,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:24" (2/3) ... [2025-03-08 17:19:25,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc81804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:19:25, skipping insertion in model container [2025-03-08 17:19:25,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:25" (3/3) ... [2025-03-08 17:19:25,457 INFO L128 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2025-03-08 17:19:25,468 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:19:25,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix052_pso.opt_rmo.opt_tso.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 17:19:25,470 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:19:25,512 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:19:25,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-03-08 17:19:25,567 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-03-08 17:19:25,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:19:25,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-08 17:19:25,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-03-08 17:19:25,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2025-03-08 17:19:25,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:19:25,596 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;@3e8e16df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:19:25,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 17:19:25,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:19:25,622 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-03-08 17:19:25,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:19:25,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:25,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:19:25,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:25,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1500015306, now seen corresponding path program 1 times [2025-03-08 17:19:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:25,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729686192] [2025-03-08 17:19:25,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:19:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:25,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 17:19:25,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 17:19:25,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:19:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:19:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:19:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:19:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729686192] [2025-03-08 17:19:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729686192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:19:26,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:19:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 17:19:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590044844] [2025-03-08 17:19:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:19:26,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:19:26,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:19:26,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:19:26,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:19:26,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-08 17:19:26,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:26,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:19:26,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-08 17:19:26,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:19:26,858 INFO L124 PetriNetUnfolderBase]: 4235/6165 cut-off events. [2025-03-08 17:19:26,859 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-08 17:19:26,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12304 conditions, 6165 events. 4235/6165 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 32197 event pairs, 575 based on Foata normal form. 216/6334 useless extension candidates. Maximal degree in co-relation 12293. Up to 5101 conditions per place. [2025-03-08 17:19:26,902 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 41 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2025-03-08 17:19:26,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 201 flow [2025-03-08 17:19:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:19:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:19:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-08 17:19:26,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-03-08 17:19:26,917 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 75 transitions. [2025-03-08 17:19:26,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 201 flow [2025-03-08 17:19:26,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:19:26,922 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2025-03-08 17:19:26,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-03-08 17:19:26,926 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-03-08 17:19:26,926 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2025-03-08 17:19:26,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:26,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:26,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:19:26,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:19:26,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:26,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash -973959387, now seen corresponding path program 1 times [2025-03-08 17:19:26,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645782313] [2025-03-08 17:19:26,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:19:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:26,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:19:26,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:19:26,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:19:26,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:19:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:19:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:19:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645782313] [2025-03-08 17:19:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645782313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:19:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:19:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:19:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313274861] [2025-03-08 17:19:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:19:27,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:19:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:19:27,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:19:27,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:19:27,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-08 17:19:27,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:27,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:19:27,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-08 17:19:27,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:19:27,661 INFO L124 PetriNetUnfolderBase]: 3123/5081 cut-off events. [2025-03-08 17:19:27,661 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-03-08 17:19:27,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9995 conditions, 5081 events. 3123/5081 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 30157 event pairs, 535 based on Foata normal form. 216/5134 useless extension candidates. Maximal degree in co-relation 9985. Up to 2501 conditions per place. [2025-03-08 17:19:27,695 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 54 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2025-03-08 17:19:27,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 270 flow [2025-03-08 17:19:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:19:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:19:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-08 17:19:27,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-03-08 17:19:27,698 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 98 transitions. [2025-03-08 17:19:27,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 270 flow [2025-03-08 17:19:27,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:19:27,702 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2025-03-08 17:19:27,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-08 17:19:27,703 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2025-03-08 17:19:27,703 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2025-03-08 17:19:27,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:27,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:27,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] [2025-03-08 17:19:27,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:19:27,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:27,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1345233976, now seen corresponding path program 1 times [2025-03-08 17:19:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:27,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048308039] [2025-03-08 17:19:27,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:19:27,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:27,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:19:27,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:19:27,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:19:27,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:19:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:19:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:19:27,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048308039] [2025-03-08 17:19:27,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048308039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:19:27,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:19:27,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:19:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930445932] [2025-03-08 17:19:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:19:27,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:19:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:19:27,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:19:27,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:19:27,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-08 17:19:27,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:27,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:19:27,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-08 17:19:27,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:19:28,198 INFO L124 PetriNetUnfolderBase]: 1827/2953 cut-off events. [2025-03-08 17:19:28,199 INFO L125 PetriNetUnfolderBase]: For 592/592 co-relation queries the response was YES. [2025-03-08 17:19:28,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6713 conditions, 2953 events. 1827/2953 cut-off events. For 592/592 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 15025 event pairs, 339 based on Foata normal form. 152/3038 useless extension candidates. Maximal degree in co-relation 6701. Up to 960 conditions per place. [2025-03-08 17:19:28,214 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 69 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2025-03-08 17:19:28,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 379 flow [2025-03-08 17:19:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:19:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:19:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-08 17:19:28,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-03-08 17:19:28,217 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 125 transitions. [2025-03-08 17:19:28,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 379 flow [2025-03-08 17:19:28,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 369 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:19:28,221 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2025-03-08 17:19:28,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-03-08 17:19:28,222 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2025-03-08 17:19:28,222 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2025-03-08 17:19:28,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:28,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:28,223 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-03-08 17:19:28,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:19:28,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:28,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:28,224 INFO L85 PathProgramCache]: Analyzing trace with hash 578424117, now seen corresponding path program 1 times [2025-03-08 17:19:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:28,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821617392] [2025-03-08 17:19:28,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:19:28,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:28,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:19:28,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:19:28,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:19:28,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:19:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:19:28,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:19:28,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821617392] [2025-03-08 17:19:28,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821617392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:19:28,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:19:28,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:19:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945040654] [2025-03-08 17:19:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:19:28,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:19:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:19:28,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:19:28,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:19:28,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-08 17:19:28,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:28,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:19:28,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-08 17:19:28,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:19:28,692 INFO L124 PetriNetUnfolderBase]: 1155/1801 cut-off events. [2025-03-08 17:19:28,694 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2025-03-08 17:19:28,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 1801 events. 1155/1801 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7918 event pairs, 303 based on Foata normal form. 56/1838 useless extension candidates. Maximal degree in co-relation 4511. Up to 672 conditions per place. [2025-03-08 17:19:28,703 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2025-03-08 17:19:28,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 370 flow [2025-03-08 17:19:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:19:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:19:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-08 17:19:28,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-08 17:19:28,707 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 126 transitions. [2025-03-08 17:19:28,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 370 flow [2025-03-08 17:19:28,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 345 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-08 17:19:28,719 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2025-03-08 17:19:28,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-03-08 17:19:28,719 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2025-03-08 17:19:28,719 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2025-03-08 17:19:28,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:28,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:28,720 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] [2025-03-08 17:19:28,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:19:28,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:28,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1424583228, now seen corresponding path program 1 times [2025-03-08 17:19:28,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:28,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586822194] [2025-03-08 17:19:28,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:19:28,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:28,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:19:28,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:19:28,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:19:28,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:19:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:19:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:19:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586822194] [2025-03-08 17:19:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586822194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:19:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:19:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:19:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17055542] [2025-03-08 17:19:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:19:29,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:19:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:19:29,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:19:29,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:19:29,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-08 17:19:29,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:29,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:19:29,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-08 17:19:29,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:19:29,269 INFO L124 PetriNetUnfolderBase]: 1641/2561 cut-off events. [2025-03-08 17:19:29,269 INFO L125 PetriNetUnfolderBase]: For 1862/1862 co-relation queries the response was YES. [2025-03-08 17:19:29,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2561 events. 1641/2561 cut-off events. For 1862/1862 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12517 event pairs, 735 based on Foata normal form. 8/2558 useless extension candidates. Maximal degree in co-relation 6575. Up to 1419 conditions per place. [2025-03-08 17:19:29,278 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 47 selfloop transitions, 2 changer transitions 20/74 dead transitions. [2025-03-08 17:19:29,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 444 flow [2025-03-08 17:19:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:19:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:19:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-08 17:19:29,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025641025641026 [2025-03-08 17:19:29,279 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 5 states and 98 transitions. [2025-03-08 17:19:29,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 444 flow [2025-03-08 17:19:29,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 335 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-08 17:19:29,292 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 116 flow [2025-03-08 17:19:29,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-08 17:19:29,294 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-03-08 17:19:29,294 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 116 flow [2025-03-08 17:19:29,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:29,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:29,295 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] [2025-03-08 17:19:29,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:19:29,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:29,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash 345979046, now seen corresponding path program 2 times [2025-03-08 17:19:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:29,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979184766] [2025-03-08 17:19:29,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:19:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:29,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:19:29,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:19:29,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:19:29,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:19:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:19:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:19:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979184766] [2025-03-08 17:19:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979184766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:19:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:19:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:19:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570315055] [2025-03-08 17:19:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:19:29,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:19:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:19:29,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:19:29,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:19:29,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-08 17:19:29,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:29,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:19:29,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-08 17:19:29,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:19:29,875 INFO L124 PetriNetUnfolderBase]: 1105/1765 cut-off events. [2025-03-08 17:19:29,875 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-03-08 17:19:29,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4060 conditions, 1765 events. 1105/1765 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7572 event pairs, 181 based on Foata normal form. 8/1771 useless extension candidates. Maximal degree in co-relation 4047. Up to 980 conditions per place. [2025-03-08 17:19:29,882 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 53 selfloop transitions, 8 changer transitions 18/84 dead transitions. [2025-03-08 17:19:29,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 398 flow [2025-03-08 17:19:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:19:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:19:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2025-03-08 17:19:29,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4542124542124542 [2025-03-08 17:19:29,884 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 116 flow. Second operand 7 states and 124 transitions. [2025-03-08 17:19:29,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 398 flow [2025-03-08 17:19:29,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 382 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-08 17:19:29,886 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 155 flow [2025-03-08 17:19:29,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-03-08 17:19:29,887 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2025-03-08 17:19:29,887 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 155 flow [2025-03-08 17:19:29,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:29,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:29,887 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] [2025-03-08 17:19:29,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:19:29,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:29,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash -464190252, now seen corresponding path program 3 times [2025-03-08 17:19:29,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:29,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217674361] [2025-03-08 17:19:29,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:19:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:29,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:19:29,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:19:29,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:19:29,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:19:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:19:30,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:19:30,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217674361] [2025-03-08 17:19:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217674361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:19:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:19:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:19:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926746350] [2025-03-08 17:19:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:19:30,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:19:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:19:30,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:19:30,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:19:30,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-08 17:19:30,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 155 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:30,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:19:30,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-08 17:19:30,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:19:30,475 INFO L124 PetriNetUnfolderBase]: 1493/2369 cut-off events. [2025-03-08 17:19:30,475 INFO L125 PetriNetUnfolderBase]: For 897/897 co-relation queries the response was YES. [2025-03-08 17:19:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 2369 events. 1493/2369 cut-off events. For 897/897 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10904 event pairs, 209 based on Foata normal form. 8/2375 useless extension candidates. Maximal degree in co-relation 5739. Up to 1180 conditions per place. [2025-03-08 17:19:30,483 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 43 selfloop transitions, 5 changer transitions 43/96 dead transitions. [2025-03-08 17:19:30,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 490 flow [2025-03-08 17:19:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:19:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:19:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2025-03-08 17:19:30,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2025-03-08 17:19:30,484 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 155 flow. Second operand 8 states and 141 transitions. [2025-03-08 17:19:30,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 490 flow [2025-03-08 17:19:30,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 484 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:19:30,486 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 141 flow [2025-03-08 17:19:30,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2025-03-08 17:19:30,487 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2025-03-08 17:19:30,487 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 141 flow [2025-03-08 17:19:30,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:30,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:30,487 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] [2025-03-08 17:19:30,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:19:30,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:30,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash 565083154, now seen corresponding path program 4 times [2025-03-08 17:19:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:30,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500784374] [2025-03-08 17:19:30,488 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:19:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:30,496 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:19:30,512 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:19:30,512 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:19:30,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:19:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:19:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:19:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500784374] [2025-03-08 17:19:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500784374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:19:31,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:19:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:19:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999636347] [2025-03-08 17:19:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:19:31,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:19:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:19:31,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:19:31,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:19:31,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-08 17:19:31,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:31,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:19:31,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-08 17:19:31,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:19:31,493 INFO L124 PetriNetUnfolderBase]: 691/1119 cut-off events. [2025-03-08 17:19:31,493 INFO L125 PetriNetUnfolderBase]: For 518/518 co-relation queries the response was YES. [2025-03-08 17:19:31,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1119 events. 691/1119 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4414 event pairs, 98 based on Foata normal form. 8/1126 useless extension candidates. Maximal degree in co-relation 2675. Up to 490 conditions per place. [2025-03-08 17:19:31,496 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 43 selfloop transitions, 4 changer transitions 38/89 dead transitions. [2025-03-08 17:19:31,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 465 flow [2025-03-08 17:19:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:19:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:19:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2025-03-08 17:19:31,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3641025641025641 [2025-03-08 17:19:31,497 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 141 flow. Second operand 10 states and 142 transitions. [2025-03-08 17:19:31,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 465 flow [2025-03-08 17:19:31,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 409 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-08 17:19:31,499 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 125 flow [2025-03-08 17:19:31,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=125, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-03-08 17:19:31,500 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2025-03-08 17:19:31,500 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 125 flow [2025-03-08 17:19:31,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:19:31,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:19:31,500 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] [2025-03-08 17:19:31,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:19:31,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 17:19:31,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:19:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash -203967190, now seen corresponding path program 5 times [2025-03-08 17:19:31,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:19:31,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242883120] [2025-03-08 17:19:31,501 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:19:31,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:19:31,511 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:19:31,530 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:19:31,530 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:19:31,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:19:31,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:19:31,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:19:31,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:19:31,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:19:31,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:19:31,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:19:31,580 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:19:31,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-08 17:19:31,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-08 17:19:31,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-08 17:19:31,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-08 17:19:31,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-08 17:19:31,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-08 17:19:31,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:19:31,584 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2025-03-08 17:19:31,655 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:19:31,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:19:31,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:19:31 BasicIcfg [2025-03-08 17:19:31,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:19:31,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:19:31,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:19:31,662 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:19:31,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:25" (3/4) ... [2025-03-08 17:19:31,664 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 17:19:31,732 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-08 17:19:31,768 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:19:31,768 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:19:31,768 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:19:31,769 INFO L158 Benchmark]: Toolchain (without parser) took 7295.28ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 127.4MB in the beginning and 154.1MB in the end (delta: -26.7MB). Peak memory consumption was 192.0MB. Max. memory is 16.1GB. [2025-03-08 17:19:31,769 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:19:31,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.35ms. Allocated memory is still 167.8MB. Free memory was 126.9MB in the beginning and 104.3MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 17:19:31,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.58ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 102.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:19:31,771 INFO L158 Benchmark]: Boogie Preprocessor took 50.51ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 99.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:19:31,771 INFO L158 Benchmark]: IcfgBuilder took 537.94ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 54.4MB in the end (delta: 45.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 17:19:31,771 INFO L158 Benchmark]: TraceAbstraction took 6210.83ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 54.0MB in the beginning and 166.7MB in the end (delta: -112.7MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2025-03-08 17:19:31,771 INFO L158 Benchmark]: Witness Printer took 105.65ms. Allocated memory is still 385.9MB. Free memory was 166.7MB in the beginning and 154.1MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 17:19:31,773 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.41ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.35ms. Allocated memory is still 167.8MB. Free memory was 126.9MB in the beginning and 104.3MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.58ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 102.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.51ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 99.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 537.94ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 54.4MB in the end (delta: 45.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6210.83ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 54.0MB in the beginning and 166.7MB in the end (delta: -112.7MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 105.65ms. Allocated memory is still 385.9MB. Free memory was 166.7MB in the beginning and 154.1MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1394; [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1394=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1395; [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1394=-2, t1395=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1396; [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1394=-2, t1395=-1, t1396=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L758] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394=-2, t1395=-1, t1396=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394=-2, t1395=-1, t1396=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394=-2, t1395=-1, t1396=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 61 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1250 IncrementalHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 10 mSDtfsCounter, 1250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=4, InterpolantAutomatonStates: 48, 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, 2.1s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 17:19:31,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE