./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix033.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/mix033.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 eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:50:07,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:50:07,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:50:07,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:50:07,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:50:07,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:50:07,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:50:07,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:50:07,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:50:07,645 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:50:07,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:50:07,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:50:07,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:50:07,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:50:07,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:50:07,648 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:50:07,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:50:07,648 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:50:07,648 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:50:07,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:50:07,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:50:07,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:50:07,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:50:07,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:50:07,649 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 -> eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e [2025-03-14 00:50:07,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:50:07,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:50:07,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:50:07,876 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:50:07,876 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:50:07,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033.opt.i [2025-03-14 00:50:08,996 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94355a743/f381cd70179347828ea55b1fc89e892b/FLAG5ed892bf2 [2025-03-14 00:50:09,265 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:50:09,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033.opt.i [2025-03-14 00:50:09,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94355a743/f381cd70179347828ea55b1fc89e892b/FLAG5ed892bf2 [2025-03-14 00:50:09,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94355a743/f381cd70179347828ea55b1fc89e892b [2025-03-14 00:50:09,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:50:09,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:50:09,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:50:09,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:50:09,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:50:09,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:09,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8004a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09, skipping insertion in model container [2025-03-14 00:50:09,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:09,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:50:09,732 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/mix033.opt.i[944,957] [2025-03-14 00:50:09,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:50:09,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:50:09,916 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/mix033.opt.i[944,957] [2025-03-14 00:50:09,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:50:09,980 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:50:09,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09 WrapperNode [2025-03-14 00:50:09,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:50:09,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:50:09,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:50:09,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:50:09,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:09,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,013 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 125 [2025-03-14 00:50:10,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:50:10,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:50:10,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:50:10,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:50:10,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,046 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-14 00:50:10,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:50:10,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:50:10,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:50:10,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:50:10,062 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (1/1) ... [2025-03-14 00:50:10,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:50:10,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:50:10,086 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-14 00:50:10,091 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-14 00:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:50:10,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:50:10,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:50:10,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:50:10,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:50:10,107 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:50:10,210 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:50:10,213 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:50:10,456 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:50:10,457 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:50:10,457 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:50:10,666 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:50:10,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:50:10 BoogieIcfgContainer [2025-03-14 00:50:10,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:50:10,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:50:10,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:50:10,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:50:10,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:50:09" (1/3) ... [2025-03-14 00:50:10,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6b7562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:50:10, skipping insertion in model container [2025-03-14 00:50:10,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:50:09" (2/3) ... [2025-03-14 00:50:10,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6b7562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:50:10, skipping insertion in model container [2025-03-14 00:50:10,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:50:10" (3/3) ... [2025-03-14 00:50:10,674 INFO L128 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2025-03-14 00:50:10,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:50:10,686 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix033.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-14 00:50:10,686 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:50:10,716 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:50:10,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 98 flow [2025-03-14 00:50:10,765 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2025-03-14 00:50:10,767 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:50:10,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 1/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-14 00:50:10,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 98 flow [2025-03-14 00:50:10,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 89 flow [2025-03-14 00:50:10,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:50:10,787 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;@4951ce31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:50:10,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:50:10,793 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:50:10,794 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-14 00:50:10,794 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:50:10,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:50:10,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:50:10,794 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-14 00:50:10,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:50:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2028846221, now seen corresponding path program 1 times [2025-03-14 00:50:10,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:50:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192865379] [2025-03-14 00:50:10,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:50:10,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:50:10,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:50:10,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:50:10,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:50:10,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:50:11,137 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-14 00:50:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:50:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192865379] [2025-03-14 00:50:11,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192865379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:50:11,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:50:11,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 00:50:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417695558] [2025-03-14 00:50:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:50:11,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:50:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:50:11,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:50:11,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:50:11,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-14 00:50:11,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 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-14 00:50:11,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:50:11,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-14 00:50:11,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:50:12,238 INFO L124 PetriNetUnfolderBase]: 7727/11043 cut-off events. [2025-03-14 00:50:12,239 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-14 00:50:12,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22066 conditions, 11043 events. 7727/11043 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 60004 event pairs, 783 based on Foata normal form. 378/11362 useless extension candidates. Maximal degree in co-relation 22055. Up to 9633 conditions per place. [2025-03-14 00:50:12,303 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 47 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2025-03-14 00:50:12,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 225 flow [2025-03-14 00:50:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:50:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:50:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-14 00:50:12,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-14 00:50:12,317 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 81 transitions. [2025-03-14 00:50:12,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 225 flow [2025-03-14 00:50:12,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:50:12,322 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-14 00:50:12,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-14 00:50:12,329 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-03-14 00:50:12,329 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-14 00:50:12,330 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-14 00:50:12,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:50:12,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:50:12,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:50:12,331 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-14 00:50:12,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:50:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1316026018, now seen corresponding path program 1 times [2025-03-14 00:50:12,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:50:12,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390054216] [2025-03-14 00:50:12,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:50:12,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:50:12,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:50:12,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:50:12,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:50:12,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:50:12,529 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-14 00:50:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:50:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390054216] [2025-03-14 00:50:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390054216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:50:12,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:50:12,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:50:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422513960] [2025-03-14 00:50:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:50:12,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:50:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:50:12,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:50:12,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:50:12,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-14 00:50:12,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 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-14 00:50:12,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:50:12,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-14 00:50:12,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:50:13,183 INFO L124 PetriNetUnfolderBase]: 5327/8517 cut-off events. [2025-03-14 00:50:13,183 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-14 00:50:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16683 conditions, 8517 events. 5327/8517 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 52737 event pairs, 1119 based on Foata normal form. 384/8650 useless extension candidates. Maximal degree in co-relation 16673. Up to 4001 conditions per place. [2025-03-14 00:50:13,225 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 66 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-03-14 00:50:13,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 318 flow [2025-03-14 00:50:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:50:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:50:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-14 00:50:13,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-03-14 00:50:13,227 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 4 states and 110 transitions. [2025-03-14 00:50:13,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 318 flow [2025-03-14 00:50:13,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:50:13,233 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 114 flow [2025-03-14 00:50:13,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-03-14 00:50:13,233 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-03-14 00:50:13,233 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 114 flow [2025-03-14 00:50:13,233 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-14 00:50:13,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:50:13,234 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-14 00:50:13,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:50:13,234 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-14 00:50:13,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:50:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1956573765, now seen corresponding path program 1 times [2025-03-14 00:50:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:50:13,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678438591] [2025-03-14 00:50:13,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:50:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:50:13,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:50:13,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:50:13,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:50:13,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:50:13,403 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-14 00:50:13,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:50:13,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678438591] [2025-03-14 00:50:13,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678438591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:50:13,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:50:13,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:50:13,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601585467] [2025-03-14 00:50:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:50:13,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:50:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:50:13,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:50:13,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:50:13,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-14 00:50:13,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 114 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-14 00:50:13,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:50:13,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-14 00:50:13,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:50:13,886 INFO L124 PetriNetUnfolderBase]: 2963/4665 cut-off events. [2025-03-14 00:50:13,887 INFO L125 PetriNetUnfolderBase]: For 944/944 co-relation queries the response was YES. [2025-03-14 00:50:13,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10521 conditions, 4665 events. 2963/4665 cut-off events. For 944/944 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 24376 event pairs, 731 based on Foata normal form. 240/4822 useless extension candidates. Maximal degree in co-relation 10509. Up to 1692 conditions per place. [2025-03-14 00:50:13,907 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 85 selfloop transitions, 8 changer transitions 1/100 dead transitions. [2025-03-14 00:50:13,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 443 flow [2025-03-14 00:50:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:50:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:50:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-03-14 00:50:13,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6558139534883721 [2025-03-14 00:50:13,909 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 114 flow. Second operand 5 states and 141 transitions. [2025-03-14 00:50:13,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 443 flow [2025-03-14 00:50:13,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 433 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 00:50:13,917 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 154 flow [2025-03-14 00:50:13,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-03-14 00:50:13,918 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2025-03-14 00:50:13,918 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 154 flow [2025-03-14 00:50:13,918 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-14 00:50:13,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:50:13,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:50:13,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:50:13,918 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-14 00:50:13,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:50:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1720401899, now seen corresponding path program 1 times [2025-03-14 00:50:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:50:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086975172] [2025-03-14 00:50:13,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:50:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:50:13,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:50:13,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:50:13,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:50:13,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:50:14,186 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-14 00:50:14,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:50:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086975172] [2025-03-14 00:50:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086975172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:50:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:50:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:50:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676356507] [2025-03-14 00:50:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:50:14,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:50:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:50:14,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:50:14,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:50:14,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-14 00:50:14,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:50:14,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:50:14,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-14 00:50:14,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:50:14,522 INFO L124 PetriNetUnfolderBase]: 1967/2989 cut-off events. [2025-03-14 00:50:14,522 INFO L125 PetriNetUnfolderBase]: For 1646/1646 co-relation queries the response was YES. [2025-03-14 00:50:14,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7281 conditions, 2989 events. 1967/2989 cut-off events. For 1646/1646 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 13891 event pairs, 667 based on Foata normal form. 72/3042 useless extension candidates. Maximal degree in co-relation 7267. Up to 1168 conditions per place. [2025-03-14 00:50:14,532 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 70 selfloop transitions, 11 changer transitions 1/88 dead transitions. [2025-03-14 00:50:14,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 418 flow [2025-03-14 00:50:14,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:50:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:50:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-14 00:50:14,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-03-14 00:50:14,533 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 154 flow. Second operand 6 states and 138 transitions. [2025-03-14 00:50:14,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 418 flow [2025-03-14 00:50:14,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 393 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-14 00:50:14,545 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 168 flow [2025-03-14 00:50:14,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2025-03-14 00:50:14,545 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2025-03-14 00:50:14,545 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 168 flow [2025-03-14 00:50:14,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:50:14,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:50:14,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:50:14,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:50:14,546 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-14 00:50:14,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:50:14,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1485645177, now seen corresponding path program 1 times [2025-03-14 00:50:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:50:14,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312203967] [2025-03-14 00:50:14,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:50:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:50:14,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 00:50:14,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 00:50:14,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:50:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:50:14,820 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-14 00:50:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:50:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312203967] [2025-03-14 00:50:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312203967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:50:14,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:50:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:50:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18388192] [2025-03-14 00:50:14,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:50:14,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:50:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:50:14,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:50:14,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:50:14,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2025-03-14 00:50:14,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-14 00:50:14,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:50:14,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2025-03-14 00:50:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:50:15,232 INFO L124 PetriNetUnfolderBase]: 3039/4607 cut-off events. [2025-03-14 00:50:15,232 INFO L125 PetriNetUnfolderBase]: For 2878/2878 co-relation queries the response was YES. [2025-03-14 00:50:15,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11396 conditions, 4607 events. 3039/4607 cut-off events. For 2878/2878 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 23237 event pairs, 418 based on Foata normal form. 8/4612 useless extension candidates. Maximal degree in co-relation 11381. Up to 2297 conditions per place. [2025-03-14 00:50:15,247 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 70 selfloop transitions, 11 changer transitions 24/110 dead transitions. [2025-03-14 00:50:15,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 616 flow [2025-03-14 00:50:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:50:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:50:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2025-03-14 00:50:15,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49169435215946844 [2025-03-14 00:50:15,251 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 168 flow. Second operand 7 states and 148 transitions. [2025-03-14 00:50:15,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 616 flow [2025-03-14 00:50:15,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 491 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-14 00:50:15,268 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 192 flow [2025-03-14 00:50:15,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-03-14 00:50:15,268 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2025-03-14 00:50:15,268 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 192 flow [2025-03-14 00:50:15,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-14 00:50:15,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:50:15,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:50:15,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:50:15,269 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-14 00:50:15,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:50:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash -840991391, now seen corresponding path program 2 times [2025-03-14 00:50:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:50:15,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611585426] [2025-03-14 00:50:15,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:50:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:50:15,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-03-14 00:50:15,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 00:50:15,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:50:15,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:50:15,588 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-14 00:50:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:50:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611585426] [2025-03-14 00:50:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611585426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:50:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:50:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:50:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016061196] [2025-03-14 00:50:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:50:15,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:50:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:50:15,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:50:15,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:50:15,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2025-03-14 00:50:15,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 192 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:50:15,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:50:15,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2025-03-14 00:50:15,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:50:16,131 INFO L124 PetriNetUnfolderBase]: 4125/6278 cut-off events. [2025-03-14 00:50:16,132 INFO L125 PetriNetUnfolderBase]: For 2782/2782 co-relation queries the response was YES. [2025-03-14 00:50:16,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15914 conditions, 6278 events. 4125/6278 cut-off events. For 2782/2782 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 32949 event pairs, 815 based on Foata normal form. 8/6282 useless extension candidates. Maximal degree in co-relation 15898. Up to 3187 conditions per place. [2025-03-14 00:50:16,144 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 56 selfloop transitions, 6 changer transitions 70/137 dead transitions. [2025-03-14 00:50:16,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 137 transitions, 760 flow [2025-03-14 00:50:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:50:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:50:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2025-03-14 00:50:16,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2025-03-14 00:50:16,145 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 192 flow. Second operand 8 states and 164 transitions. [2025-03-14 00:50:16,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 137 transitions, 760 flow [2025-03-14 00:50:16,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 754 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-14 00:50:16,148 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 226 flow [2025-03-14 00:50:16,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=226, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2025-03-14 00:50:16,148 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2025-03-14 00:50:16,148 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 226 flow [2025-03-14 00:50:16,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:50:16,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:50:16,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:50:16,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:50:16,149 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-14 00:50:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:50:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -246231659, now seen corresponding path program 3 times [2025-03-14 00:50:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:50:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682586179] [2025-03-14 00:50:16,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:50:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:50:16,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-03-14 00:50:16,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 00:50:16,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:50:16,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:50:16,395 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-14 00:50:16,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:50:16,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682586179] [2025-03-14 00:50:16,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682586179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:50:16,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:50:16,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:50:16,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633958562] [2025-03-14 00:50:16,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:50:16,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:50:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:50:16,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:50:16,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:50:16,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2025-03-14 00:50:16,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-14 00:50:16,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:50:16,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2025-03-14 00:50:16,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:50:16,761 INFO L124 PetriNetUnfolderBase]: 2734/4292 cut-off events. [2025-03-14 00:50:16,763 INFO L125 PetriNetUnfolderBase]: For 2832/2832 co-relation queries the response was YES. [2025-03-14 00:50:16,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11515 conditions, 4292 events. 2734/4292 cut-off events. For 2832/2832 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 22375 event pairs, 688 based on Foata normal form. 8/4298 useless extension candidates. Maximal degree in co-relation 11493. Up to 2730 conditions per place. [2025-03-14 00:50:16,771 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 48 selfloop transitions, 4 changer transitions 38/95 dead transitions. [2025-03-14 00:50:16,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 545 flow [2025-03-14 00:50:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:50:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:50:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-03-14 00:50:16,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46124031007751937 [2025-03-14 00:50:16,772 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 226 flow. Second operand 6 states and 119 transitions. [2025-03-14 00:50:16,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 545 flow [2025-03-14 00:50:16,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 522 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-14 00:50:16,777 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 188 flow [2025-03-14 00:50:16,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2025-03-14 00:50:16,778 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2025-03-14 00:50:16,779 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 188 flow [2025-03-14 00:50:16,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-14 00:50:16,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:50:16,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:50:16,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:50:16,779 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-14 00:50:16,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:50:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1331921815, now seen corresponding path program 4 times [2025-03-14 00:50:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:50:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036377704] [2025-03-14 00:50:16,780 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:50:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:50:16,789 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-14 00:50:16,824 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 00:50:16,824 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:50:16,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:50:16,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:50:16,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 00:50:16,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 00:50:16,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:50:16,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:50:16,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:50:16,883 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:50:16,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-14 00:50:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 00:50:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-14 00:50:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-14 00:50:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-14 00:50:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 00:50:16,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:50:16,887 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-03-14 00:50:16,956 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:50:16,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:50:16,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:50:16 BasicIcfg [2025-03-14 00:50:16,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:50:16,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:50:16,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:50:16,968 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:50:16,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:50:10" (3/4) ... [2025-03-14 00:50:16,969 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 00:50:17,056 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-14 00:50:17,095 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:50:17,095 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:50:17,095 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:50:17,096 INFO L158 Benchmark]: Toolchain (without parser) took 7515.62ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 110.8MB in the beginning and 389.6MB in the end (delta: -278.8MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2025-03-14 00:50:17,096 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:50:17,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.49ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 87.6MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 00:50:17,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.98ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:50:17,098 INFO L158 Benchmark]: Boogie Preprocessor took 45.65ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 83.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:50:17,098 INFO L158 Benchmark]: IcfgBuilder took 605.65ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 87.1MB in the end (delta: -4.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-03-14 00:50:17,098 INFO L158 Benchmark]: TraceAbstraction took 6299.91ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 86.3MB in the beginning and 406.3MB in the end (delta: -320.0MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2025-03-14 00:50:17,098 INFO L158 Benchmark]: Witness Printer took 127.45ms. Allocated memory is still 570.4MB. Free memory was 406.3MB in the beginning and 389.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:50:17,100 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.49ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 87.6MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.98ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.65ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 83.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 605.65ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 87.1MB in the end (delta: -4.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6299.91ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 86.3MB in the beginning and 406.3MB in the end (delta: -320.0MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. * Witness Printer took 127.45ms. Allocated memory is still 570.4MB. Free memory was 406.3MB in the beginning and 389.6MB in the end (delta: 16.8MB). 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_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-2, t877=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-2, t877=-1, t878=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-2, t877=-1, t878=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-2, t877=-1, t878=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-2, t877=-1, t878=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 848]: 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: 844]: 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: 846]: 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, 72 locations, 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.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 1 mSDtfsCounter, 1222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=6, InterpolantAutomatonStates: 39, 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.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-14 00:50:17,114 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