./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:48:50,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:48:50,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:48:50,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:48:50,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:48:50,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:48:50,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:48:50,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:48:50,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:48:50,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:48:50,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:48:50,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:48:50,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:48:50,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:48:50,432 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:48:50,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:48:50,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:48:50,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:48:50,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:48:50,434 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2025-02-06 12:48:50,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:48:50,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:48:50,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:48:50,698 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:48:50,699 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:48:50,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2025-02-06 12:48:51,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05b40c5f9/3178da00c5b8464aaeafa33e15092348/FLAG24f8fceda [2025-02-06 12:48:52,086 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:48:52,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2025-02-06 12:48:52,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05b40c5f9/3178da00c5b8464aaeafa33e15092348/FLAG24f8fceda [2025-02-06 12:48:52,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05b40c5f9/3178da00c5b8464aaeafa33e15092348 [2025-02-06 12:48:52,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:48:52,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:48:52,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:48:52,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:48:52,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:48:52,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@918a2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52, skipping insertion in model container [2025-02-06 12:48:52,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:48:52,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:48:52,727 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:48:52,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:48:52,812 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:48:52,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52 WrapperNode [2025-02-06 12:48:52,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:48:52,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:48:52,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:48:52,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:48:52,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,866 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2025-02-06 12:48:52,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:48:52,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:48:52,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:48:52,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:48:52,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,892 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 4 writes are split as follows [0, 4]. [2025-02-06 12:48:52,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:48:52,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:48:52,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:48:52,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:48:52,923 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (1/1) ... [2025-02-06 12:48:52,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:48:52,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:52,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:48:52,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:48:52,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:48:52,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:48:52,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:48:52,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:48:52,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:48:52,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:48:52,979 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:48:53,100 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:48:53,101 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:48:53,499 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:48:53,499 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:48:53,872 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:48:53,872 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:48:53,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:48:53 BoogieIcfgContainer [2025-02-06 12:48:53,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:48:53,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:48:53,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:48:53,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:48:53,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:48:52" (1/3) ... [2025-02-06 12:48:53,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ce37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:48:53, skipping insertion in model container [2025-02-06 12:48:53,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:52" (2/3) ... [2025-02-06 12:48:53,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ce37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:48:53, skipping insertion in model container [2025-02-06 12:48:53,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:48:53" (3/3) ... [2025-02-06 12:48:53,882 INFO L128 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2025-02-06 12:48:53,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:48:53,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe014_power.opt.i that has 4 procedures, 69 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-02-06 12:48:53,898 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:48:54,019 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:48:54,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 70 transitions, 152 flow [2025-02-06 12:48:54,092 INFO L124 PetriNetUnfolderBase]: 2/67 cut-off events. [2025-02-06 12:48:54,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:54,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 67 events. 2/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 235 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-02-06 12:48:54,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 70 transitions, 152 flow [2025-02-06 12:48:54,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 67 transitions, 143 flow [2025-02-06 12:48:54,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:48:54,120 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=None, 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;@255106eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:48:54,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-02-06 12:48:54,156 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:48:54,156 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-06 12:48:54,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:54,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:54,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:48:54,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:48:54,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 21768966, now seen corresponding path program 1 times [2025-02-06 12:48:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:54,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866533876] [2025-02-06 12:48:54,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:54,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:48:54,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:48:54,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:54,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:54,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866533876] [2025-02-06 12:48:54,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866533876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:54,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:54,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090578237] [2025-02-06 12:48:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:54,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:54,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:54,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:54,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:54,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:48:54,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 12:48:54,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:54,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:48:54,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:56,497 INFO L124 PetriNetUnfolderBase]: 13427/20258 cut-off events. [2025-02-06 12:48:56,497 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-06 12:48:56,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39181 conditions, 20258 events. 13427/20258 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 134948 event pairs, 13427 based on Foata normal form. 756/16912 useless extension candidates. Maximal degree in co-relation 39170. Up to 18818 conditions per place. [2025-02-06 12:48:56,625 INFO L140 encePairwiseOnDemand]: 48/70 looper letters, 37 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-02-06 12:48:56,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 175 flow [2025-02-06 12:48:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-06 12:48:56,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2025-02-06 12:48:56,639 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 143 flow. Second operand 3 states and 89 transitions. [2025-02-06 12:48:56,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 175 flow [2025-02-06 12:48:56,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:56,648 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2025-02-06 12:48:56,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-02-06 12:48:56,655 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -21 predicate places. [2025-02-06 12:48:56,656 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2025-02-06 12:48:56,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 12:48:56,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:56,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:48:56,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:48:56,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:48:56,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 21768967, now seen corresponding path program 1 times [2025-02-06 12:48:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952756459] [2025-02-06 12:48:56,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:56,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:48:56,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:48:56,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:56,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:56,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952756459] [2025-02-06 12:48:56,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952756459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:56,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:56,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778767734] [2025-02-06 12:48:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:56,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:56,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:56,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:48:56,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 12:48:56,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:56,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:48:56,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:57,768 INFO L124 PetriNetUnfolderBase]: 7511/11565 cut-off events. [2025-02-06 12:48:57,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:57,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22275 conditions, 11565 events. 7511/11565 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 72327 event pairs, 7511 based on Foata normal form. 0/10582 useless extension candidates. Maximal degree in co-relation 22269. Up to 10620 conditions per place. [2025-02-06 12:48:57,846 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 32 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-02-06 12:48:57,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 154 flow [2025-02-06 12:48:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-06 12:48:57,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3238095238095238 [2025-02-06 12:48:57,849 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 68 transitions. [2025-02-06 12:48:57,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 154 flow [2025-02-06 12:48:57,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:57,852 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 89 flow [2025-02-06 12:48:57,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-02-06 12:48:57,853 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-02-06 12:48:57,853 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 89 flow [2025-02-06 12:48:57,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 12:48:57,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:57,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:57,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:48:57,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:48:57,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 901900258, now seen corresponding path program 1 times [2025-02-06 12:48:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:57,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240509417] [2025-02-06 12:48:57,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:57,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:57,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:48:57,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:48:57,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:57,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240509417] [2025-02-06 12:48:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240509417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:58,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:58,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:58,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984482169] [2025-02-06 12:48:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:58,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:58,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:58,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:58,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:58,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:48:58,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-02-06 12:48:58,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:58,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:48:58,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:58,951 INFO L124 PetriNetUnfolderBase]: 6395/9369 cut-off events. [2025-02-06 12:48:58,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:58,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18532 conditions, 9369 events. 6395/9369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 54202 event pairs, 1931 based on Foata normal form. 0/8926 useless extension candidates. Maximal degree in co-relation 18525. Up to 6193 conditions per place. [2025-02-06 12:48:58,984 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-02-06 12:48:58,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2025-02-06 12:48:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-06 12:48:58,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-02-06 12:48:58,985 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 89 flow. Second operand 3 states and 84 transitions. [2025-02-06 12:48:58,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2025-02-06 12:48:58,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:58,986 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 88 flow [2025-02-06 12:48:58,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-06 12:48:58,987 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-02-06 12:48:58,987 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 88 flow [2025-02-06 12:48:58,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-02-06 12:48:58,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:58,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:58,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:48:58,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:48:58,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:58,988 INFO L85 PathProgramCache]: Analyzing trace with hash -918948063, now seen corresponding path program 1 times [2025-02-06 12:48:58,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:58,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980806474] [2025-02-06 12:48:58,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:58,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:58,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:48:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:48:59,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:59,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980806474] [2025-02-06 12:48:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980806474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:59,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:59,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:59,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978891320] [2025-02-06 12:48:59,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:59,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:59,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:59,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:59,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:59,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:48:59,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 12:48:59,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:59,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:48:59,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:59,686 INFO L124 PetriNetUnfolderBase]: 5663/8188 cut-off events. [2025-02-06 12:48:59,687 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-02-06 12:48:59,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16716 conditions, 8188 events. 5663/8188 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 46209 event pairs, 803 based on Foata normal form. 0/7818 useless extension candidates. Maximal degree in co-relation 16708. Up to 7199 conditions per place. [2025-02-06 12:48:59,718 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-02-06 12:48:59,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 244 flow [2025-02-06 12:48:59,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-02-06 12:48:59,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-02-06 12:48:59,720 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 85 transitions. [2025-02-06 12:48:59,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 244 flow [2025-02-06 12:48:59,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:59,722 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-02-06 12:48:59,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-06 12:48:59,723 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-02-06 12:48:59,723 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-02-06 12:48:59,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 12:48:59,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:59,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:59,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:48:59,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:48:59,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:59,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1654242576, now seen corresponding path program 1 times [2025-02-06 12:48:59,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:59,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873289242] [2025-02-06 12:48:59,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:59,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:48:59,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:48:59,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:59,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873289242] [2025-02-06 12:48:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873289242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:59,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:48:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027356795] [2025-02-06 12:48:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:59,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:59,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:59,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:59,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:48:59,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 12:48:59,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:59,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:48:59,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:00,383 INFO L124 PetriNetUnfolderBase]: 5219/7564 cut-off events. [2025-02-06 12:49:00,383 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-02-06 12:49:00,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15941 conditions, 7564 events. 5219/7564 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 42418 event pairs, 659 based on Foata normal form. 0/7554 useless extension candidates. Maximal degree in co-relation 15932. Up to 6574 conditions per place. [2025-02-06 12:49:00,410 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-02-06 12:49:00,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 242 flow [2025-02-06 12:49:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:49:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:49:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-06 12:49:00,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-02-06 12:49:00,416 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 93 transitions. [2025-02-06 12:49:00,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 242 flow [2025-02-06 12:49:00,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:49:00,421 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-02-06 12:49:00,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2025-02-06 12:49:00,422 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-02-06 12:49:00,422 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-02-06 12:49:00,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 12:49:00,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:00,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:00,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:49:00,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:00,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1654242577, now seen corresponding path program 1 times [2025-02-06 12:49:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:00,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295116327] [2025-02-06 12:49:00,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:00,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:00,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:49:00,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:49:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:00,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:00,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295116327] [2025-02-06 12:49:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295116327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:00,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:00,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:49:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055059013] [2025-02-06 12:49:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:00,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:49:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:00,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:49:00,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:49:00,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:00,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 12:49:00,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:00,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:00,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:01,168 INFO L124 PetriNetUnfolderBase]: 4775/6940 cut-off events. [2025-02-06 12:49:01,169 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-02-06 12:49:01,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14513 conditions, 6940 events. 4775/6940 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 38781 event pairs, 515 based on Foata normal form. 180/7110 useless extension candidates. Maximal degree in co-relation 14504. Up to 5950 conditions per place. [2025-02-06 12:49:01,235 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 49 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-02-06 12:49:01,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 236 flow [2025-02-06 12:49:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:49:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:49:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 12:49:01,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2025-02-06 12:49:01,237 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 92 transitions. [2025-02-06 12:49:01,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 236 flow [2025-02-06 12:49:01,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:49:01,238 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-02-06 12:49:01,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-02-06 12:49:01,239 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2025-02-06 12:49:01,239 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-02-06 12:49:01,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 12:49:01,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:01,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:49:01,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:01,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 545628856, now seen corresponding path program 1 times [2025-02-06 12:49:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837768226] [2025-02-06 12:49:01,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:01,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:49:01,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:49:01,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:01,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837768226] [2025-02-06 12:49:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837768226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:01,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:49:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698668490] [2025-02-06 12:49:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:49:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:01,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:49:01,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:49:01,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:01,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 12:49:01,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:01,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:01,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:02,050 INFO L124 PetriNetUnfolderBase]: 4775/7425 cut-off events. [2025-02-06 12:49:02,050 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-02-06 12:49:02,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14997 conditions, 7425 events. 4775/7425 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 43558 event pairs, 4775 based on Foata normal form. 216/7594 useless extension candidates. Maximal degree in co-relation 14989. Up to 6804 conditions per place. [2025-02-06 12:49:02,083 INFO L140 encePairwiseOnDemand]: 68/70 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:49:02,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 141 flow [2025-02-06 12:49:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:49:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:49:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 12:49:02,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2025-02-06 12:49:02,084 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 57 transitions. [2025-02-06 12:49:02,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 141 flow [2025-02-06 12:49:02,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:49:02,085 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-02-06 12:49:02,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-02-06 12:49:02,086 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -27 predicate places. [2025-02-06 12:49:02,086 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-02-06 12:49:02,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 12:49:02,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:02,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:02,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:49:02,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:02,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash 545630359, now seen corresponding path program 1 times [2025-02-06 12:49:02,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:02,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652966856] [2025-02-06 12:49:02,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:02,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:02,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:49:02,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:49:02,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:02,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652966856] [2025-02-06 12:49:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652966856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:49:02,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970174154] [2025-02-06 12:49:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:02,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:49:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:02,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:49:02,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:49:02,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:02,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-02-06 12:49:02,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:02,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:02,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:03,179 INFO L124 PetriNetUnfolderBase]: 5831/8733 cut-off events. [2025-02-06 12:49:03,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:49:03,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18033 conditions, 8733 events. 5831/8733 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 49588 event pairs, 827 based on Foata normal form. 0/8542 useless extension candidates. Maximal degree in co-relation 18025. Up to 4993 conditions per place. [2025-02-06 12:49:03,204 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 40 selfloop transitions, 2 changer transitions 70/117 dead transitions. [2025-02-06 12:49:03,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 117 transitions, 482 flow [2025-02-06 12:49:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:49:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:49:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-02-06 12:49:03,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-02-06 12:49:03,206 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 186 transitions. [2025-02-06 12:49:03,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 117 transitions, 482 flow [2025-02-06 12:49:03,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 117 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:49:03,207 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 93 flow [2025-02-06 12:49:03,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-02-06 12:49:03,207 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2025-02-06 12:49:03,208 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 93 flow [2025-02-06 12:49:03,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-02-06 12:49:03,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:03,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:03,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:49:03,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:03,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1253342826, now seen corresponding path program 1 times [2025-02-06 12:49:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:03,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703388877] [2025-02-06 12:49:03,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:03,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:49:03,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:49:03,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:03,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703388877] [2025-02-06 12:49:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703388877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:03,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:49:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137691492] [2025-02-06 12:49:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:03,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:49:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:03,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:49:03,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:49:03,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:03,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-02-06 12:49:03,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:03,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:03,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:04,230 INFO L124 PetriNetUnfolderBase]: 6273/9304 cut-off events. [2025-02-06 12:49:04,230 INFO L125 PetriNetUnfolderBase]: For 1128/1128 co-relation queries the response was YES. [2025-02-06 12:49:04,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20958 conditions, 9304 events. 6273/9304 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 51749 event pairs, 645 based on Foata normal form. 180/9477 useless extension candidates. Maximal degree in co-relation 20944. Up to 4121 conditions per place. [2025-02-06 12:49:04,271 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 49 selfloop transitions, 3 changer transitions 59/116 dead transitions. [2025-02-06 12:49:04,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 116 transitions, 510 flow [2025-02-06 12:49:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:49:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:49:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-02-06 12:49:04,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2025-02-06 12:49:04,272 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 93 flow. Second operand 8 states and 185 transitions. [2025-02-06 12:49:04,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 116 transitions, 510 flow [2025-02-06 12:49:04,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 116 transitions, 488 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 12:49:04,383 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 103 flow [2025-02-06 12:49:04,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=103, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2025-02-06 12:49:04,384 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2025-02-06 12:49:04,384 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 103 flow [2025-02-06 12:49:04,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-02-06 12:49:04,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:04,384 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-02-06 12:49:04,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:49:04,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:04,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash -203439519, now seen corresponding path program 1 times [2025-02-06 12:49:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:04,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949031453] [2025-02-06 12:49:04,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:04,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:49:04,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:49:04,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:04,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949031453] [2025-02-06 12:49:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949031453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:04,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:49:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99509802] [2025-02-06 12:49:04,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:04,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:49:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:04,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:49:04,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:49:04,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:04,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-06 12:49:04,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:04,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:04,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:05,167 INFO L124 PetriNetUnfolderBase]: 3688/5612 cut-off events. [2025-02-06 12:49:05,167 INFO L125 PetriNetUnfolderBase]: For 1626/1626 co-relation queries the response was YES. [2025-02-06 12:49:05,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13397 conditions, 5612 events. 3688/5612 cut-off events. For 1626/1626 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 30298 event pairs, 1874 based on Foata normal form. 150/5755 useless extension candidates. Maximal degree in co-relation 13381. Up to 3946 conditions per place. [2025-02-06 12:49:05,189 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 42 selfloop transitions, 2 changer transitions 47/96 dead transitions. [2025-02-06 12:49:05,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 441 flow [2025-02-06 12:49:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:49:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:49:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-02-06 12:49:05,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3183673469387755 [2025-02-06 12:49:05,190 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 103 flow. Second operand 7 states and 156 transitions. [2025-02-06 12:49:05,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 441 flow [2025-02-06 12:49:05,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 407 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-02-06 12:49:05,212 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 99 flow [2025-02-06 12:49:05,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-02-06 12:49:05,214 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2025-02-06 12:49:05,214 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 99 flow [2025-02-06 12:49:05,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-06 12:49:05,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:05,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:05,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:49:05,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:05,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1657572118, now seen corresponding path program 1 times [2025-02-06 12:49:05,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:05,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319821442] [2025-02-06 12:49:05,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:05,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:05,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:49:05,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:49:05,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:05,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:05,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319821442] [2025-02-06 12:49:05,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319821442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:05,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:05,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:49:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668963205] [2025-02-06 12:49:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:05,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:49:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:05,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:49:05,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:49:05,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:05,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-02-06 12:49:05,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:05,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:05,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:06,080 INFO L124 PetriNetUnfolderBase]: 4960/7424 cut-off events. [2025-02-06 12:49:06,080 INFO L125 PetriNetUnfolderBase]: For 1500/1500 co-relation queries the response was YES. [2025-02-06 12:49:06,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17253 conditions, 7424 events. 4960/7424 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 39951 event pairs, 2612 based on Foata normal form. 120/7537 useless extension candidates. Maximal degree in co-relation 17239. Up to 3796 conditions per place. [2025-02-06 12:49:06,106 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 37 selfloop transitions, 2 changer transitions 57/101 dead transitions. [2025-02-06 12:49:06,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 452 flow [2025-02-06 12:49:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:49:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:49:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-02-06 12:49:06,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32653061224489793 [2025-02-06 12:49:06,107 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 99 flow. Second operand 7 states and 160 transitions. [2025-02-06 12:49:06,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 452 flow [2025-02-06 12:49:06,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 434 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 12:49:06,128 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 101 flow [2025-02-06 12:49:06,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-02-06 12:49:06,128 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2025-02-06 12:49:06,128 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 101 flow [2025-02-06 12:49:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-02-06 12:49:06,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:06,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:06,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:49:06,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:06,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash 327619698, now seen corresponding path program 2 times [2025-02-06 12:49:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039619496] [2025-02-06 12:49:06,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:49:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:06,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:49:06,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:49:06,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:49:06,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:06,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039619496] [2025-02-06 12:49:06,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039619496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:06,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:06,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:49:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776538839] [2025-02-06 12:49:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:06,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:49:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:06,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:49:06,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:49:06,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:06,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 101 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-02-06 12:49:06,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:06,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:06,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:06,764 INFO L124 PetriNetUnfolderBase]: 3002/4611 cut-off events. [2025-02-06 12:49:06,764 INFO L125 PetriNetUnfolderBase]: For 1560/1560 co-relation queries the response was YES. [2025-02-06 12:49:06,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10614 conditions, 4611 events. 3002/4611 cut-off events. For 1560/1560 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23917 event pairs, 425 based on Foata normal form. 120/4729 useless extension candidates. Maximal degree in co-relation 10600. Up to 3366 conditions per place. [2025-02-06 12:49:06,779 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 44 selfloop transitions, 2 changer transitions 41/92 dead transitions. [2025-02-06 12:49:06,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 424 flow [2025-02-06 12:49:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:49:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:49:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2025-02-06 12:49:06,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31020408163265306 [2025-02-06 12:49:06,780 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 101 flow. Second operand 7 states and 152 transitions. [2025-02-06 12:49:06,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 424 flow [2025-02-06 12:49:06,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 396 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 12:49:06,788 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 103 flow [2025-02-06 12:49:06,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2025-02-06 12:49:06,788 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2025-02-06 12:49:06,788 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 103 flow [2025-02-06 12:49:06,788 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-02-06 12:49:06,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:06,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:06,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:49:06,788 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:06,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash -935801571, now seen corresponding path program 1 times [2025-02-06 12:49:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:06,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599598422] [2025-02-06 12:49:06,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:06,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:06,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:49:06,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:49:06,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:06,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:07,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:07,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599598422] [2025-02-06 12:49:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599598422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:07,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:49:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476870156] [2025-02-06 12:49:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:07,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:49:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:07,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:49:07,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:49:07,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:07,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 103 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:49:07,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:07,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:07,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:08,134 INFO L124 PetriNetUnfolderBase]: 3022/4591 cut-off events. [2025-02-06 12:49:08,135 INFO L125 PetriNetUnfolderBase]: For 1454/1454 co-relation queries the response was YES. [2025-02-06 12:49:08,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10778 conditions, 4591 events. 3022/4591 cut-off events. For 1454/1454 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 22679 event pairs, 181 based on Foata normal form. 100/4689 useless extension candidates. Maximal degree in co-relation 10762. Up to 2437 conditions per place. [2025-02-06 12:49:08,154 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 61 selfloop transitions, 6 changer transitions 55/127 dead transitions. [2025-02-06 12:49:08,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 127 transitions, 571 flow [2025-02-06 12:49:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:49:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:49:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-02-06 12:49:08,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2025-02-06 12:49:08,156 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 103 flow. Second operand 11 states and 224 transitions. [2025-02-06 12:49:08,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 127 transitions, 571 flow [2025-02-06 12:49:08,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 127 transitions, 545 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 12:49:08,166 INFO L231 Difference]: Finished difference. Result has 68 places, 37 transitions, 148 flow [2025-02-06 12:49:08,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=148, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2025-02-06 12:49:08,167 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-02-06 12:49:08,167 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 37 transitions, 148 flow [2025-02-06 12:49:08,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:49:08,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:08,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:08,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:49:08,167 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:08,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -353470895, now seen corresponding path program 1 times [2025-02-06 12:49:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050279791] [2025-02-06 12:49:08,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:08,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:08,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:49:08,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:49:08,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:08,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:08,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050279791] [2025-02-06 12:49:08,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050279791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:08,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:08,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:49:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107129291] [2025-02-06 12:49:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:08,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:49:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:08,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:49:08,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:49:08,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:08,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 37 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-02-06 12:49:08,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:08,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:08,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:09,281 INFO L124 PetriNetUnfolderBase]: 2951/4500 cut-off events. [2025-02-06 12:49:09,281 INFO L125 PetriNetUnfolderBase]: For 3998/3998 co-relation queries the response was YES. [2025-02-06 12:49:09,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12381 conditions, 4500 events. 2951/4500 cut-off events. For 3998/3998 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 22168 event pairs, 217 based on Foata normal form. 80/4578 useless extension candidates. Maximal degree in co-relation 12360. Up to 2670 conditions per place. [2025-02-06 12:49:09,302 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 67 selfloop transitions, 8 changer transitions 37/117 dead transitions. [2025-02-06 12:49:09,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 609 flow [2025-02-06 12:49:09,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:49:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:49:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2025-02-06 12:49:09,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30317460317460315 [2025-02-06 12:49:09,306 INFO L175 Difference]: Start difference. First operand has 68 places, 37 transitions, 148 flow. Second operand 9 states and 191 transitions. [2025-02-06 12:49:09,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 609 flow [2025-02-06 12:49:09,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 587 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 12:49:09,317 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 227 flow [2025-02-06 12:49:09,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=227, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2025-02-06 12:49:09,318 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-02-06 12:49:09,318 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 227 flow [2025-02-06 12:49:09,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-02-06 12:49:09,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:09,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:09,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:49:09,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:09,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1840772845, now seen corresponding path program 2 times [2025-02-06 12:49:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:09,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856651738] [2025-02-06 12:49:09,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:49:09,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:09,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:49:09,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:49:09,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:49:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:09,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856651738] [2025-02-06 12:49:09,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856651738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:09,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:09,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:49:09,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350631124] [2025-02-06 12:49:09,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:09,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:49:09,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:09,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:49:09,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:49:09,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:09,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-06 12:49:09,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:09,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:09,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:09,791 INFO L124 PetriNetUnfolderBase]: 2424/3790 cut-off events. [2025-02-06 12:49:09,791 INFO L125 PetriNetUnfolderBase]: For 5884/5884 co-relation queries the response was YES. [2025-02-06 12:49:09,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11390 conditions, 3790 events. 2424/3790 cut-off events. For 5884/5884 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19211 event pairs, 364 based on Foata normal form. 176/3963 useless extension candidates. Maximal degree in co-relation 11365. Up to 1945 conditions per place. [2025-02-06 12:49:09,808 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 72 selfloop transitions, 5 changer transitions 1/83 dead transitions. [2025-02-06 12:49:09,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 571 flow [2025-02-06 12:49:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:49:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:49:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-06 12:49:09,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2025-02-06 12:49:09,809 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 227 flow. Second operand 4 states and 103 transitions. [2025-02-06 12:49:09,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 571 flow [2025-02-06 12:49:09,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 543 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-02-06 12:49:09,818 INFO L231 Difference]: Finished difference. Result has 69 places, 47 transitions, 241 flow [2025-02-06 12:49:09,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2025-02-06 12:49:09,819 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2025-02-06 12:49:09,819 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 241 flow [2025-02-06 12:49:09,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-06 12:49:09,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:09,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:09,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:49:09,820 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:09,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1083139878, now seen corresponding path program 1 times [2025-02-06 12:49:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076108913] [2025-02-06 12:49:09,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:09,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:49:09,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:49:09,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:09,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076108913] [2025-02-06 12:49:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076108913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:49:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681487096] [2025-02-06 12:49:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:09,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:49:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:09,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:49:09,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:49:09,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:09,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 47 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-02-06 12:49:09,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:09,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:09,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:10,272 INFO L124 PetriNetUnfolderBase]: 1544/2460 cut-off events. [2025-02-06 12:49:10,273 INFO L125 PetriNetUnfolderBase]: For 3063/3063 co-relation queries the response was YES. [2025-02-06 12:49:10,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7646 conditions, 2460 events. 1544/2460 cut-off events. For 3063/3063 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 11397 event pairs, 226 based on Foata normal form. 130/2587 useless extension candidates. Maximal degree in co-relation 7621. Up to 777 conditions per place. [2025-02-06 12:49:10,284 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 79 selfloop transitions, 8 changer transitions 1/93 dead transitions. [2025-02-06 12:49:10,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 623 flow [2025-02-06 12:49:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:49:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:49:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-02-06 12:49:10,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3628571428571429 [2025-02-06 12:49:10,286 INFO L175 Difference]: Start difference. First operand has 69 places, 47 transitions, 241 flow. Second operand 5 states and 127 transitions. [2025-02-06 12:49:10,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 623 flow [2025-02-06 12:49:10,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 93 transitions, 603 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 12:49:10,291 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 253 flow [2025-02-06 12:49:10,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2025-02-06 12:49:10,293 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -4 predicate places. [2025-02-06 12:49:10,293 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 253 flow [2025-02-06 12:49:10,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-02-06 12:49:10,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:10,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:10,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:49:10,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:10,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1035909513, now seen corresponding path program 1 times [2025-02-06 12:49:10,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:10,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637093431] [2025-02-06 12:49:10,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:10,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:10,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:49:10,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:49:10,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:10,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637093431] [2025-02-06 12:49:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637093431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:10,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:10,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:49:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151086771] [2025-02-06 12:49:10,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:10,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:49:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:10,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:49:10,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:49:10,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:10,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-06 12:49:10,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:10,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:10,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:10,711 INFO L124 PetriNetUnfolderBase]: 961/1523 cut-off events. [2025-02-06 12:49:10,711 INFO L125 PetriNetUnfolderBase]: For 2496/2496 co-relation queries the response was YES. [2025-02-06 12:49:10,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5010 conditions, 1523 events. 961/1523 cut-off events. For 2496/2496 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6336 event pairs, 197 based on Foata normal form. 52/1572 useless extension candidates. Maximal degree in co-relation 4985. Up to 546 conditions per place. [2025-02-06 12:49:10,716 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 64 selfloop transitions, 11 changer transitions 1/81 dead transitions. [2025-02-06 12:49:10,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 538 flow [2025-02-06 12:49:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:49:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:49:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2025-02-06 12:49:10,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3119047619047619 [2025-02-06 12:49:10,717 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 253 flow. Second operand 6 states and 131 transitions. [2025-02-06 12:49:10,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 538 flow [2025-02-06 12:49:10,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 434 flow, removed 22 selfloop flow, removed 14 redundant places. [2025-02-06 12:49:10,722 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 195 flow [2025-02-06 12:49:10,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-02-06 12:49:10,722 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2025-02-06 12:49:10,723 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 195 flow [2025-02-06 12:49:10,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-06 12:49:10,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:10,723 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] [2025-02-06 12:49:10,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:49:10,723 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:10,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash 885986915, now seen corresponding path program 1 times [2025-02-06 12:49:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:10,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384671275] [2025-02-06 12:49:10,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:10,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:49:10,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:10,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:10,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:10,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384671275] [2025-02-06 12:49:10,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384671275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:10,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:10,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:49:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923450939] [2025-02-06 12:49:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:49:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:10,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:49:10,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:49:10,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:10,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-06 12:49:10,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:10,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:10,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:11,188 INFO L124 PetriNetUnfolderBase]: 1353/2143 cut-off events. [2025-02-06 12:49:11,188 INFO L125 PetriNetUnfolderBase]: For 2260/2260 co-relation queries the response was YES. [2025-02-06 12:49:11,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6215 conditions, 2143 events. 1353/2143 cut-off events. For 2260/2260 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9499 event pairs, 831 based on Foata normal form. 8/2144 useless extension candidates. Maximal degree in co-relation 6197. Up to 1293 conditions per place. [2025-02-06 12:49:11,195 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 42 selfloop transitions, 2 changer transitions 39/88 dead transitions. [2025-02-06 12:49:11,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 557 flow [2025-02-06 12:49:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:49:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:49:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2025-02-06 12:49:11,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2693877551020408 [2025-02-06 12:49:11,196 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 195 flow. Second operand 7 states and 132 transitions. [2025-02-06 12:49:11,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 557 flow [2025-02-06 12:49:11,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 440 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:49:11,202 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 153 flow [2025-02-06 12:49:11,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2025-02-06 12:49:11,203 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2025-02-06 12:49:11,203 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 153 flow [2025-02-06 12:49:11,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-06 12:49:11,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:11,203 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] [2025-02-06 12:49:11,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:49:11,203 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:11,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -308159755, now seen corresponding path program 2 times [2025-02-06 12:49:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:11,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042906800] [2025-02-06 12:49:11,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:49:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:11,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:49:11,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:11,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:49:11,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:49:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042906800] [2025-02-06 12:49:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042906800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:49:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541342334] [2025-02-06 12:49:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:11,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:49:11,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:49:11,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:49:11,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:49:11,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:11,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-06 12:49:11,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:11,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:11,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:11,639 INFO L124 PetriNetUnfolderBase]: 1325/2098 cut-off events. [2025-02-06 12:49:11,639 INFO L125 PetriNetUnfolderBase]: For 910/910 co-relation queries the response was YES. [2025-02-06 12:49:11,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 2098 events. 1325/2098 cut-off events. For 910/910 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9458 event pairs, 309 based on Foata normal form. 8/2103 useless extension candidates. Maximal degree in co-relation 5390. Up to 1070 conditions per place. [2025-02-06 12:49:11,646 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 39 selfloop transitions, 1 changer transitions 37/82 dead transitions. [2025-02-06 12:49:11,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 433 flow [2025-02-06 12:49:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:49:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:49:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-02-06 12:49:11,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2761904761904762 [2025-02-06 12:49:11,647 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 153 flow. Second operand 6 states and 116 transitions. [2025-02-06 12:49:11,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 433 flow [2025-02-06 12:49:11,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 419 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-06 12:49:11,649 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 140 flow [2025-02-06 12:49:11,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2025-02-06 12:49:11,650 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2025-02-06 12:49:11,650 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 140 flow [2025-02-06 12:49:11,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-06 12:49:11,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:11,650 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] [2025-02-06 12:49:11,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:49:11,650 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:11,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1139495881, now seen corresponding path program 3 times [2025-02-06 12:49:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:49:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052863586] [2025-02-06 12:49:11,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:49:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:49:11,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:49:11,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:11,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:49:11,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:49:11,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:49:11,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:49:11,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:11,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:11,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:49:11,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:49:11,778 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:49:11,779 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2025-02-06 12:49:11,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2025-02-06 12:49:11,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2025-02-06 12:49:11,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2025-02-06 12:49:11,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2025-02-06 12:49:11,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2025-02-06 12:49:11,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2025-02-06 12:49:11,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONMEMORY_LEAK (35 of 53 remaining) [2025-02-06 12:49:11,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2025-02-06 12:49:11,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2025-02-06 12:49:11,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 53 remaining) [2025-02-06 12:49:11,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONMEMORY_LEAK (4 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2025-02-06 12:49:11,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2025-02-06 12:49:11,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2025-02-06 12:49:11,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2025-02-06 12:49:11,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:49:11,786 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:11,869 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:49:11,869 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:49:11,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:49:11 BasicIcfg [2025-02-06 12:49:11,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:49:11,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:49:11,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:49:11,873 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:49:11,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:48:53" (3/4) ... [2025-02-06 12:49:11,875 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:49:11,876 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:49:11,876 INFO L158 Benchmark]: Toolchain (without parser) took 19483.97ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 104.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 748.0MB. Max. memory is 16.1GB. [2025-02-06 12:49:11,877 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:49:11,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.61ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 81.4MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:49:11,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.94ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 79.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:49:11,877 INFO L158 Benchmark]: Boogie Preprocessor took 52.43ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 75.1MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:49:11,877 INFO L158 Benchmark]: IcfgBuilder took 953.04ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 84.4MB in the end (delta: -9.3MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-02-06 12:49:11,877 INFO L158 Benchmark]: TraceAbstraction took 17997.64ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 83.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 717.9MB. Max. memory is 16.1GB. [2025-02-06 12:49:11,878 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 310.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:49:11,879 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.26ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.61ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 81.4MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.94ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 79.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.43ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 75.1MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 953.04ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 84.4MB in the end (delta: -9.3MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17997.64ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 83.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 717.9MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 310.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L846] 0 pthread_t t2101; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, t2101=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L848] 0 pthread_t t2102; [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: 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, 114 locations, 53 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: 17.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1043 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1033 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2852 IncrementalHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 5 mSDtfsCounter, 2852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=16, InterpolantAutomatonStates: 108, 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, 3.3s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 1563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:49:11,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:49:14,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:49:14,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:49:14,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:49:14,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:49:14,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:49:14,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:49:14,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:49:14,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:49:14,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:49:14,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:49:14,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:49:14,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:49:14,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:49:14,264 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:49:14,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:49:14,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:49:14,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:49:14,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:49:14,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:49:14,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:49:14,266 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:49:14,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:49:14,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:49:14,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:49:14,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:49:14,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:49:14,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:49:14,267 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:49:14,267 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:49:14,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:49:14,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:49:14,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:49:14,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:49:14,267 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2025-02-06 12:49:14,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:49:14,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:49:14,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:49:14,530 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:49:14,530 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:49:14,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2025-02-06 12:49:15,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca5504874/d0716234575e4781aaca02fd010a5b1d/FLAG4685232f8 [2025-02-06 12:49:15,979 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:49:15,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2025-02-06 12:49:15,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca5504874/d0716234575e4781aaca02fd010a5b1d/FLAG4685232f8 [2025-02-06 12:49:16,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca5504874/d0716234575e4781aaca02fd010a5b1d [2025-02-06 12:49:16,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:49:16,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:49:16,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:49:16,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:49:16,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:49:16,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c59f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16, skipping insertion in model container [2025-02-06 12:49:16,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:49:16,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:49:16,348 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:49:16,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:49:16,459 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:49:16,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16 WrapperNode [2025-02-06 12:49:16,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:49:16,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:49:16,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:49:16,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:49:16,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,510 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2025-02-06 12:49:16,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:49:16,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:49:16,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:49:16,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:49:16,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,539 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 4 writes are split as follows [0, 4]. [2025-02-06 12:49:16,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:49:16,558 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:49:16,558 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:49:16,558 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:49:16,559 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (1/1) ... [2025-02-06 12:49:16,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:49:16,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:16,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:49:16,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:49:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:49:16,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:49:16,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:49:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:49:16,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:49:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:49:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:49:16,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:49:16,617 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:49:16,788 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:49:16,789 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:49:17,276 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:49:17,277 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:49:17,656 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:49:17,656 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:49:17,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:17 BoogieIcfgContainer [2025-02-06 12:49:17,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:49:17,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:49:17,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:49:17,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:49:17,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:49:16" (1/3) ... [2025-02-06 12:49:17,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91113b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:49:17, skipping insertion in model container [2025-02-06 12:49:17,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:49:16" (2/3) ... [2025-02-06 12:49:17,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91113b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:49:17, skipping insertion in model container [2025-02-06 12:49:17,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:17" (3/3) ... [2025-02-06 12:49:17,664 INFO L128 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2025-02-06 12:49:17,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:49:17,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe014_power.opt.i that has 4 procedures, 69 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-02-06 12:49:17,678 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:49:17,787 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:49:17,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 70 transitions, 152 flow [2025-02-06 12:49:17,855 INFO L124 PetriNetUnfolderBase]: 2/67 cut-off events. [2025-02-06 12:49:17,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:49:17,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 67 events. 2/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 235 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-02-06 12:49:17,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 70 transitions, 152 flow [2025-02-06 12:49:17,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 67 transitions, 143 flow [2025-02-06 12:49:17,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:49:17,885 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=None, 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;@6f516e20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:49:17,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-02-06 12:49:17,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:49:17,891 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-06 12:49:17,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:49:17,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:17,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:49:17,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:17,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash 21830534, now seen corresponding path program 1 times [2025-02-06 12:49:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:17,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607349201] [2025-02-06 12:49:17,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:17,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:17,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:17,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:17,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:49:18,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:49:18,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:49:18,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:18,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:18,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:49:18,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:18,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:18,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:18,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607349201] [2025-02-06 12:49:18,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607349201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:18,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:18,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:49:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459192386] [2025-02-06 12:49:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:18,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:49:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:18,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:49:18,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:49:18,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:18,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 12:49:18,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:18,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:18,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:20,281 INFO L124 PetriNetUnfolderBase]: 13427/20258 cut-off events. [2025-02-06 12:49:20,282 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-06 12:49:20,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39181 conditions, 20258 events. 13427/20258 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 134948 event pairs, 13427 based on Foata normal form. 756/16912 useless extension candidates. Maximal degree in co-relation 39170. Up to 18818 conditions per place. [2025-02-06 12:49:20,440 INFO L140 encePairwiseOnDemand]: 48/70 looper letters, 37 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-02-06 12:49:20,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 175 flow [2025-02-06 12:49:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:49:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:49:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-06 12:49:20,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2025-02-06 12:49:20,452 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 143 flow. Second operand 3 states and 89 transitions. [2025-02-06 12:49:20,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 175 flow [2025-02-06 12:49:20,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:49:20,461 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2025-02-06 12:49:20,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-02-06 12:49:20,465 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -21 predicate places. [2025-02-06 12:49:20,465 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2025-02-06 12:49:20,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 12:49:20,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:20,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:49:20,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:49:20,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:20,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:20,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash 21830535, now seen corresponding path program 1 times [2025-02-06 12:49:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:20,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806882184] [2025-02-06 12:49:20,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:20,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:20,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:20,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:20,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:49:20,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:49:20,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:49:20,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:20,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:20,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:49:20,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:20,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:20,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:20,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806882184] [2025-02-06 12:49:20,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806882184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:20,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:20,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:49:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912485180] [2025-02-06 12:49:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:20,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:49:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:20,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:49:20,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:49:20,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:20,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 12:49:20,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:20,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:20,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:21,714 INFO L124 PetriNetUnfolderBase]: 7511/11565 cut-off events. [2025-02-06 12:49:21,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:49:21,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22275 conditions, 11565 events. 7511/11565 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 72327 event pairs, 7511 based on Foata normal form. 0/10582 useless extension candidates. Maximal degree in co-relation 22269. Up to 10620 conditions per place. [2025-02-06 12:49:21,767 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 32 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-02-06 12:49:21,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 154 flow [2025-02-06 12:49:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:49:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:49:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-06 12:49:21,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3238095238095238 [2025-02-06 12:49:21,768 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 68 transitions. [2025-02-06 12:49:21,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 154 flow [2025-02-06 12:49:21,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:49:21,769 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 89 flow [2025-02-06 12:49:21,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-02-06 12:49:21,770 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-02-06 12:49:21,770 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 89 flow [2025-02-06 12:49:21,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 12:49:21,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:21,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:21,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:49:21,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:21,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:21,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1688181020, now seen corresponding path program 1 times [2025-02-06 12:49:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:21,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [741681482] [2025-02-06 12:49:21,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:21,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:21,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:21,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:21,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:49:22,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:49:22,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:49:22,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:22,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:22,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:49:22,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:22,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:22,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:22,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741681482] [2025-02-06 12:49:22,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741681482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:22,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:22,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:49:22,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602951530] [2025-02-06 12:49:22,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:22,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:49:22,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:22,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:49:22,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:49:22,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:22,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-02-06 12:49:22,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:22,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:22,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:22,956 INFO L124 PetriNetUnfolderBase]: 6395/9369 cut-off events. [2025-02-06 12:49:22,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:49:22,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18532 conditions, 9369 events. 6395/9369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 54209 event pairs, 1931 based on Foata normal form. 0/8926 useless extension candidates. Maximal degree in co-relation 18525. Up to 6193 conditions per place. [2025-02-06 12:49:23,001 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-02-06 12:49:23,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2025-02-06 12:49:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:49:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:49:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-06 12:49:23,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-02-06 12:49:23,002 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 89 flow. Second operand 3 states and 84 transitions. [2025-02-06 12:49:23,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2025-02-06 12:49:23,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:49:23,004 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 88 flow [2025-02-06 12:49:23,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-06 12:49:23,004 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-02-06 12:49:23,005 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 88 flow [2025-02-06 12:49:23,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-02-06 12:49:23,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:23,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:23,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:49:23,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:23,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:23,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1093975523, now seen corresponding path program 1 times [2025-02-06 12:49:23,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:23,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621673889] [2025-02-06 12:49:23,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:23,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:23,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:23,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:23,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:49:23,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:49:23,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:49:23,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:23,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:23,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:49:23,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:23,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:23,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:23,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621673889] [2025-02-06 12:49:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621673889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:23,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:49:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692879488] [2025-02-06 12:49:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:23,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:49:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:23,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:49:23,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:49:23,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:23,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 12:49:23,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:23,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:23,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:24,123 INFO L124 PetriNetUnfolderBase]: 5663/8188 cut-off events. [2025-02-06 12:49:24,123 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-02-06 12:49:24,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16716 conditions, 8188 events. 5663/8188 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 46288 event pairs, 803 based on Foata normal form. 0/7818 useless extension candidates. Maximal degree in co-relation 16708. Up to 7199 conditions per place. [2025-02-06 12:49:24,215 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-02-06 12:49:24,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 244 flow [2025-02-06 12:49:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:49:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:49:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-02-06 12:49:24,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-02-06 12:49:24,219 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 85 transitions. [2025-02-06 12:49:24,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 244 flow [2025-02-06 12:49:24,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:49:24,222 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-02-06 12:49:24,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-06 12:49:24,224 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-02-06 12:49:24,224 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-02-06 12:49:24,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 12:49:24,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:24,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:24,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:49:24,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:24,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:24,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash -956441710, now seen corresponding path program 1 times [2025-02-06 12:49:24,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:24,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760974179] [2025-02-06 12:49:24,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:24,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:24,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:49:24,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:49:24,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:49:24,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:24,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:24,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:49:24,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:24,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:24,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:24,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760974179] [2025-02-06 12:49:24,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760974179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:24,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:49:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162908484] [2025-02-06 12:49:24,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:24,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:49:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:24,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:49:24,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:49:24,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:24,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 12:49:24,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:24,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:24,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:25,193 INFO L124 PetriNetUnfolderBase]: 5219/7564 cut-off events. [2025-02-06 12:49:25,194 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-02-06 12:49:25,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15941 conditions, 7564 events. 5219/7564 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 42441 event pairs, 659 based on Foata normal form. 0/7554 useless extension candidates. Maximal degree in co-relation 15932. Up to 6574 conditions per place. [2025-02-06 12:49:25,231 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-02-06 12:49:25,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 242 flow [2025-02-06 12:49:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:49:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:49:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-06 12:49:25,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-02-06 12:49:25,234 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 93 transitions. [2025-02-06 12:49:25,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 242 flow [2025-02-06 12:49:25,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:49:25,240 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-02-06 12:49:25,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2025-02-06 12:49:25,240 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-02-06 12:49:25,241 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-02-06 12:49:25,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 12:49:25,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:25,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:25,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:49:25,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:25,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:25,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash -956441709, now seen corresponding path program 1 times [2025-02-06 12:49:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:25,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005752839] [2025-02-06 12:49:25,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:25,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:25,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:25,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:49:25,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:49:25,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:49:25,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:25,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:25,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:49:25,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:25,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:25,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:25,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005752839] [2025-02-06 12:49:25,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005752839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:25,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:25,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:49:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952263952] [2025-02-06 12:49:25,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:25,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:49:25,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:25,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:49:25,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:49:25,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:25,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 12:49:25,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:25,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:25,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:26,154 INFO L124 PetriNetUnfolderBase]: 4775/6940 cut-off events. [2025-02-06 12:49:26,154 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-02-06 12:49:26,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14513 conditions, 6940 events. 4775/6940 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 38876 event pairs, 515 based on Foata normal form. 180/7110 useless extension candidates. Maximal degree in co-relation 14504. Up to 5950 conditions per place. [2025-02-06 12:49:26,179 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 49 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-02-06 12:49:26,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 236 flow [2025-02-06 12:49:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:49:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:49:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 12:49:26,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2025-02-06 12:49:26,181 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 92 transitions. [2025-02-06 12:49:26,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 236 flow [2025-02-06 12:49:26,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:49:26,182 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-02-06 12:49:26,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-02-06 12:49:26,182 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2025-02-06 12:49:26,182 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-02-06 12:49:26,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 12:49:26,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:26,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:26,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:49:26,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:26,383 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:26,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -61069062, now seen corresponding path program 1 times [2025-02-06 12:49:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456258154] [2025-02-06 12:49:26,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:26,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:26,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:26,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:26,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:49:26,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:49:26,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:49:26,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:26,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:26,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:49:26,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:26,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:26,491 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:26,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456258154] [2025-02-06 12:49:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456258154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:49:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246401444] [2025-02-06 12:49:26,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:26,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:49:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:26,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:49:26,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:49:26,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-02-06 12:49:26,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 12:49:26,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:26,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-02-06 12:49:26,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:26,936 INFO L124 PetriNetUnfolderBase]: 4775/7425 cut-off events. [2025-02-06 12:49:26,936 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-02-06 12:49:26,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14997 conditions, 7425 events. 4775/7425 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 43537 event pairs, 4775 based on Foata normal form. 216/7594 useless extension candidates. Maximal degree in co-relation 14989. Up to 6804 conditions per place. [2025-02-06 12:49:26,957 INFO L140 encePairwiseOnDemand]: 68/70 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:49:26,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 141 flow [2025-02-06 12:49:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:49:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:49:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 12:49:26,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2025-02-06 12:49:26,958 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 57 transitions. [2025-02-06 12:49:26,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 141 flow [2025-02-06 12:49:26,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:49:26,958 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-02-06 12:49:26,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-02-06 12:49:26,959 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -27 predicate places. [2025-02-06 12:49:26,959 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-02-06 12:49:26,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 12:49:26,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:26,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:26,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:49:27,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:27,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:27,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash -61067559, now seen corresponding path program 1 times [2025-02-06 12:49:27,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:27,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628021124] [2025-02-06 12:49:27,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:27,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:27,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:27,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:27,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:49:27,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:49:27,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:49:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:27,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:27,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:49:27,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:27,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:27,273 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628021124] [2025-02-06 12:49:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628021124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:27,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:27,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:49:27,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559932484] [2025-02-06 12:49:27,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:27,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:49:27,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:27,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:49:27,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:49:27,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:27,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02-06 12:49:27,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:27,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:27,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:27,678 INFO L124 PetriNetUnfolderBase]: 3471/5581 cut-off events. [2025-02-06 12:49:27,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:49:27,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11273 conditions, 5581 events. 3471/5581 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 32892 event pairs, 535 based on Foata normal form. 216/5786 useless extension candidates. Maximal degree in co-relation 11265. Up to 3001 conditions per place. [2025-02-06 12:49:27,704 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 55 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2025-02-06 12:49:27,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 276 flow [2025-02-06 12:49:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:49:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:49:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-06 12:49:27,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2025-02-06 12:49:27,705 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 103 transitions. [2025-02-06 12:49:27,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 276 flow [2025-02-06 12:49:27,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:49:27,706 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2025-02-06 12:49:27,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-02-06 12:49:27,709 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -24 predicate places. [2025-02-06 12:49:27,709 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2025-02-06 12:49:27,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02-06 12:49:27,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:27,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:27,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:49:27,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:27,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:27,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1141274100, now seen corresponding path program 1 times [2025-02-06 12:49:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954994583] [2025-02-06 12:49:27,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:27,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:27,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:27,917 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:27,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:49:28,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:49:28,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:49:28,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:28,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:28,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:49:28,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:28,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:28,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954994583] [2025-02-06 12:49:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954994583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:49:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269150481] [2025-02-06 12:49:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:28,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:49:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:28,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:49:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:49:28,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:28,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-02-06 12:49:28,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:28,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:28,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:28,321 INFO L124 PetriNetUnfolderBase]: 1935/3117 cut-off events. [2025-02-06 12:49:28,321 INFO L125 PetriNetUnfolderBase]: For 604/604 co-relation queries the response was YES. [2025-02-06 12:49:28,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7316 conditions, 3117 events. 1935/3117 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 15763 event pairs, 339 based on Foata normal form. 152/3258 useless extension candidates. Maximal degree in co-relation 7305. Up to 985 conditions per place. [2025-02-06 12:49:28,331 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 70 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-02-06 12:49:28,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 394 flow [2025-02-06 12:49:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:49:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:49:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-06 12:49:28,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3742857142857143 [2025-02-06 12:49:28,332 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 131 transitions. [2025-02-06 12:49:28,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 394 flow [2025-02-06 12:49:28,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 384 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:49:28,334 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2025-02-06 12:49:28,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-02-06 12:49:28,335 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2025-02-06 12:49:28,335 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2025-02-06 12:49:28,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-02-06 12:49:28,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:28,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:28,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 12:49:28,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:28,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:28,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1071657597, now seen corresponding path program 1 times [2025-02-06 12:49:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319719568] [2025-02-06 12:49:28,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:28,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:28,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:28,546 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:28,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:49:28,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:49:28,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:49:28,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:28,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:28,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:49:28,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:28,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:28,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:28,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319719568] [2025-02-06 12:49:28,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319719568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:28,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:28,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:49:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219499277] [2025-02-06 12:49:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:28,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:49:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:28,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:49:28,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:49:28,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:28,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:49:28,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:28,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:28,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:28,964 INFO L124 PetriNetUnfolderBase]: 1167/1821 cut-off events. [2025-02-06 12:49:28,964 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2025-02-06 12:49:28,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 1821 events. 1167/1821 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7938 event pairs, 303 based on Foata normal form. 56/1866 useless extension candidates. Maximal degree in co-relation 4735. Up to 672 conditions per place. [2025-02-06 12:49:28,969 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 59 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2025-02-06 12:49:28,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 383 flow [2025-02-06 12:49:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:49:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:49:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-02-06 12:49:28,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2025-02-06 12:49:28,970 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 133 transitions. [2025-02-06 12:49:28,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 383 flow [2025-02-06 12:49:28,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 358 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:49:28,976 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2025-02-06 12:49:28,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-02-06 12:49:28,978 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2025-02-06 12:49:28,978 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2025-02-06 12:49:28,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:49:28,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:28,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:28,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 12:49:29,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:29,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:29,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2120974159, now seen corresponding path program 1 times [2025-02-06 12:49:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:29,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263532395] [2025-02-06 12:49:29,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:49:29,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:29,182 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:29,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 12:49:29,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:49:29,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:29,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:29,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:29,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:49:29,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:29,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:29,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:29,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263532395] [2025-02-06 12:49:29,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263532395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:29,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:49:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871240669] [2025-02-06 12:49:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:29,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:49:29,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:29,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:49:29,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:49:29,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:29,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-02-06 12:49:29,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:29,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:29,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:29,802 INFO L124 PetriNetUnfolderBase]: 1641/2567 cut-off events. [2025-02-06 12:49:29,802 INFO L125 PetriNetUnfolderBase]: For 1828/1828 co-relation queries the response was YES. [2025-02-06 12:49:29,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 2567 events. 1641/2567 cut-off events. For 1828/1828 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12033 event pairs, 397 based on Foata normal form. 8/2564 useless extension candidates. Maximal degree in co-relation 6757. Up to 1185 conditions per place. [2025-02-06 12:49:29,818 INFO L140 encePairwiseOnDemand]: 59/70 looper letters, 50 selfloop transitions, 8 changer transitions 54/118 dead transitions. [2025-02-06 12:49:29,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 118 transitions, 659 flow [2025-02-06 12:49:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:49:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:49:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2025-02-06 12:49:29,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2957142857142857 [2025-02-06 12:49:29,819 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 10 states and 207 transitions. [2025-02-06 12:49:29,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 118 transitions, 659 flow [2025-02-06 12:49:29,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 534 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:49:29,830 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 165 flow [2025-02-06 12:49:29,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=165, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2025-02-06 12:49:29,832 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2025-02-06 12:49:29,832 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 165 flow [2025-02-06 12:49:29,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-02-06 12:49:29,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:29,832 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] [2025-02-06 12:49:29,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 12:49:30,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:30,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1488648971, now seen corresponding path program 2 times [2025-02-06 12:49:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098533356] [2025-02-06 12:49:30,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:49:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:30,036 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:30,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 12:49:30,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:49:30,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:30,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:49:30,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:30,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:49:30,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:30,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:30,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098533356] [2025-02-06 12:49:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098533356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:30,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:30,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:49:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793454244] [2025-02-06 12:49:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:30,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:49:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:30,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:49:30,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:49:30,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:30,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 165 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-02-06 12:49:30,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:30,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:30,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:30,658 INFO L124 PetriNetUnfolderBase]: 1517/2386 cut-off events. [2025-02-06 12:49:30,658 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2025-02-06 12:49:30,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6171 conditions, 2386 events. 1517/2386 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11215 event pairs, 305 based on Foata normal form. 8/2385 useless extension candidates. Maximal degree in co-relation 6154. Up to 1185 conditions per place. [2025-02-06 12:49:30,668 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 51 selfloop transitions, 9 changer transitions 43/109 dead transitions. [2025-02-06 12:49:30,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 563 flow [2025-02-06 12:49:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:49:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:49:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2025-02-06 12:49:30,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2025-02-06 12:49:30,670 INFO L175 Difference]: Start difference. First operand has 66 places, 44 transitions, 165 flow. Second operand 9 states and 186 transitions. [2025-02-06 12:49:30,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 563 flow [2025-02-06 12:49:30,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 525 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-06 12:49:30,674 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 185 flow [2025-02-06 12:49:30,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=185, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-02-06 12:49:30,674 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2025-02-06 12:49:30,674 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 185 flow [2025-02-06 12:49:30,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-02-06 12:49:30,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:30,675 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] [2025-02-06 12:49:30,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 12:49:30,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:30,875 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:30,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash -220630181, now seen corresponding path program 3 times [2025-02-06 12:49:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815503611] [2025-02-06 12:49:30,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:49:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:30,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:30,878 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:30,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 12:49:30,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:49:30,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:30,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:49:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:49:30,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 12:49:30,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:49:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:49:31,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:49:31,036 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:49:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815503611] [2025-02-06 12:49:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815503611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:49:31,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:49:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:49:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503206422] [2025-02-06 12:49:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:49:31,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:49:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:49:31,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:49:31,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:49:31,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-02-06 12:49:31,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 185 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-02-06 12:49:31,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:49:31,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-02-06 12:49:31,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:49:31,328 INFO L124 PetriNetUnfolderBase]: 1659/2602 cut-off events. [2025-02-06 12:49:31,329 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2025-02-06 12:49:31,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 2602 events. 1659/2602 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12240 event pairs, 269 based on Foata normal form. 8/2603 useless extension candidates. Maximal degree in co-relation 7050. Up to 1280 conditions per place. [2025-02-06 12:49:31,337 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 56 selfloop transitions, 4 changer transitions 27/93 dead transitions. [2025-02-06 12:49:31,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 527 flow [2025-02-06 12:49:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:49:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:49:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-02-06 12:49:31,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30238095238095236 [2025-02-06 12:49:31,339 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 185 flow. Second operand 6 states and 127 transitions. [2025-02-06 12:49:31,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 527 flow [2025-02-06 12:49:31,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 500 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 12:49:31,342 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 180 flow [2025-02-06 12:49:31,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2025-02-06 12:49:31,342 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2025-02-06 12:49:31,342 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 180 flow [2025-02-06 12:49:31,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-02-06 12:49:31,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:49:31,343 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] [2025-02-06 12:49:31,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 12:49:31,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:31,543 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-02-06 12:49:31,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:49:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash 622866779, now seen corresponding path program 4 times [2025-02-06 12:49:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:49:31,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557468304] [2025-02-06 12:49:31,544 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:49:31,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:31,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:49:31,547 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:49:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 12:49:31,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:49:31,666 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:31,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:49:31,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:49:31,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:49:31,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:49:31,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:49:31,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:49:31,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:49:31,772 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:49:31,773 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:49:31,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2025-02-06 12:49:31,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2025-02-06 12:49:31,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2025-02-06 12:49:31,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2025-02-06 12:49:31,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2025-02-06 12:49:31,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2025-02-06 12:49:31,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2025-02-06 12:49:31,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONMEMORY_LEAK (35 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2025-02-06 12:49:31,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONMEMORY_LEAK (4 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2025-02-06 12:49:31,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2025-02-06 12:49:31,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 12:49:31,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:49:31,980 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:49:32,049 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:49:32,049 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:49:32,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:49:32 BasicIcfg [2025-02-06 12:49:32,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:49:32,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:49:32,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:49:32,056 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:49:32,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:49:17" (3/4) ... [2025-02-06 12:49:32,058 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:49:32,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:49:32,059 INFO L158 Benchmark]: Toolchain (without parser) took 16041.77ms. Allocated memory was 83.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 57.9MB in the beginning and 591.3MB in the end (delta: -533.4MB). Peak memory consumption was 943.8MB. Max. memory is 16.1GB. [2025-02-06 12:49:32,059 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 63.3MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:49:32,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.47ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 34.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:49:32,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.21ms. Allocated memory is still 83.9MB. Free memory was 34.1MB in the beginning and 31.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:49:32,060 INFO L158 Benchmark]: Boogie Preprocessor took 46.71ms. Allocated memory is still 83.9MB. Free memory was 31.6MB in the beginning and 28.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:49:32,060 INFO L158 Benchmark]: IcfgBuilder took 1098.44ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 28.2MB in the beginning and 47.0MB in the end (delta: -18.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2025-02-06 12:49:32,060 INFO L158 Benchmark]: TraceAbstraction took 14395.59ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 46.4MB in the beginning and 591.4MB in the end (delta: -545.0MB). Peak memory consumption was 901.1MB. Max. memory is 16.1GB. [2025-02-06 12:49:32,060 INFO L158 Benchmark]: Witness Printer took 2.24ms. Allocated memory is still 1.6GB. Free memory was 591.4MB in the beginning and 591.3MB in the end (delta: 65.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:49:32,062 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.97ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 63.3MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.47ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 34.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.21ms. Allocated memory is still 83.9MB. Free memory was 34.1MB in the beginning and 31.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.71ms. Allocated memory is still 83.9MB. Free memory was 31.6MB in the beginning and 28.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1098.44ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 28.2MB in the beginning and 47.0MB in the end (delta: -18.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14395.59ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 46.4MB in the beginning and 591.4MB in the end (delta: -545.0MB). Peak memory consumption was 901.1MB. Max. memory is 16.1GB. * Witness Printer took 2.24ms. Allocated memory is still 1.6GB. Free memory was 591.4MB in the beginning and 591.3MB in the end (delta: 65.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L846] 0 pthread_t t2101; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-2, t2101=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L848] 0 pthread_t t2102; [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-2, t2101=-1, t2102=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-2, t2101=-1, t2102=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-2, t2101=-1, t2102=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-2, t2101=-1, t2102=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: 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, 114 locations, 53 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: 14.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 617 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1727 IncrementalHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1 mSDtfsCounter, 1727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=12, InterpolantAutomatonStates: 63, 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.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 991 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1644 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:49:32,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample