./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_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/safe007_power.opt-thin001_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 6328ead9c10c029445fd051d7c6329db494c1000fb08b7313fbd69c70835e259 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:47:49,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:47:49,122 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:47:49,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:47:49,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:47:49,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:47:49,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:47:49,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:47:49,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:47:49,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:47:49,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:47:49,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:47:49,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:47:49,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:47:49,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:47:49,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:47:49,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:47:49,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:47:49,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:47:49,152 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 -> 6328ead9c10c029445fd051d7c6329db494c1000fb08b7313fbd69c70835e259 [2025-02-06 12:47:49,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:47:49,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:47:49,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:47:49,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:47:49,399 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:47:49,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2025-02-06 12:47:50,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/673c90240/5a3abae863054f438e47f0e764ebb015/FLAGf0d0f5399 [2025-02-06 12:47:50,950 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:47:50,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2025-02-06 12:47:50,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/673c90240/5a3abae863054f438e47f0e764ebb015/FLAGf0d0f5399 [2025-02-06 12:47:51,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/673c90240/5a3abae863054f438e47f0e764ebb015 [2025-02-06 12:47:51,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:47:51,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:47:51,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:47:51,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:47:51,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:47:51,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8d08ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51, skipping insertion in model container [2025-02-06 12:47:51,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:47:51,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:47:51,532 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:47:51,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:47:51,662 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:47:51,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51 WrapperNode [2025-02-06 12:47:51,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:47:51,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:47:51,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:47:51,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:47:51,669 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:47:51" (1/1) ... [2025-02-06 12:47:51,683 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:47:51" (1/1) ... [2025-02-06 12:47:51,700 INFO L138 Inliner]: procedures = 175, calls = 60, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2025-02-06 12:47:51,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:47:51,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:47:51,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:47:51,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:47:51,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,731 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2025-02-06 12:47:51,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:47:51,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:47:51,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:47:51,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:47:51,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (1/1) ... [2025-02-06 12:47:51,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:47:51,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:51,776 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:47:51,781 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:47:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:47:51,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:47:51,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:47:51,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:47:51,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:47:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:47:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:47:51,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:47:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:47:51,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:47:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:47:51,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:47:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:47:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:47:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:47:51,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:47:51,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:47:51,799 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:47:51,923 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:47:51,924 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:47:52,242 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:47:52,243 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:47:52,612 WARN L170 LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-06 12:47:52,697 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:47:52,698 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:47:52,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:52 BoogieIcfgContainer [2025-02-06 12:47:52,698 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:47:52,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:47:52,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:47:52,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:47:52,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:47:51" (1/3) ... [2025-02-06 12:47:52,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:47:52, skipping insertion in model container [2025-02-06 12:47:52,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:51" (2/3) ... [2025-02-06 12:47:52,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:47:52, skipping insertion in model container [2025-02-06 12:47:52,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:52" (3/3) ... [2025-02-06 12:47:52,704 INFO L128 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2025-02-06 12:47:52,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:47:52,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe007_power.opt-thin001_power.opt.i that has 4 procedures, 73 locations, 1 initial locations, 0 loop locations, and 33 error locations. [2025-02-06 12:47:52,717 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:47:52,882 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:47:52,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 214 flow [2025-02-06 12:47:52,955 INFO L124 PetriNetUnfolderBase]: 29/98 cut-off events. [2025-02-06 12:47:52,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:52,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 29/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 332 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2025-02-06 12:47:52,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 101 transitions, 214 flow [2025-02-06 12:47:52,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 205 flow [2025-02-06 12:47:52,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:47:52,999 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;@21b6b930, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:47:52,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 12:47:53,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:47:53,006 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-06 12:47:53,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:53,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:53,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:53,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:47:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1432711018, now seen corresponding path program 1 times [2025-02-06 12:47:53,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912791084] [2025-02-06 12:47:53,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:53,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:47:53,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:47:53,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:53,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:53,451 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:47:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:53,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912791084] [2025-02-06 12:47:53,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912791084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:53,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:53,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212832646] [2025-02-06 12:47:53,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:53,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:53,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:53,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:53,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:47:53,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:47:53,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:53,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:47:53,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:00,006 INFO L124 PetriNetUnfolderBase]: 49851/70729 cut-off events. [2025-02-06 12:48:00,007 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-02-06 12:48:00,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139284 conditions, 70729 events. 49851/70729 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 3065. Compared 517425 event pairs, 17323 based on Foata normal form. 2304/46870 useless extension candidates. Maximal degree in co-relation 139273. Up to 35793 conditions per place. [2025-02-06 12:48:00,465 INFO L140 encePairwiseOnDemand]: 54/101 looper letters, 86 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-02-06 12:48:00,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 382 flow [2025-02-06 12:48:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2025-02-06 12:48:00,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66996699669967 [2025-02-06 12:48:00,482 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 205 flow. Second operand 3 states and 203 transitions. [2025-02-06 12:48:00,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 382 flow [2025-02-06 12:48:00,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 378 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:00,494 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2025-02-06 12:48:00,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-02-06 12:48:00,500 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2025-02-06 12:48:00,501 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2025-02-06 12:48:00,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:00,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:00,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:00,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:48:00,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:00,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1464369446, now seen corresponding path program 1 times [2025-02-06 12:48:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664113598] [2025-02-06 12:48:00,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:00,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:00,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:48:00,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:48:00,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:00,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:00,935 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:00,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:00,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664113598] [2025-02-06 12:48:00,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664113598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:00,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:00,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:00,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61484444] [2025-02-06 12:48:00,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:00,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:00,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:00,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:00,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:00,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:00,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:00,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:00,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:04,066 INFO L124 PetriNetUnfolderBase]: 25615/38045 cut-off events. [2025-02-06 12:48:04,067 INFO L125 PetriNetUnfolderBase]: For 4474/4485 co-relation queries the response was YES. [2025-02-06 12:48:04,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77685 conditions, 38045 events. 25615/38045 cut-off events. For 4474/4485 co-relation queries the response was YES. Maximal size of possible extension queue 1563. Compared 267217 event pairs, 24103 based on Foata normal form. 0/29229 useless extension candidates. Maximal degree in co-relation 77673. Up to 35300 conditions per place. [2025-02-06 12:48:04,257 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-06 12:48:04,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 212 flow [2025-02-06 12:48:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-06 12:48:04,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2607260726072607 [2025-02-06 12:48:04,264 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 140 flow. Second operand 3 states and 79 transitions. [2025-02-06 12:48:04,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 212 flow [2025-02-06 12:48:04,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:04,270 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 122 flow [2025-02-06 12:48:04,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-02-06 12:48:04,271 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2025-02-06 12:48:04,271 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 122 flow [2025-02-06 12:48:04,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:04,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:04,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:04,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:48:04,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:04,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:04,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1464369447, now seen corresponding path program 1 times [2025-02-06 12:48:04,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449035024] [2025-02-06 12:48:04,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:04,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:04,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:48:04,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:48:04,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:04,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:04,410 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:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449035024] [2025-02-06 12:48:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449035024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:04,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10481109] [2025-02-06 12:48:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:04,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:04,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:04,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:04,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:04,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:04,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:04,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:04,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:04,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:05,853 INFO L124 PetriNetUnfolderBase]: 10571/16041 cut-off events. [2025-02-06 12:48:05,854 INFO L125 PetriNetUnfolderBase]: For 870/877 co-relation queries the response was YES. [2025-02-06 12:48:05,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32561 conditions, 16041 events. 10571/16041 cut-off events. For 870/877 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 102363 event pairs, 9707 based on Foata normal form. 427/14929 useless extension candidates. Maximal degree in co-relation 32553. Up to 14688 conditions per place. [2025-02-06 12:48:05,925 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-02-06 12:48:05,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 180 flow [2025-02-06 12:48:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-06 12:48:05,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2376237623762376 [2025-02-06 12:48:05,927 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 122 flow. Second operand 3 states and 72 transitions. [2025-02-06 12:48:05,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 180 flow [2025-02-06 12:48:05,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:05,928 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 107 flow [2025-02-06 12:48:05,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2025-02-06 12:48:05,929 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2025-02-06 12:48:05,929 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 107 flow [2025-02-06 12:48:05,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:05,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:05,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:05,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:48:05,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -106382951, now seen corresponding path program 1 times [2025-02-06 12:48:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665024627] [2025-02-06 12:48:05,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:05,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:48:05,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:48:05,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:05,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:05,998 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:05,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:05,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665024627] [2025-02-06 12:48:05,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665024627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:05,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:05,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:05,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723117527] [2025-02-06 12:48:05,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:05,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:06,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:06,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:06,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:06,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 107 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:06,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:06,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:06,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:06,886 INFO L124 PetriNetUnfolderBase]: 9337/13199 cut-off events. [2025-02-06 12:48:06,886 INFO L125 PetriNetUnfolderBase]: For 663/670 co-relation queries the response was YES. [2025-02-06 12:48:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27706 conditions, 13199 events. 9337/13199 cut-off events. For 663/670 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 73638 event pairs, 1115 based on Foata normal form. 0/11948 useless extension candidates. Maximal degree in co-relation 27697. Up to 12003 conditions per place. [2025-02-06 12:48:06,943 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 47 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-02-06 12:48:06,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 251 flow [2025-02-06 12:48:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-06 12:48:06,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2025-02-06 12:48:06,945 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 107 flow. Second operand 3 states and 84 transitions. [2025-02-06 12:48:06,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 251 flow [2025-02-06 12:48:06,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:06,946 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 128 flow [2025-02-06 12:48:06,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-02-06 12:48:06,946 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2025-02-06 12:48:06,946 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 128 flow [2025-02-06 12:48:06,946 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:06,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:06,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:06,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:48:06,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:06,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:06,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1173536949, now seen corresponding path program 1 times [2025-02-06 12:48:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:06,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332429188] [2025-02-06 12:48:06,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:06,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:06,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:48:06,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:48:06,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:06,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:07,140 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:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332429188] [2025-02-06 12:48:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332429188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:07,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:07,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:48:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574400232] [2025-02-06 12:48:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:07,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:07,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:07,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:07,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:07,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 128 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:07,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:07,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:07,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:08,387 INFO L124 PetriNetUnfolderBase]: 8607/12169 cut-off events. [2025-02-06 12:48:08,388 INFO L125 PetriNetUnfolderBase]: For 1527/1534 co-relation queries the response was YES. [2025-02-06 12:48:08,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27862 conditions, 12169 events. 8607/12169 cut-off events. For 1527/1534 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 67056 event pairs, 875 based on Foata normal form. 0/11518 useless extension candidates. Maximal degree in co-relation 27851. Up to 10972 conditions per place. [2025-02-06 12:48:08,453 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 46 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-02-06 12:48:08,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 266 flow [2025-02-06 12:48:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:48:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:48:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 12:48:08,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22772277227722773 [2025-02-06 12:48:08,454 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 128 flow. Second operand 4 states and 92 transitions. [2025-02-06 12:48:08,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 266 flow [2025-02-06 12:48:08,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:08,457 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 124 flow [2025-02-06 12:48:08,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-02-06 12:48:08,458 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2025-02-06 12:48:08,458 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 124 flow [2025-02-06 12:48:08,458 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:48:08,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:08,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:08,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:48:08,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:08,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash 845266408, now seen corresponding path program 1 times [2025-02-06 12:48:08,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:08,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430524450] [2025-02-06 12:48:08,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:08,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:48:08,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:48:08,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:08,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:08,600 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:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430524450] [2025-02-06 12:48:08,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430524450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:08,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:48:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429266498] [2025-02-06 12:48:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:08,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:08,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:08,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:08,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 124 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:08,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:08,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:08,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:09,707 INFO L124 PetriNetUnfolderBase]: 7877/11139 cut-off events. [2025-02-06 12:48:09,708 INFO L125 PetriNetUnfolderBase]: For 1493/1500 co-relation queries the response was YES. [2025-02-06 12:48:09,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25472 conditions, 11139 events. 7877/11139 cut-off events. For 1493/1500 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 60672 event pairs, 635 based on Foata normal form. 300/10788 useless extension candidates. Maximal degree in co-relation 25461. Up to 9942 conditions per place. [2025-02-06 12:48:09,750 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 45 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-02-06 12:48:09,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 260 flow [2025-02-06 12:48:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:48:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:48:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-06 12:48:09,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22524752475247525 [2025-02-06 12:48:09,752 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 124 flow. Second operand 4 states and 91 transitions. [2025-02-06 12:48:09,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 260 flow [2025-02-06 12:48:09,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 247 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:09,754 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 119 flow [2025-02-06 12:48:09,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-02-06 12:48:09,755 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2025-02-06 12:48:09,755 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 119 flow [2025-02-06 12:48:09,755 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:48:09,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:09,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:09,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:48:09,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:09,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 511473395, now seen corresponding path program 1 times [2025-02-06 12:48:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844283227] [2025-02-06 12:48:09,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:09,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:48:09,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:48:09,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:09,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:09,786 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:09,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844283227] [2025-02-06 12:48:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844283227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526237106] [2025-02-06 12:48:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:09,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:09,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:09,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:09,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:09,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:09,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 119 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:09,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:09,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:09,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:10,524 INFO L124 PetriNetUnfolderBase]: 7877/12003 cut-off events. [2025-02-06 12:48:10,524 INFO L125 PetriNetUnfolderBase]: For 1308/1315 co-relation queries the response was YES. [2025-02-06 12:48:10,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26335 conditions, 12003 events. 7877/12003 cut-off events. For 1308/1315 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 73742 event pairs, 7229 based on Foata normal form. 336/11688 useless extension candidates. Maximal degree in co-relation 26325. Up to 10986 conditions per place. [2025-02-06 12:48:10,559 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-06 12:48:10,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 183 flow [2025-02-06 12:48:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-06 12:48:10,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19801980198019803 [2025-02-06 12:48:10,561 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 119 flow. Second operand 3 states and 60 transitions. [2025-02-06 12:48:10,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 183 flow [2025-02-06 12:48:10,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:10,563 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 110 flow [2025-02-06 12:48:10,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-06 12:48:10,565 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2025-02-06 12:48:10,566 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 110 flow [2025-02-06 12:48:10,566 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:10,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:10,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:48:10,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash 511472859, now seen corresponding path program 1 times [2025-02-06 12:48:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454977443] [2025-02-06 12:48:10,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:10,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:48:10,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:48:10,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:10,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:10,692 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:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454977443] [2025-02-06 12:48:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454977443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:48:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388065307] [2025-02-06 12:48:10,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:48:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:10,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:48:10,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:48:10,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:10,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 110 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:48:10,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:10,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:10,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:11,857 INFO L124 PetriNetUnfolderBase]: 9887/14466 cut-off events. [2025-02-06 12:48:11,858 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2025-02-06 12:48:11,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32680 conditions, 14466 events. 9887/14466 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 86893 event pairs, 1887 based on Foata normal form. 0/13300 useless extension candidates. Maximal degree in co-relation 32670. Up to 8867 conditions per place. [2025-02-06 12:48:11,923 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 46 selfloop transitions, 2 changer transitions 82/135 dead transitions. [2025-02-06 12:48:11,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 135 transitions, 644 flow [2025-02-06 12:48:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:48:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:48:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2025-02-06 12:48:11,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24752475247524752 [2025-02-06 12:48:11,924 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 110 flow. Second operand 8 states and 200 transitions. [2025-02-06 12:48:11,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 135 transitions, 644 flow [2025-02-06 12:48:11,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 135 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:11,927 INFO L231 Difference]: Finished difference. Result has 60 places, 37 transitions, 123 flow [2025-02-06 12:48:11,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=8, PETRI_FLOW=123, PETRI_PLACES=60, PETRI_TRANSITIONS=37} [2025-02-06 12:48:11,928 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2025-02-06 12:48:11,928 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 123 flow [2025-02-06 12:48:11,928 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:48:11,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:11,928 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:48:11,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:48:11,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:11,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 460674330, now seen corresponding path program 1 times [2025-02-06 12:48:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796325798] [2025-02-06 12:48:11,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:11,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:48:11,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:48:11,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:11,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:12,116 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:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796325798] [2025-02-06 12:48:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796325798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:12,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:12,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:48:12,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843058674] [2025-02-06 12:48:12,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:12,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:48:12,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:12,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:48:12,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:48:12,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:12,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 37 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:12,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:12,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:12,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:13,130 INFO L124 PetriNetUnfolderBase]: 7922/11766 cut-off events. [2025-02-06 12:48:13,130 INFO L125 PetriNetUnfolderBase]: For 3449/3451 co-relation queries the response was YES. [2025-02-06 12:48:13,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28868 conditions, 11766 events. 7922/11766 cut-off events. For 3449/3451 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 68544 event pairs, 2753 based on Foata normal form. 300/11381 useless extension candidates. Maximal degree in co-relation 28852. Up to 9189 conditions per place. [2025-02-06 12:48:13,191 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 44 selfloop transitions, 7 changer transitions 59/115 dead transitions. [2025-02-06 12:48:13,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 115 transitions, 626 flow [2025-02-06 12:48:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:48:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:48:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2025-02-06 12:48:13,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23903818953323905 [2025-02-06 12:48:13,193 INFO L175 Difference]: Start difference. First operand has 60 places, 37 transitions, 123 flow. Second operand 7 states and 169 transitions. [2025-02-06 12:48:13,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 115 transitions, 626 flow [2025-02-06 12:48:13,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 115 transitions, 604 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 12:48:13,255 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 210 flow [2025-02-06 12:48:13,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2025-02-06 12:48:13,255 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2025-02-06 12:48:13,255 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 210 flow [2025-02-06 12:48:13,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:13,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:13,256 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:48:13,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:48:13,256 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -27482407, now seen corresponding path program 1 times [2025-02-06 12:48:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202504690] [2025-02-06 12:48:13,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:13,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:48:13,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:48:13,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:13,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:13,380 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:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:13,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202504690] [2025-02-06 12:48:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202504690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:13,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:13,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111934342] [2025-02-06 12:48:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:13,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:13,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:13,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:13,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:13,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:13,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:13,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:13,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:14,614 INFO L124 PetriNetUnfolderBase]: 9902/14526 cut-off events. [2025-02-06 12:48:14,614 INFO L125 PetriNetUnfolderBase]: For 6915/6922 co-relation queries the response was YES. [2025-02-06 12:48:14,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37436 conditions, 14526 events. 9902/14526 cut-off events. For 6915/6922 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 83730 event pairs, 1387 based on Foata normal form. 475/14518 useless extension candidates. Maximal degree in co-relation 37419. Up to 5148 conditions per place. [2025-02-06 12:48:14,678 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 50 selfloop transitions, 3 changer transitions 96/154 dead transitions. [2025-02-06 12:48:14,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 154 transitions, 898 flow [2025-02-06 12:48:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:48:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:48:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions. [2025-02-06 12:48:14,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2306930693069307 [2025-02-06 12:48:14,680 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 210 flow. Second operand 10 states and 233 transitions. [2025-02-06 12:48:14,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 154 transitions, 898 flow [2025-02-06 12:48:14,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 154 transitions, 839 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:14,739 INFO L231 Difference]: Finished difference. Result has 69 places, 37 transitions, 159 flow [2025-02-06 12:48:14,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=159, PETRI_PLACES=69, PETRI_TRANSITIONS=37} [2025-02-06 12:48:14,740 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2025-02-06 12:48:14,740 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 37 transitions, 159 flow [2025-02-06 12:48:14,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:14,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:14,740 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:48:14,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:48:14,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash 588145761, now seen corresponding path program 1 times [2025-02-06 12:48:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:14,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530626058] [2025-02-06 12:48:14,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:14,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:14,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:48:14,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:48:14,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:14,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:14,942 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:14,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:14,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530626058] [2025-02-06 12:48:14,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530626058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:14,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:14,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:14,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071877388] [2025-02-06 12:48:14,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:14,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:14,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:14,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:14,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:14,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:14,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 37 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:14,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:14,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:14,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:15,576 INFO L124 PetriNetUnfolderBase]: 5050/7509 cut-off events. [2025-02-06 12:48:15,576 INFO L125 PetriNetUnfolderBase]: For 7135/7137 co-relation queries the response was YES. [2025-02-06 12:48:15,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18984 conditions, 7509 events. 5050/7509 cut-off events. For 7135/7137 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 39107 event pairs, 1072 based on Foata normal form. 180/7629 useless extension candidates. Maximal degree in co-relation 18960. Up to 2600 conditions per place. [2025-02-06 12:48:15,603 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 42 selfloop transitions, 3 changer transitions 53/103 dead transitions. [2025-02-06 12:48:15,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 532 flow [2025-02-06 12:48:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:48:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:48:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-02-06 12:48:15,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21163366336633663 [2025-02-06 12:48:15,605 INFO L175 Difference]: Start difference. First operand has 69 places, 37 transitions, 159 flow. Second operand 8 states and 171 transitions. [2025-02-06 12:48:15,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 532 flow [2025-02-06 12:48:15,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 486 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-02-06 12:48:15,648 INFO L231 Difference]: Finished difference. Result has 65 places, 33 transitions, 123 flow [2025-02-06 12:48:15,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=65, PETRI_TRANSITIONS=33} [2025-02-06 12:48:15,649 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -14 predicate places. [2025-02-06 12:48:15,649 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 33 transitions, 123 flow [2025-02-06 12:48:15,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:15,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:15,649 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:48:15,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:48:15,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:15,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 145255432, now seen corresponding path program 1 times [2025-02-06 12:48:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044808536] [2025-02-06 12:48:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:15,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:48:15,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:48:15,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:15,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:16,112 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:16,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:16,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044808536] [2025-02-06 12:48:16,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044808536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:16,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:16,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:48:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68061151] [2025-02-06 12:48:16,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:16,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:48:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:16,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:48:16,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:48:16,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:16,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 33 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:16,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:16,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:16,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:16,505 INFO L124 PetriNetUnfolderBase]: 1917/2999 cut-off events. [2025-02-06 12:48:16,505 INFO L125 PetriNetUnfolderBase]: For 2457/2457 co-relation queries the response was YES. [2025-02-06 12:48:16,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7314 conditions, 2999 events. 1917/2999 cut-off events. For 2457/2457 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14571 event pairs, 487 based on Foata normal form. 80/3079 useless extension candidates. Maximal degree in co-relation 7293. Up to 2218 conditions per place. [2025-02-06 12:48:16,515 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 46 selfloop transitions, 7 changer transitions 45/103 dead transitions. [2025-02-06 12:48:16,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 103 transitions, 515 flow [2025-02-06 12:48:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:48:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:48:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-02-06 12:48:16,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18001800180018002 [2025-02-06 12:48:16,516 INFO L175 Difference]: Start difference. First operand has 65 places, 33 transitions, 123 flow. Second operand 11 states and 200 transitions. [2025-02-06 12:48:16,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 103 transitions, 515 flow [2025-02-06 12:48:16,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 429 flow, removed 26 selfloop flow, removed 13 redundant places. [2025-02-06 12:48:16,525 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 148 flow [2025-02-06 12:48:16,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=148, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2025-02-06 12:48:16,527 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -13 predicate places. [2025-02-06 12:48:16,527 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 148 flow [2025-02-06 12:48:16,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:16,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:16,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:16,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:48:16,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:16,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1422628666, now seen corresponding path program 1 times [2025-02-06 12:48:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:16,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462830067] [2025-02-06 12:48:16,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:16,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:16,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:48:16,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:48:16,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:16,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:17,342 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:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462830067] [2025-02-06 12:48:17,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462830067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:17,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:48:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029158759] [2025-02-06 12:48:17,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:17,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:48:17,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:17,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:48:17,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:48:17,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:17,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 38 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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:17,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:17,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:17,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:17,760 INFO L124 PetriNetUnfolderBase]: 1897/2939 cut-off events. [2025-02-06 12:48:17,760 INFO L125 PetriNetUnfolderBase]: For 2621/2621 co-relation queries the response was YES. [2025-02-06 12:48:17,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8011 conditions, 2939 events. 1897/2939 cut-off events. For 2621/2621 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13493 event pairs, 291 based on Foata normal form. 60/2999 useless extension candidates. Maximal degree in co-relation 7993. Up to 1657 conditions per place. [2025-02-06 12:48:17,770 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 47 selfloop transitions, 9 changer transitions 43/104 dead transitions. [2025-02-06 12:48:17,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 544 flow [2025-02-06 12:48:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:48:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:48:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-02-06 12:48:17,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1782178217821782 [2025-02-06 12:48:17,772 INFO L175 Difference]: Start difference. First operand has 66 places, 38 transitions, 148 flow. Second operand 11 states and 198 transitions. [2025-02-06 12:48:17,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 544 flow [2025-02-06 12:48:17,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 526 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:17,778 INFO L231 Difference]: Finished difference. Result has 75 places, 40 transitions, 204 flow [2025-02-06 12:48:17,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=204, PETRI_PLACES=75, PETRI_TRANSITIONS=40} [2025-02-06 12:48:17,778 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -4 predicate places. [2025-02-06 12:48:17,778 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 40 transitions, 204 flow [2025-02-06 12:48:17,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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:17,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:17,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:17,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:48:17,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:17,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:17,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1925770380, now seen corresponding path program 1 times [2025-02-06 12:48:17,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:17,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271286031] [2025-02-06 12:48:17,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:17,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:48:17,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:48:17,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:17,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:18,267 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:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:18,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271286031] [2025-02-06 12:48:18,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271286031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:18,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:18,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:48:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390090317] [2025-02-06 12:48:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:18,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:48:18,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:18,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:48:18,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:48:18,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:18,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 40 transitions, 204 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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:18,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:18,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:18,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:18,775 INFO L124 PetriNetUnfolderBase]: 1862/2892 cut-off events. [2025-02-06 12:48:18,775 INFO L125 PetriNetUnfolderBase]: For 6500/6500 co-relation queries the response was YES. [2025-02-06 12:48:18,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9115 conditions, 2892 events. 1862/2892 cut-off events. For 6500/6500 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 13643 event pairs, 452 based on Foata normal form. 64/2956 useless extension candidates. Maximal degree in co-relation 9090. Up to 2269 conditions per place. [2025-02-06 12:48:18,787 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 53 selfloop transitions, 10 changer transitions 31/99 dead transitions. [2025-02-06 12:48:18,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 653 flow [2025-02-06 12:48:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:48:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:48:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2025-02-06 12:48:18,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1859185918591859 [2025-02-06 12:48:18,789 INFO L175 Difference]: Start difference. First operand has 75 places, 40 transitions, 204 flow. Second operand 9 states and 169 transitions. [2025-02-06 12:48:18,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 653 flow [2025-02-06 12:48:18,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 99 transitions, 549 flow, removed 44 selfloop flow, removed 11 redundant places. [2025-02-06 12:48:18,804 INFO L231 Difference]: Finished difference. Result has 73 places, 49 transitions, 280 flow [2025-02-06 12:48:18,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=280, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2025-02-06 12:48:18,805 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -6 predicate places. [2025-02-06 12:48:18,805 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 280 flow [2025-02-06 12:48:18,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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:18,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:18,806 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:48:18,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:48:18,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash -767690930, now seen corresponding path program 1 times [2025-02-06 12:48:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947505629] [2025-02-06 12:48:18,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:18,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:48:18,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:48:18,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:18,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:19,475 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:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947505629] [2025-02-06 12:48:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947505629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:19,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:19,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:48:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730779204] [2025-02-06 12:48:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:19,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:48:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:19,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:48:19,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:48:19,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:19,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 49 transitions, 280 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:19,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:19,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:19,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:19,864 INFO L124 PetriNetUnfolderBase]: 1823/2833 cut-off events. [2025-02-06 12:48:19,864 INFO L125 PetriNetUnfolderBase]: For 4677/4677 co-relation queries the response was YES. [2025-02-06 12:48:19,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 2833 events. 1823/2833 cut-off events. For 4677/4677 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12927 event pairs, 345 based on Foata normal form. 48/2881 useless extension candidates. Maximal degree in co-relation 8726. Up to 1605 conditions per place. [2025-02-06 12:48:19,876 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 51 selfloop transitions, 14 changer transitions 29/99 dead transitions. [2025-02-06 12:48:19,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 628 flow [2025-02-06 12:48:19,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:48:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:48:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2025-02-06 12:48:19,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18151815181518152 [2025-02-06 12:48:19,878 INFO L175 Difference]: Start difference. First operand has 73 places, 49 transitions, 280 flow. Second operand 9 states and 165 transitions. [2025-02-06 12:48:19,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 628 flow [2025-02-06 12:48:19,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 99 transitions, 612 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:19,886 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 337 flow [2025-02-06 12:48:19,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=337, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2025-02-06 12:48:19,887 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-02-06 12:48:19,887 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 337 flow [2025-02-06 12:48:19,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:19,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:19,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:19,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:48:19,887 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:19,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash -581839216, now seen corresponding path program 2 times [2025-02-06 12:48:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:19,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093277697] [2025-02-06 12:48:19,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:48:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:19,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:48:19,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:48:19,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:48:19,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:20,754 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:20,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:20,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093277697] [2025-02-06 12:48:20,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093277697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:20,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:20,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:48:20,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79636779] [2025-02-06 12:48:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:20,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:48:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:20,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:48:20,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:48:20,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:20,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 50 transitions, 337 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:20,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:20,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:20,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:21,225 INFO L124 PetriNetUnfolderBase]: 1840/2862 cut-off events. [2025-02-06 12:48:21,225 INFO L125 PetriNetUnfolderBase]: For 8618/8618 co-relation queries the response was YES. [2025-02-06 12:48:21,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9826 conditions, 2862 events. 1840/2862 cut-off events. For 8618/8618 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 13374 event pairs, 441 based on Foata normal form. 48/2910 useless extension candidates. Maximal degree in co-relation 9797. Up to 2160 conditions per place. [2025-02-06 12:48:21,238 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 55 selfloop transitions, 12 changer transitions 29/101 dead transitions. [2025-02-06 12:48:21,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 719 flow [2025-02-06 12:48:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:48:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:48:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2025-02-06 12:48:21,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18371837183718373 [2025-02-06 12:48:21,239 INFO L175 Difference]: Start difference. First operand has 80 places, 50 transitions, 337 flow. Second operand 9 states and 167 transitions. [2025-02-06 12:48:21,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 719 flow [2025-02-06 12:48:21,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 101 transitions, 638 flow, removed 32 selfloop flow, removed 9 redundant places. [2025-02-06 12:48:21,261 INFO L231 Difference]: Finished difference. Result has 80 places, 52 transitions, 359 flow [2025-02-06 12:48:21,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=80, PETRI_TRANSITIONS=52} [2025-02-06 12:48:21,262 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-02-06 12:48:21,262 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 52 transitions, 359 flow [2025-02-06 12:48:21,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:21,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:21,263 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:48:21,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:48:21,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:21,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1036601943, now seen corresponding path program 1 times [2025-02-06 12:48:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:21,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963502559] [2025-02-06 12:48:21,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:21,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:48:21,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:48:21,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:21,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:21,376 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:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963502559] [2025-02-06 12:48:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963502559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:21,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:21,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:48:21,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987646321] [2025-02-06 12:48:21,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:21,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:21,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:21,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:21,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:21,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 52 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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:48:21,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:21,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:21,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:21,592 INFO L124 PetriNetUnfolderBase]: 1579/2511 cut-off events. [2025-02-06 12:48:21,593 INFO L125 PetriNetUnfolderBase]: For 5489/5489 co-relation queries the response was YES. [2025-02-06 12:48:21,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8238 conditions, 2511 events. 1579/2511 cut-off events. For 5489/5489 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12206 event pairs, 172 based on Foata normal form. 118/2629 useless extension candidates. Maximal degree in co-relation 8210. Up to 1446 conditions per place. [2025-02-06 12:48:21,603 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 74 selfloop transitions, 5 changer transitions 1/85 dead transitions. [2025-02-06 12:48:21,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 85 transitions, 743 flow [2025-02-06 12:48:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:48:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:48:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-02-06 12:48:21,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23514851485148514 [2025-02-06 12:48:21,604 INFO L175 Difference]: Start difference. First operand has 80 places, 52 transitions, 359 flow. Second operand 4 states and 95 transitions. [2025-02-06 12:48:21,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 85 transitions, 743 flow [2025-02-06 12:48:21,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 690 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-02-06 12:48:21,610 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 342 flow [2025-02-06 12:48:21,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=342, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2025-02-06 12:48:21,611 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -7 predicate places. [2025-02-06 12:48:21,611 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 342 flow [2025-02-06 12:48:21,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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:48:21,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:21,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:21,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:48:21,611 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:21,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash 239412591, now seen corresponding path program 1 times [2025-02-06 12:48:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:21,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900879910] [2025-02-06 12:48:21,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:21,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:48:21,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:48:21,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:21,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:22,485 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:22,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:22,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900879910] [2025-02-06 12:48:22,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900879910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:22,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:48:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069919483] [2025-02-06 12:48:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:48:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:22,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:48:22,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:48:22,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:22,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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:22,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:22,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:22,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:22,932 INFO L124 PetriNetUnfolderBase]: 1469/2313 cut-off events. [2025-02-06 12:48:22,932 INFO L125 PetriNetUnfolderBase]: For 4042/4042 co-relation queries the response was YES. [2025-02-06 12:48:22,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7799 conditions, 2313 events. 1469/2313 cut-off events. For 4042/4042 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 10409 event pairs, 552 based on Foata normal form. 40/2353 useless extension candidates. Maximal degree in co-relation 7775. Up to 1787 conditions per place. [2025-02-06 12:48:22,941 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 60 selfloop transitions, 9 changer transitions 29/103 dead transitions. [2025-02-06 12:48:22,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 740 flow [2025-02-06 12:48:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:48:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:48:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2025-02-06 12:48:22,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18041804180418042 [2025-02-06 12:48:22,942 INFO L175 Difference]: Start difference. First operand has 72 places, 53 transitions, 342 flow. Second operand 9 states and 164 transitions. [2025-02-06 12:48:22,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 740 flow [2025-02-06 12:48:22,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 715 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:22,947 INFO L231 Difference]: Finished difference. Result has 83 places, 54 transitions, 377 flow [2025-02-06 12:48:22,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=377, PETRI_PLACES=83, PETRI_TRANSITIONS=54} [2025-02-06 12:48:22,948 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-02-06 12:48:22,948 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 54 transitions, 377 flow [2025-02-06 12:48:22,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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:22,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:22,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:22,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:48:22,948 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash 13413039, now seen corresponding path program 1 times [2025-02-06 12:48:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432431880] [2025-02-06 12:48:22,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:22,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:48:22,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:48:22,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:22,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:23,052 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:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432431880] [2025-02-06 12:48:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432431880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:48:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877540311] [2025-02-06 12:48:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:23,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:48:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:23,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:48:23,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:48:23,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:23,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 54 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:23,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:23,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:23,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:23,230 INFO L124 PetriNetUnfolderBase]: 994/1608 cut-off events. [2025-02-06 12:48:23,231 INFO L125 PetriNetUnfolderBase]: For 3294/3294 co-relation queries the response was YES. [2025-02-06 12:48:23,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 1608 events. 994/1608 cut-off events. For 3294/3294 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6991 event pairs, 84 based on Foata normal form. 94/1702 useless extension candidates. Maximal degree in co-relation 5297. Up to 633 conditions per place. [2025-02-06 12:48:23,236 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 70 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2025-02-06 12:48:23,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 686 flow [2025-02-06 12:48:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:48:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:48:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2025-02-06 12:48:23,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22772277227722773 [2025-02-06 12:48:23,237 INFO L175 Difference]: Start difference. First operand has 83 places, 54 transitions, 377 flow. Second operand 5 states and 115 transitions. [2025-02-06 12:48:23,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 84 transitions, 686 flow [2025-02-06 12:48:23,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 84 transitions, 614 flow, removed 7 selfloop flow, removed 12 redundant places. [2025-02-06 12:48:23,241 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 286 flow [2025-02-06 12:48:23,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2025-02-06 12:48:23,241 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -6 predicate places. [2025-02-06 12:48:23,242 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 286 flow [2025-02-06 12:48:23,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:23,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:23,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:23,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:48:23,242 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:23,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:23,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1423726620, now seen corresponding path program 1 times [2025-02-06 12:48:23,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:23,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842867284] [2025-02-06 12:48:23,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:23,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:23,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:48:23,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:48:23,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:23,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:23,389 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:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:23,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842867284] [2025-02-06 12:48:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842867284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096554367] [2025-02-06 12:48:23,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:23,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:23,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:23,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:23,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:23,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:23,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:23,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:23,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:23,533 INFO L124 PetriNetUnfolderBase]: 569/921 cut-off events. [2025-02-06 12:48:23,533 INFO L125 PetriNetUnfolderBase]: For 1912/1912 co-relation queries the response was YES. [2025-02-06 12:48:23,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 921 events. 569/921 cut-off events. For 1912/1912 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3422 event pairs, 65 based on Foata normal form. 44/965 useless extension candidates. Maximal degree in co-relation 3121. Up to 324 conditions per place. [2025-02-06 12:48:23,536 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 58 selfloop transitions, 11 changer transitions 1/75 dead transitions. [2025-02-06 12:48:23,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 75 transitions, 559 flow [2025-02-06 12:48:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:48:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:48:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-02-06 12:48:23,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19966996699669967 [2025-02-06 12:48:23,538 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 286 flow. Second operand 6 states and 121 transitions. [2025-02-06 12:48:23,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 75 transitions, 559 flow [2025-02-06 12:48:23,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 439 flow, removed 24 selfloop flow, removed 13 redundant places. [2025-02-06 12:48:23,541 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 218 flow [2025-02-06 12:48:23,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2025-02-06 12:48:23,542 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -12 predicate places. [2025-02-06 12:48:23,542 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 218 flow [2025-02-06 12:48:23,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:23,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:23,542 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:48:23,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:48:23,542 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1579437459, now seen corresponding path program 1 times [2025-02-06 12:48:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677439378] [2025-02-06 12:48:23,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:23,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:23,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:23,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:23,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:23,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:48:23,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:48:23,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:23,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:23,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:23,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:48:23,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:48:23,663 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:48:23,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (59 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2025-02-06 12:48:23,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2025-02-06 12:48:23,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (24 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2025-02-06 12:48:23,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2025-02-06 12:48:23,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:48:23,670 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:23,745 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:48:23,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:48:23,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:48:23 BasicIcfg [2025-02-06 12:48:23,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:48:23,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:48:23,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:48:23,749 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:48:23,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:52" (3/4) ... [2025-02-06 12:48:23,750 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:48:23,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:48:23,751 INFO L158 Benchmark]: Toolchain (without parser) took 32541.19ms. Allocated memory was 142.6MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 104.6MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-02-06 12:48:23,751 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:23,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.64ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 80.0MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:48:23,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.08ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 77.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:23,752 INFO L158 Benchmark]: Boogie Preprocessor took 50.34ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 73.5MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:48:23,752 INFO L158 Benchmark]: IcfgBuilder took 946.71ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 43.5MB in the end (delta: 30.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2025-02-06 12:48:23,752 INFO L158 Benchmark]: TraceAbstraction took 31048.63ms. Allocated memory was 142.6MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 42.7MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-02-06 12:48:23,752 INFO L158 Benchmark]: Witness Printer took 2.23ms. Allocated memory is still 6.2GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 858.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:48:23,753 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.13ms. Allocated memory is still 226.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.64ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 80.0MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.08ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 77.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.34ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 73.5MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 946.71ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 43.5MB in the end (delta: 30.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31048.63ms. Allocated memory was 142.6MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 42.7MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 2.23ms. Allocated memory is still 6.2GB. Free memory was 3.3GB in the beginning and 3.3GB in the end (delta: 858.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-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}, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-2, t1941=-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}, z=0] [L854] 0 pthread_t t1942; [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-2, t1941=-1, t1942=0, 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}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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}, z=0] [L825] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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}, z=1] [L828] 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) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] 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) [L828] 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) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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}, z=1] [L765] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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}, z=1] [L777] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-2, t1941=-1, t1942=0, weak$$choice0=1, weak$$choice1=0, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-2, t1941=-1, t1942=0, weak$$choice0=1, weak$$choice1=0, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-2, t1941=-1, t1942=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe007_power.opt-thin001_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: 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: -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: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 855]: 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, 122 locations, 61 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: 30.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1207 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1197 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3162 IncrementalHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 2 mSDtfsCounter, 3162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=18, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 3941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:48:23,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/safe007_power.opt-thin001_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 6328ead9c10c029445fd051d7c6329db494c1000fb08b7313fbd69c70835e259 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:48:26,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:48:26,717 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:48:26,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:48:26,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:48:26,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:48:26,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:48:26,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:48:26,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:48:26,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:48:26,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:48:26,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:48:26,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:48:26,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:48:26,753 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:48:26,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:48:26,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:48:26,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:48:26,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:48:26,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:48:26,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:48:26,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:48:26,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:48:26,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:48:26,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:48:26,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:48:26,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:48:26,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:48:26,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:48:26,756 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:48:26,756 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:48:26,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:48:26,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:48:26,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:48:26,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:48:26,757 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 -> 6328ead9c10c029445fd051d7c6329db494c1000fb08b7313fbd69c70835e259 [2025-02-06 12:48:27,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:48:27,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:48:27,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:48:27,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:48:27,069 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:48:27,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2025-02-06 12:48:28,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4daab6b3f/796e81ac05b64e6a9633507dcbb2e2c2/FLAG2306d1e76 [2025-02-06 12:48:28,532 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:48:28,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2025-02-06 12:48:28,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4daab6b3f/796e81ac05b64e6a9633507dcbb2e2c2/FLAG2306d1e76 [2025-02-06 12:48:28,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4daab6b3f/796e81ac05b64e6a9633507dcbb2e2c2 [2025-02-06 12:48:28,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:48:28,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:48:28,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:48:28,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:48:28,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:48:28,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:48:28" (1/1) ... [2025-02-06 12:48:28,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6846383f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:28, skipping insertion in model container [2025-02-06 12:48:28,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:48:28" (1/1) ... [2025-02-06 12:48:28,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:48:29,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:48:29,292 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:48:29,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:48:29,400 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:48:29,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:29 WrapperNode [2025-02-06 12:48:29,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:48:29,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:48:29,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:48:29,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:48:29,408 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:29" (1/1) ... [2025-02-06 12:48:29,429 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:29" (1/1) ... [2025-02-06 12:48:29,456 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 175 [2025-02-06 12:48:29,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:48:29,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:48:29,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:48:29,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:48:29,466 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:29" (1/1) ... [2025-02-06 12:48:29,467 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:29" (1/1) ... [2025-02-06 12:48:29,472 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:29" (1/1) ... [2025-02-06 12:48:29,508 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2025-02-06 12:48:29,508 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:29" (1/1) ... [2025-02-06 12:48:29,509 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:29" (1/1) ... [2025-02-06 12:48:29,515 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:29" (1/1) ... [2025-02-06 12:48:29,516 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:29" (1/1) ... [2025-02-06 12:48:29,518 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:29" (1/1) ... [2025-02-06 12:48:29,519 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:29" (1/1) ... [2025-02-06 12:48:29,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:48:29,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:48:29,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:48:29,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:48:29,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:29" (1/1) ... [2025-02-06 12:48:29,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:48:29,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:29,553 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:29,555 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:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:48:29,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:48:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:48:29,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:48:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:48:29,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:48:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:48:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:48:29,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:48:29,573 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:29,686 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:48:29,688 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:48:30,093 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:48:30,093 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:48:30,518 WARN L170 LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-06 12:48:30,609 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:48:30,610 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:48:30,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:48:30 BoogieIcfgContainer [2025-02-06 12:48:30,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:48:30,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:48:30,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:48:30,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:48:30,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:48:28" (1/3) ... [2025-02-06 12:48:30,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b52cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:48:30, skipping insertion in model container [2025-02-06 12:48:30,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:29" (2/3) ... [2025-02-06 12:48:30,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b52cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:48:30, skipping insertion in model container [2025-02-06 12:48:30,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:48:30" (3/3) ... [2025-02-06 12:48:30,616 INFO L128 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2025-02-06 12:48:30,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:48:30,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe007_power.opt-thin001_power.opt.i that has 4 procedures, 73 locations, 1 initial locations, 0 loop locations, and 33 error locations. [2025-02-06 12:48:30,629 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:48:30,813 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:48:30,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 214 flow [2025-02-06 12:48:30,897 INFO L124 PetriNetUnfolderBase]: 29/98 cut-off events. [2025-02-06 12:48:30,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:30,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 29/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 332 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2025-02-06 12:48:30,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 101 transitions, 214 flow [2025-02-06 12:48:30,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 205 flow [2025-02-06 12:48:30,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:48:30,929 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;@3d909fb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:48:30,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 12:48:30,938 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:48:30,938 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-06 12:48:30,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:30,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:30,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:30,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1028082004, now seen corresponding path program 1 times [2025-02-06 12:48:30,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:30,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665553327] [2025-02-06 12:48:30,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:30,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:30,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:30,964 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:48:30,965 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:48:31,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 12:48:31,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 12:48:31,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:31,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:31,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:48:31,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:31,146 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:31,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:31,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665553327] [2025-02-06 12:48:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665553327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:31,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:31,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:31,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831148988] [2025-02-06 12:48:31,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:31,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:31,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:31,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:31,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:31,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:31,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:31,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:37,184 INFO L124 PetriNetUnfolderBase]: 49851/70729 cut-off events. [2025-02-06 12:48:37,185 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-02-06 12:48:37,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139284 conditions, 70729 events. 49851/70729 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 3065. Compared 517374 event pairs, 17323 based on Foata normal form. 2304/46870 useless extension candidates. Maximal degree in co-relation 139273. Up to 35793 conditions per place. [2025-02-06 12:48:38,085 INFO L140 encePairwiseOnDemand]: 54/101 looper letters, 86 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-02-06 12:48:38,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 382 flow [2025-02-06 12:48:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2025-02-06 12:48:38,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66996699669967 [2025-02-06 12:48:38,102 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 205 flow. Second operand 3 states and 203 transitions. [2025-02-06 12:48:38,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 382 flow [2025-02-06 12:48:38,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 378 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:38,111 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2025-02-06 12:48:38,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-02-06 12:48:38,117 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2025-02-06 12:48:38,118 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2025-02-06 12:48:38,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:38,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:38,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:38,128 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:48:38,323 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:48:38,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:38,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1805770202, now seen corresponding path program 1 times [2025-02-06 12:48:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:38,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928973122] [2025-02-06 12:48:38,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:38,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:38,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:38,331 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:48:38,336 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:48:38,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:48:38,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:48:38,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:38,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:38,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:48:38,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:38,494 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:38,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:38,495 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928973122] [2025-02-06 12:48:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928973122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:38,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852334750] [2025-02-06 12:48:38,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:38,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:38,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:38,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:38,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:38,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:38,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:38,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:38,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:41,418 INFO L124 PetriNetUnfolderBase]: 25615/38045 cut-off events. [2025-02-06 12:48:41,418 INFO L125 PetriNetUnfolderBase]: For 4474/4485 co-relation queries the response was YES. [2025-02-06 12:48:41,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77685 conditions, 38045 events. 25615/38045 cut-off events. For 4474/4485 co-relation queries the response was YES. Maximal size of possible extension queue 1563. Compared 267214 event pairs, 24103 based on Foata normal form. 0/29229 useless extension candidates. Maximal degree in co-relation 77673. Up to 35300 conditions per place. [2025-02-06 12:48:41,586 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-06 12:48:41,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 212 flow [2025-02-06 12:48:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-06 12:48:41,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2607260726072607 [2025-02-06 12:48:41,589 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 140 flow. Second operand 3 states and 79 transitions. [2025-02-06 12:48:41,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 212 flow [2025-02-06 12:48:41,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:41,594 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 122 flow [2025-02-06 12:48:41,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-02-06 12:48:41,597 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2025-02-06 12:48:41,597 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 122 flow [2025-02-06 12:48:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:41,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:41,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:41,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:48:41,798 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:48:41,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:41,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1805770201, now seen corresponding path program 1 times [2025-02-06 12:48:41,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:41,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252687315] [2025-02-06 12:48:41,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:41,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:41,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:41,803 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:48:41,804 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:48:41,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:48:41,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:48:41,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:41,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:41,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:48:41,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:41,962 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:41,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:41,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252687315] [2025-02-06 12:48:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252687315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:41,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787664552] [2025-02-06 12:48:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:41,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:41,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:41,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:41,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:41,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:41,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:41,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:43,443 INFO L124 PetriNetUnfolderBase]: 10571/16041 cut-off events. [2025-02-06 12:48:43,443 INFO L125 PetriNetUnfolderBase]: For 870/877 co-relation queries the response was YES. [2025-02-06 12:48:43,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32561 conditions, 16041 events. 10571/16041 cut-off events. For 870/877 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 102337 event pairs, 9707 based on Foata normal form. 427/14929 useless extension candidates. Maximal degree in co-relation 32553. Up to 14688 conditions per place. [2025-02-06 12:48:43,531 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-02-06 12:48:43,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 180 flow [2025-02-06 12:48:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-06 12:48:43,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2376237623762376 [2025-02-06 12:48:43,533 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 122 flow. Second operand 3 states and 72 transitions. [2025-02-06 12:48:43,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 180 flow [2025-02-06 12:48:43,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:43,534 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 107 flow [2025-02-06 12:48:43,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2025-02-06 12:48:43,535 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2025-02-06 12:48:43,535 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 107 flow [2025-02-06 12:48:43,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:43,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:43,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:43,543 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:48:43,735 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:48:43,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:43,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1906540635, now seen corresponding path program 1 times [2025-02-06 12:48:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:43,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353552989] [2025-02-06 12:48:43,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:43,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:43,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:43,740 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:48:43,745 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:48:43,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:48:43,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:48:43,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:43,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:43,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:48:43,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:43,921 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:43,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:43,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:43,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353552989] [2025-02-06 12:48:43,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353552989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:43,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:43,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:43,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020596056] [2025-02-06 12:48:43,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:43,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:43,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:43,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:43,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:43,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:43,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 107 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:43,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:43,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:43,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:45,224 INFO L124 PetriNetUnfolderBase]: 9337/13199 cut-off events. [2025-02-06 12:48:45,224 INFO L125 PetriNetUnfolderBase]: For 663/670 co-relation queries the response was YES. [2025-02-06 12:48:45,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27706 conditions, 13199 events. 9337/13199 cut-off events. For 663/670 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 73637 event pairs, 1115 based on Foata normal form. 0/11948 useless extension candidates. Maximal degree in co-relation 27697. Up to 12003 conditions per place. [2025-02-06 12:48:45,289 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 47 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-02-06 12:48:45,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 251 flow [2025-02-06 12:48:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-06 12:48:45,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2025-02-06 12:48:45,290 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 107 flow. Second operand 3 states and 84 transitions. [2025-02-06 12:48:45,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 251 flow [2025-02-06 12:48:45,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:45,291 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 128 flow [2025-02-06 12:48:45,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-02-06 12:48:45,292 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2025-02-06 12:48:45,292 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 128 flow [2025-02-06 12:48:45,292 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:45,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:45,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:45,299 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:48:45,492 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:48:45,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:45,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash 510746061, now seen corresponding path program 1 times [2025-02-06 12:48:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:45,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983271602] [2025-02-06 12:48:45,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:45,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:45,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:45,496 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:48:45,497 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:48:45,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:48:45,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:48:45,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:45,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:45,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:48:45,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:45,719 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:45,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:45,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983271602] [2025-02-06 12:48:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983271602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:45,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:48:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910678362] [2025-02-06 12:48:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:45,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:45,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:45,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:45,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:45,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 128 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:45,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:45,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:45,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:46,725 INFO L124 PetriNetUnfolderBase]: 8607/12169 cut-off events. [2025-02-06 12:48:46,725 INFO L125 PetriNetUnfolderBase]: For 1520/1527 co-relation queries the response was YES. [2025-02-06 12:48:46,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27862 conditions, 12169 events. 8607/12169 cut-off events. For 1520/1527 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 67156 event pairs, 875 based on Foata normal form. 0/11518 useless extension candidates. Maximal degree in co-relation 27851. Up to 10972 conditions per place. [2025-02-06 12:48:46,782 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 46 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-02-06 12:48:46,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 266 flow [2025-02-06 12:48:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:48:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:48:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 12:48:46,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22772277227722773 [2025-02-06 12:48:46,788 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 128 flow. Second operand 4 states and 92 transitions. [2025-02-06 12:48:46,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 266 flow [2025-02-06 12:48:46,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:46,790 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 124 flow [2025-02-06 12:48:46,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-02-06 12:48:46,791 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2025-02-06 12:48:46,791 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 124 flow [2025-02-06 12:48:46,791 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:48:46,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:46,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:46,800 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:48:46,995 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:48:46,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:46,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1765417878, now seen corresponding path program 1 times [2025-02-06 12:48:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222984055] [2025-02-06 12:48:46,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:46,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:46,999 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:48:46,999 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:48:47,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:48:47,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:48:47,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:47,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:47,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:48:47,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:47,195 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:47,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:47,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:47,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222984055] [2025-02-06 12:48:47,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222984055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:47,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:47,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:48:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131043897] [2025-02-06 12:48:47,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:47,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:47,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:47,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:47,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:47,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:47,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 124 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:47,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:47,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:47,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:47,919 INFO L124 PetriNetUnfolderBase]: 7877/11139 cut-off events. [2025-02-06 12:48:47,920 INFO L125 PetriNetUnfolderBase]: For 1490/1497 co-relation queries the response was YES. [2025-02-06 12:48:47,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25472 conditions, 11139 events. 7877/11139 cut-off events. For 1490/1497 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 60601 event pairs, 635 based on Foata normal form. 300/10788 useless extension candidates. Maximal degree in co-relation 25461. Up to 9942 conditions per place. [2025-02-06 12:48:47,966 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 45 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-02-06 12:48:47,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 260 flow [2025-02-06 12:48:47,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:48:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:48:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-06 12:48:47,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22524752475247525 [2025-02-06 12:48:47,968 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 124 flow. Second operand 4 states and 91 transitions. [2025-02-06 12:48:47,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 260 flow [2025-02-06 12:48:47,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 247 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:47,970 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 119 flow [2025-02-06 12:48:47,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-02-06 12:48:47,971 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2025-02-06 12:48:47,971 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 119 flow [2025-02-06 12:48:47,971 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:48:47,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:47,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:47,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:48:48,172 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:48:48,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:48,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:48,173 INFO L85 PathProgramCache]: Analyzing trace with hash -95224523, now seen corresponding path program 1 times [2025-02-06 12:48:48,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:48,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221803877] [2025-02-06 12:48:48,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:48,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:48,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:48,179 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:48:48,182 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:48:48,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:48:48,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:48:48,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:48,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:48,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:48:48,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:48,303 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:48,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:48,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221803877] [2025-02-06 12:48:48,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221803877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:48,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:48,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516189491] [2025-02-06 12:48:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:48,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:48,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:48,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:48,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:48,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 101 [2025-02-06 12:48:48,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 119 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:48,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:48,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 101 [2025-02-06 12:48:48,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:49,004 INFO L124 PetriNetUnfolderBase]: 7877/12003 cut-off events. [2025-02-06 12:48:49,004 INFO L125 PetriNetUnfolderBase]: For 1308/1315 co-relation queries the response was YES. [2025-02-06 12:48:49,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26335 conditions, 12003 events. 7877/12003 cut-off events. For 1308/1315 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 73606 event pairs, 7229 based on Foata normal form. 336/11688 useless extension candidates. Maximal degree in co-relation 26325. Up to 10986 conditions per place. [2025-02-06 12:48:49,051 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-06 12:48:49,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 183 flow [2025-02-06 12:48:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-06 12:48:49,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19801980198019803 [2025-02-06 12:48:49,052 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 119 flow. Second operand 3 states and 60 transitions. [2025-02-06 12:48:49,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 183 flow [2025-02-06 12:48:49,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:49,055 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 110 flow [2025-02-06 12:48:49,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-02-06 12:48:49,055 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2025-02-06 12:48:49,055 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 110 flow [2025-02-06 12:48:49,055 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:49,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:49,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:49,062 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:48:49,256 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:48:49,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:49,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash -95225059, now seen corresponding path program 1 times [2025-02-06 12:48:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700883080] [2025-02-06 12:48:49,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:49,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:49,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:49,260 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:48:49,261 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:48:49,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:48:49,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:48:49,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:49,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:49,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:48:49,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:49,407 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:49,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:49,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:49,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700883080] [2025-02-06 12:48:49,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700883080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:49,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:49,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:48:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113540597] [2025-02-06 12:48:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:49,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:49,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:49,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:49,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:49,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 110 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:48:49,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:49,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:49,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:50,029 INFO L124 PetriNetUnfolderBase]: 5901/9235 cut-off events. [2025-02-06 12:48:50,029 INFO L125 PetriNetUnfolderBase]: For 462/469 co-relation queries the response was YES. [2025-02-06 12:48:50,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20247 conditions, 9235 events. 5901/9235 cut-off events. For 462/469 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 57220 event pairs, 739 based on Foata normal form. 336/9064 useless extension candidates. Maximal degree in co-relation 20237. Up to 5149 conditions per place. [2025-02-06 12:48:50,065 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 67 selfloop transitions, 5 changer transitions 1/79 dead transitions. [2025-02-06 12:48:50,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 386 flow [2025-02-06 12:48:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:48:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:48:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-06 12:48:50,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2025-02-06 12:48:50,066 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 110 flow. Second operand 4 states and 112 transitions. [2025-02-06 12:48:50,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 386 flow [2025-02-06 12:48:50,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:50,068 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 143 flow [2025-02-06 12:48:50,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-02-06 12:48:50,068 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -26 predicate places. [2025-02-06 12:48:50,068 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 143 flow [2025-02-06 12:48:50,069 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:48:50,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:50,069 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:48:50,077 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:48:50,273 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:48:50,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:50,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash -268087630, now seen corresponding path program 1 times [2025-02-06 12:48:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:50,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244643887] [2025-02-06 12:48:50,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:50,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:50,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:50,276 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:48:50,277 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:48:50,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:48:50,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:48:50,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:50,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:50,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:48:50,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:50,414 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:50,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:50,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244643887] [2025-02-06 12:48:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244643887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:48:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143491626] [2025-02-06 12:48:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:50,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:48:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:50,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:48:50,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:48:50,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:50,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 143 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:48:50,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:50,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:50,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:50,902 INFO L124 PetriNetUnfolderBase]: 3325/5239 cut-off events. [2025-02-06 12:48:50,902 INFO L125 PetriNetUnfolderBase]: For 1274/1281 co-relation queries the response was YES. [2025-02-06 12:48:50,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 5239 events. 3325/5239 cut-off events. For 1274/1281 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 28525 event pairs, 445 based on Foata normal form. 248/5220 useless extension candidates. Maximal degree in co-relation 13025. Up to 1825 conditions per place. [2025-02-06 12:48:50,917 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 84 selfloop transitions, 8 changer transitions 1/99 dead transitions. [2025-02-06 12:48:50,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 99 transitions, 524 flow [2025-02-06 12:48:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:48:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:48:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-02-06 12:48:50,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28316831683168314 [2025-02-06 12:48:50,919 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 143 flow. Second operand 5 states and 143 transitions. [2025-02-06 12:48:50,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 99 transitions, 524 flow [2025-02-06 12:48:50,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 514 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:50,923 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 183 flow [2025-02-06 12:48:50,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2025-02-06 12:48:50,924 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2025-02-06 12:48:50,924 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 183 flow [2025-02-06 12:48:50,925 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:48:50,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:50,925 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:48:50,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:48:51,126 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:48:51,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:51,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash 241087496, now seen corresponding path program 1 times [2025-02-06 12:48:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:51,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385940382] [2025-02-06 12:48:51,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:51,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:51,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:51,130 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:48:51,131 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:48:51,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:48:51,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:48:51,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:51,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:51,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:48:51,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:51,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:48:51,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:51,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385940382] [2025-02-06 12:48:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385940382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:51,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252325778] [2025-02-06 12:48:51,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:51,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:51,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:51,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:51,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:51,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 183 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:48:51,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:51,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:51,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:51,649 INFO L124 PetriNetUnfolderBase]: 1923/2933 cut-off events. [2025-02-06 12:48:51,649 INFO L125 PetriNetUnfolderBase]: For 2040/2047 co-relation queries the response was YES. [2025-02-06 12:48:51,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8110 conditions, 2933 events. 1923/2933 cut-off events. For 2040/2047 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13779 event pairs, 389 based on Foata normal form. 100/2874 useless extension candidates. Maximal degree in co-relation 8095. Up to 1036 conditions per place. [2025-02-06 12:48:51,659 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 70 selfloop transitions, 11 changer transitions 1/88 dead transitions. [2025-02-06 12:48:51,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 485 flow [2025-02-06 12:48:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:48:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:48:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-02-06 12:48:51,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23432343234323433 [2025-02-06 12:48:51,661 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 183 flow. Second operand 6 states and 142 transitions. [2025-02-06 12:48:51,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 485 flow [2025-02-06 12:48:51,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 460 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:48:51,668 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 197 flow [2025-02-06 12:48:51,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2025-02-06 12:48:51,670 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2025-02-06 12:48:51,670 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 197 flow [2025-02-06 12:48:51,670 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:48:51,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:51,670 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:48:51,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:51,870 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:48:51,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:51,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1931923747, now seen corresponding path program 1 times [2025-02-06 12:48:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:51,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758236330] [2025-02-06 12:48:51,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:51,876 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:48:51,877 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:48:51,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:51,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:51,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:51,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:51,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:48:51,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:52,097 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:52,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:52,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:52,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758236330] [2025-02-06 12:48:52,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758236330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:52,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:52,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:48:52,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551951455] [2025-02-06 12:48:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:52,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:48:52,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:52,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:48:52,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:48:52,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:52,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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:52,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:52,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:52,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:52,622 INFO L124 PetriNetUnfolderBase]: 2789/4275 cut-off events. [2025-02-06 12:48:52,622 INFO L125 PetriNetUnfolderBase]: For 3384/3391 co-relation queries the response was YES. [2025-02-06 12:48:52,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11895 conditions, 4275 events. 2789/4275 cut-off events. For 3384/3391 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21324 event pairs, 619 based on Foata normal form. 16/4084 useless extension candidates. Maximal degree in co-relation 11879. Up to 1784 conditions per place. [2025-02-06 12:48:52,636 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 67 selfloop transitions, 7 changer transitions 28/108 dead transitions. [2025-02-06 12:48:52,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 108 transitions, 661 flow [2025-02-06 12:48:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:48:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:48:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2025-02-06 12:48:52,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22913719943422914 [2025-02-06 12:48:52,638 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 197 flow. Second operand 7 states and 162 transitions. [2025-02-06 12:48:52,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 108 transitions, 661 flow [2025-02-06 12:48:52,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 108 transitions, 544 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:48:52,651 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 198 flow [2025-02-06 12:48:52,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2025-02-06 12:48:52,652 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -16 predicate places. [2025-02-06 12:48:52,652 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 198 flow [2025-02-06 12:48:52,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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:52,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:52,652 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:48:52,660 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:48:52,853 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:48:52,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1562754981, now seen corresponding path program 2 times [2025-02-06 12:48:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:52,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757248229] [2025-02-06 12:48:52,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:48:52,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:52,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:52,856 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:48:52,857 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:48:52,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:52,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:52,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:48:52,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:52,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:48:52,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:53,050 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:53,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:53,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757248229] [2025-02-06 12:48:53,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757248229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:53,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:53,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:48:53,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745957312] [2025-02-06 12:48:53,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:53,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:48:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:53,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:48:53,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:48:53,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 101 [2025-02-06 12:48:53,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 198 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:48:53,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:53,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 101 [2025-02-06 12:48:53,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:53,390 INFO L124 PetriNetUnfolderBase]: 1671/2610 cut-off events. [2025-02-06 12:48:53,390 INFO L125 PetriNetUnfolderBase]: For 776/778 co-relation queries the response was YES. [2025-02-06 12:48:53,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6621 conditions, 2610 events. 1671/2610 cut-off events. For 776/778 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12024 event pairs, 351 based on Foata normal form. 16/2542 useless extension candidates. Maximal degree in co-relation 6604. Up to 1296 conditions per place. [2025-02-06 12:48:53,397 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 46 selfloop transitions, 3 changer transitions 40/95 dead transitions. [2025-02-06 12:48:53,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 95 transitions, 535 flow [2025-02-06 12:48:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:48:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:48:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-02-06 12:48:53,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2145214521452145 [2025-02-06 12:48:53,398 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 198 flow. Second operand 6 states and 130 transitions. [2025-02-06 12:48:53,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 95 transitions, 535 flow [2025-02-06 12:48:53,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 521 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:53,401 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 160 flow [2025-02-06 12:48:53,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2025-02-06 12:48:53,402 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -13 predicate places. [2025-02-06 12:48:53,402 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 160 flow [2025-02-06 12:48:53,402 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:48:53,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:53,402 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:48:53,411 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:48:53,602 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:48:53,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err4ASSERT_VIOLATIONMEMORY_LEAK, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-02-06 12:48:53,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -868684915, now seen corresponding path program 3 times [2025-02-06 12:48:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:53,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316932479] [2025-02-06 12:48:53,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:48:53,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:53,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:53,605 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:48:53,607 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:48:53,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:53,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:53,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:48:53,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:48:53,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:48:53,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:53,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:53,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:53,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:48:53,836 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:48:53,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:48:53,837 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2025-02-06 12:48:53,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (59 of 61 remaining) [2025-02-06 12:48:53,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2025-02-06 12:48:53,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2025-02-06 12:48:53,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (24 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2025-02-06 12:48:53,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2025-02-06 12:48:53,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2025-02-06 12:48:53,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2025-02-06 12:48:53,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2025-02-06 12:48:53,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2025-02-06 12:48:53,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2025-02-06 12:48:53,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2025-02-06 12:48:53,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:54,043 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:48:54,043 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:54,101 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:48:54,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:48:54,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:48:54 BasicIcfg [2025-02-06 12:48:54,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:48:54,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:48:54,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:48:54,107 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:48:54,108 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:30" (3/4) ... [2025-02-06 12:48:54,109 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:48:54,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:48:54,112 INFO L158 Benchmark]: Toolchain (without parser) took 25278.22ms. Allocated memory was 83.9MB in the beginning and 5.7GB in the end (delta: 5.7GB). Free memory was 56.0MB in the beginning and 4.3GB in the end (delta: -4.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-02-06 12:48:54,112 INFO L158 Benchmark]: CDTParser took 1.93ms. Allocated memory is still 83.9MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:54,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.65ms. Allocated memory is still 83.9MB. Free memory was 55.8MB in the beginning and 31.4MB in the end (delta: 24.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:48:54,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.13ms. Allocated memory is still 83.9MB. Free memory was 31.4MB in the beginning and 28.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:54,112 INFO L158 Benchmark]: Boogie Preprocessor took 62.25ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 28.8MB in the beginning and 96.9MB in the end (delta: -68.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2025-02-06 12:48:54,113 INFO L158 Benchmark]: IcfgBuilder took 1088.39ms. Allocated memory is still 125.8MB. Free memory was 96.9MB in the beginning and 35.9MB in the end (delta: 61.0MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2025-02-06 12:48:54,113 INFO L158 Benchmark]: TraceAbstraction took 23495.44ms. Allocated memory was 125.8MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 35.9MB in the beginning and 4.3GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-02-06 12:48:54,113 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 5.7GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 371.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:54,114 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.93ms. Allocated memory is still 83.9MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.65ms. Allocated memory is still 83.9MB. Free memory was 55.8MB in the beginning and 31.4MB in the end (delta: 24.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.13ms. Allocated memory is still 83.9MB. Free memory was 31.4MB in the beginning and 28.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.25ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 28.8MB in the beginning and 96.9MB in the end (delta: -68.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1088.39ms. Allocated memory is still 125.8MB. Free memory was 96.9MB in the beginning and 35.9MB in the end (delta: 61.0MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23495.44ms. Allocated memory was 125.8MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 35.9MB in the beginning and 4.3GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 5.7GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 371.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-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}, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-2, t1941=-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}, z=0] [L854] 0 pthread_t t1942; [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-2, t1941=-1, t1942=0, 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}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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}, z=0] [L825] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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}, z=1] [L828] 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) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] 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) [L828] 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) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=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}, z=1] [L765] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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}, z=1] [L777] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$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}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-2, t1941=-1, t1942=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-2, t1941=-1, t1942=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1940=-2, t1941=-1, t1942=0, weak$$choice0=1, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe007_power.opt-thin001_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: 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: -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: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 855]: 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, 122 locations, 61 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: 23.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1258 IncrementalHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 5 mSDtfsCounter, 1258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=0, InterpolantAutomatonStates: 51, 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.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 920 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1507 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:48:54,145 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