./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix004.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix004.oepc.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 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:41:30,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:41:30,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:41:30,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:41:30,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:41:30,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:41:30,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:41:30,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:41:30,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:41:30,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:41:30,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:41:30,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:41:30,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:41:30,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:41:30,777 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:41:30,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:30,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:41:30,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:30,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:41:30,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:41:30,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:41:30,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:41:30,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:41:30,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:41:30,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:41:30,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:41:30,779 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 -> 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 [2025-01-10 00:41:31,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:41:31,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:41:31,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:41:31,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:41:31,026 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:41:31,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2025-01-10 00:41:32,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d20168aad/26fcb294342743c5ace0440438e52c2a/FLAGa90770c1b [2025-01-10 00:41:32,647 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:41:32,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2025-01-10 00:41:32,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d20168aad/26fcb294342743c5ace0440438e52c2a/FLAGa90770c1b [2025-01-10 00:41:32,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d20168aad/26fcb294342743c5ace0440438e52c2a [2025-01-10 00:41:32,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:41:32,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:41:32,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:41:32,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:41:32,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:41:32,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:41:32" (1/1) ... [2025-01-10 00:41:32,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd58d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:32, skipping insertion in model container [2025-01-10 00:41:32,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:41:32" (1/1) ... [2025-01-10 00:41:32,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:41:33,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:41:33,178 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:41:33,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:41:33,249 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:41:33,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33 WrapperNode [2025-01-10 00:41:33,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:41:33,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:41:33,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:41:33,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:41:33,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,293 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2025-01-10 00:41:33,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:41:33,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:41:33,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:41:33,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:41:33,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,323 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:41:33,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:41:33,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:41:33,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:41:33,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:41:33,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (1/1) ... [2025-01-10 00:41:33,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:33,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:41:33,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:41:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:41:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:41:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:41:33,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:41:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:41:33,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:41:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:41:33,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:41:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:41:33,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:41:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:41:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:41:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:41:33,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:41:33,410 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:41:33,505 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:41:33,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:41:33,817 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:41:33,817 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:41:34,002 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:41:34,002 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:41:34,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:34 BoogieIcfgContainer [2025-01-10 00:41:34,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:41:34,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:41:34,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:41:34,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:41:34,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:41:32" (1/3) ... [2025-01-10 00:41:34,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665cb297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:41:34, skipping insertion in model container [2025-01-10 00:41:34,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:33" (2/3) ... [2025-01-10 00:41:34,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665cb297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:41:34, skipping insertion in model container [2025-01-10 00:41:34,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:34" (3/3) ... [2025-01-10 00:41:34,021 INFO L128 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2025-01-10 00:41:34,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:41:34,047 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix004.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:41:34,047 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:41:34,094 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:34,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:41:34,143 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-10 00:41:34,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:34,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 113 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-01-10 00:41:34,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:41:34,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-01-10 00:41:34,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:34,160 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;@4449f7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:34,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:41:34,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:34,163 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:41:34,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:34,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:34,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:41:34,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:34,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash 13042583, now seen corresponding path program 1 times [2025-01-10 00:41:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122147245] [2025-01-10 00:41:34,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:34,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:41:34,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:41:34,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:34,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:34,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:34,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122147245] [2025-01-10 00:41:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122147245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:41:34,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487219688] [2025-01-10 00:41:34,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:34,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:34,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:34,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:34,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:34,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-01-10 00:41:34,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-01-10 00:41:34,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:34,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-01-10 00:41:34,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:35,502 INFO L124 PetriNetUnfolderBase]: 3311/5200 cut-off events. [2025-01-10 00:41:35,503 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-10 00:41:35,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9880 conditions, 5200 events. 3311/5200 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 33762 event pairs, 2177 based on Foata normal form. 288/5440 useless extension candidates. Maximal degree in co-relation 9868. Up to 3661 conditions per place. [2025-01-10 00:41:35,537 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 41 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2025-01-10 00:41:35,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 245 flow [2025-01-10 00:41:35,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 00:41:35,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2025-01-10 00:41:35,549 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 128 transitions. [2025-01-10 00:41:35,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 245 flow [2025-01-10 00:41:35,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:41:35,557 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-01-10 00:41:35,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-01-10 00:41:35,563 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-01-10 00:41:35,563 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-01-10 00:41:35,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-01-10 00:41:35,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:35,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:35,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:41:35,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:35,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1369910695, now seen corresponding path program 1 times [2025-01-10 00:41:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:35,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333559623] [2025-01-10 00:41:35,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:35,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:41:35,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:41:35,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:35,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:35,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333559623] [2025-01-10 00:41:35,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333559623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:35,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:35,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:41:35,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968821632] [2025-01-10 00:41:35,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:35,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:35,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:35,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:35,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:35,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-01-10 00:41:35,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:35,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:35,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-01-10 00:41:35,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:36,143 INFO L124 PetriNetUnfolderBase]: 2903/4923 cut-off events. [2025-01-10 00:41:36,143 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2025-01-10 00:41:36,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 4923 events. 2903/4923 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 35381 event pairs, 2903 based on Foata normal form. 144/4896 useless extension candidates. Maximal degree in co-relation 9317. Up to 4016 conditions per place. [2025-01-10 00:41:36,166 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 22 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-01-10 00:41:36,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 150 flow [2025-01-10 00:41:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 00:41:36,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-01-10 00:41:36,167 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 100 transitions. [2025-01-10 00:41:36,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 150 flow [2025-01-10 00:41:36,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:36,169 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-01-10 00:41:36,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:41:36,169 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 00:41:36,169 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-01-10 00:41:36,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:36,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:36,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:36,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:41:36,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1369909346, now seen corresponding path program 1 times [2025-01-10 00:41:36,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:36,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225336947] [2025-01-10 00:41:36,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:36,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:41:36,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:41:36,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:36,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:36,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:36,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225336947] [2025-01-10 00:41:36,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225336947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:36,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:36,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:41:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256393319] [2025-01-10 00:41:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:36,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:41:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:36,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:41:36,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:41:36,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:41:36,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:36,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:36,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:41:36,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:37,705 INFO L124 PetriNetUnfolderBase]: 8875/13633 cut-off events. [2025-01-10 00:41:37,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:37,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25955 conditions, 13633 events. 8875/13633 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 97236 event pairs, 1033 based on Foata normal form. 400/13832 useless extension candidates. Maximal degree in co-relation 25949. Up to 7301 conditions per place. [2025-01-10 00:41:37,772 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 53 selfloop transitions, 6 changer transitions 1/76 dead transitions. [2025-01-10 00:41:37,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 288 flow [2025-01-10 00:41:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:41:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:41:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-01-10 00:41:37,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2025-01-10 00:41:37,775 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 146 transitions. [2025-01-10 00:41:37,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 288 flow [2025-01-10 00:41:37,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:41:37,777 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2025-01-10 00:41:37,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-01-10 00:41:37,778 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-01-10 00:41:37,778 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2025-01-10 00:41:37,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:37,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:37,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:37,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:41:37,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:37,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1662179871, now seen corresponding path program 1 times [2025-01-10 00:41:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134976143] [2025-01-10 00:41:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:37,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:41:37,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:41:37,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:38,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134976143] [2025-01-10 00:41:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134976143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:38,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:38,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:41:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601748592] [2025-01-10 00:41:38,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:38,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:41:38,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:38,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:41:38,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:41:38,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:41:38,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:38,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:38,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:41:38,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:38,915 INFO L124 PetriNetUnfolderBase]: 6751/10393 cut-off events. [2025-01-10 00:41:38,915 INFO L125 PetriNetUnfolderBase]: For 2428/2428 co-relation queries the response was YES. [2025-01-10 00:41:38,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23250 conditions, 10393 events. 6751/10393 cut-off events. For 2428/2428 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 69821 event pairs, 451 based on Foata normal form. 364/10586 useless extension candidates. Maximal degree in co-relation 23241. Up to 4601 conditions per place. [2025-01-10 00:41:38,963 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 68 selfloop transitions, 10 changer transitions 1/95 dead transitions. [2025-01-10 00:41:38,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 420 flow [2025-01-10 00:41:38,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:41:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:41:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2025-01-10 00:41:38,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6763636363636364 [2025-01-10 00:41:38,965 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 186 transitions. [2025-01-10 00:41:38,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 420 flow [2025-01-10 00:41:38,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 409 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:38,969 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2025-01-10 00:41:38,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2025-01-10 00:41:38,970 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-01-10 00:41:38,970 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2025-01-10 00:41:38,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:38,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:38,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:38,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:41:38,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:38,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash 923889631, now seen corresponding path program 1 times [2025-01-10 00:41:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686419337] [2025-01-10 00:41:38,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:38,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:41:39,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:41:39,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:39,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:39,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686419337] [2025-01-10 00:41:39,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686419337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:39,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:39,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:41:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942759515] [2025-01-10 00:41:39,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:39,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:41:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:39,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:41:39,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:41:39,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:41:39,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:39,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:39,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:41:39,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:40,019 INFO L124 PetriNetUnfolderBase]: 4259/6449 cut-off events. [2025-01-10 00:41:40,019 INFO L125 PetriNetUnfolderBase]: For 4750/4750 co-relation queries the response was YES. [2025-01-10 00:41:40,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16292 conditions, 6449 events. 4259/6449 cut-off events. For 4750/4750 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 37649 event pairs, 289 based on Foata normal form. 244/6539 useless extension candidates. Maximal degree in co-relation 16281. Up to 1788 conditions per place. [2025-01-10 00:41:40,053 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 81 selfloop transitions, 14 changer transitions 1/112 dead transitions. [2025-01-10 00:41:40,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 112 transitions, 551 flow [2025-01-10 00:41:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:41:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:41:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2025-01-10 00:41:40,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2025-01-10 00:41:40,055 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 224 transitions. [2025-01-10 00:41:40,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 112 transitions, 551 flow [2025-01-10 00:41:40,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 112 transitions, 521 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:41:40,068 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2025-01-10 00:41:40,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-01-10 00:41:40,068 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-01-10 00:41:40,068 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2025-01-10 00:41:40,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:40,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:40,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:41:40,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:40,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2041398584, now seen corresponding path program 1 times [2025-01-10 00:41:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:40,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51418185] [2025-01-10 00:41:40,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:40,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:41:40,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:41:40,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:40,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51418185] [2025-01-10 00:41:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51418185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:41:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951887855] [2025-01-10 00:41:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:40,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:41:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:40,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:41:40,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:41:40,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:41:40,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:40,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:40,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:41:40,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:40,788 INFO L124 PetriNetUnfolderBase]: 2895/4217 cut-off events. [2025-01-10 00:41:40,788 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2025-01-10 00:41:40,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11693 conditions, 4217 events. 2895/4217 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22019 event pairs, 231 based on Foata normal form. 96/4159 useless extension candidates. Maximal degree in co-relation 11681. Up to 1316 conditions per place. [2025-01-10 00:41:40,806 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 72 selfloop transitions, 18 changer transitions 1/107 dead transitions. [2025-01-10 00:41:40,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 541 flow [2025-01-10 00:41:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:41:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:41:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2025-01-10 00:41:40,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2025-01-10 00:41:40,808 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 240 transitions. [2025-01-10 00:41:40,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 541 flow [2025-01-10 00:41:40,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 495 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 00:41:40,829 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2025-01-10 00:41:40,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-01-10 00:41:40,830 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-01-10 00:41:40,830 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2025-01-10 00:41:40,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:40,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:40,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:40,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:41:40,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1145117059, now seen corresponding path program 1 times [2025-01-10 00:41:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227119145] [2025-01-10 00:41:40,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:40,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:41:40,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:41:40,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:40,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:42,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227119145] [2025-01-10 00:41:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227119145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:42,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:41:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854732583] [2025-01-10 00:41:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:42,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:41:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:42,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:41:42,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:41:42,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-01-10 00:41:42,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:42,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:42,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-01-10 00:41:42,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:42,791 INFO L124 PetriNetUnfolderBase]: 3190/5207 cut-off events. [2025-01-10 00:41:42,791 INFO L125 PetriNetUnfolderBase]: For 3420/3598 co-relation queries the response was YES. [2025-01-10 00:41:42,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12989 conditions, 5207 events. 3190/5207 cut-off events. For 3420/3598 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 34472 event pairs, 1013 based on Foata normal form. 16/4937 useless extension candidates. Maximal degree in co-relation 12976. Up to 1905 conditions per place. [2025-01-10 00:41:42,819 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 65 selfloop transitions, 8 changer transitions 16/121 dead transitions. [2025-01-10 00:41:42,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 595 flow [2025-01-10 00:41:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:41:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:41:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 315 transitions. [2025-01-10 00:41:42,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 00:41:42,822 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 9 states and 315 transitions. [2025-01-10 00:41:42,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 595 flow [2025-01-10 00:41:42,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 121 transitions, 479 flow, removed 27 selfloop flow, removed 10 redundant places. [2025-01-10 00:41:42,849 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 218 flow [2025-01-10 00:41:42,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2025-01-10 00:41:42,850 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2025-01-10 00:41:42,850 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 218 flow [2025-01-10 00:41:42,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:42,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:42,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:42,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:41:42,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:42,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash -876357435, now seen corresponding path program 2 times [2025-01-10 00:41:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:42,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848931596] [2025-01-10 00:41:42,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:41:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:42,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:41:42,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:41:42,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:41:42,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:43,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:43,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848931596] [2025-01-10 00:41:43,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848931596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:43,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:43,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:41:43,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831097272] [2025-01-10 00:41:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:43,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:41:43,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:43,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:41:43,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:41:43,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2025-01-10 00:41:43,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:43,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:43,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2025-01-10 00:41:43,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:44,734 INFO L124 PetriNetUnfolderBase]: 15588/23558 cut-off events. [2025-01-10 00:41:44,734 INFO L125 PetriNetUnfolderBase]: For 5330/5330 co-relation queries the response was YES. [2025-01-10 00:41:44,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53904 conditions, 23558 events. 15588/23558 cut-off events. For 5330/5330 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 169797 event pairs, 1507 based on Foata normal form. 16/22568 useless extension candidates. Maximal degree in co-relation 53889. Up to 10054 conditions per place. [2025-01-10 00:41:44,836 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 80 selfloop transitions, 11 changer transitions 21/138 dead transitions. [2025-01-10 00:41:44,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 684 flow [2025-01-10 00:41:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:41:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:41:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 246 transitions. [2025-01-10 00:41:44,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2025-01-10 00:41:44,838 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 218 flow. Second operand 8 states and 246 transitions. [2025-01-10 00:41:44,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 684 flow [2025-01-10 00:41:44,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 138 transitions, 663 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:41:44,848 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 271 flow [2025-01-10 00:41:44,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=271, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2025-01-10 00:41:44,848 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2025-01-10 00:41:44,848 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 271 flow [2025-01-10 00:41:44,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:44,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:44,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:44,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:41:44,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:44,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2009667651, now seen corresponding path program 3 times [2025-01-10 00:41:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230717820] [2025-01-10 00:41:44,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:41:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:44,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:41:44,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:41:44,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:41:44,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:45,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230717820] [2025-01-10 00:41:45,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230717820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:45,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:45,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:41:45,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876740126] [2025-01-10 00:41:45,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:45,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:41:45,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:45,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:41:45,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:41:45,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2025-01-10 00:41:45,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:45,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:45,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2025-01-10 00:41:45,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:47,936 INFO L124 PetriNetUnfolderBase]: 20844/31849 cut-off events. [2025-01-10 00:41:47,936 INFO L125 PetriNetUnfolderBase]: For 16264/16280 co-relation queries the response was YES. [2025-01-10 00:41:48,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79941 conditions, 31849 events. 20844/31849 cut-off events. For 16264/16280 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 240559 event pairs, 2361 based on Foata normal form. 31/30607 useless extension candidates. Maximal degree in co-relation 79923. Up to 15650 conditions per place. [2025-01-10 00:41:48,112 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 71 selfloop transitions, 14 changer transitions 22/134 dead transitions. [2025-01-10 00:41:48,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 134 transitions, 715 flow [2025-01-10 00:41:48,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:41:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:41:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2025-01-10 00:41:48,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2025-01-10 00:41:48,113 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 271 flow. Second operand 7 states and 215 transitions. [2025-01-10 00:41:48,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 134 transitions, 715 flow [2025-01-10 00:41:48,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 705 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 00:41:48,131 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 342 flow [2025-01-10 00:41:48,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2025-01-10 00:41:48,136 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 21 predicate places. [2025-01-10 00:41:48,136 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 342 flow [2025-01-10 00:41:48,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:48,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:48,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:48,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:41:48,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:48,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1572263481, now seen corresponding path program 4 times [2025-01-10 00:41:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988200090] [2025-01-10 00:41:48,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:41:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:48,157 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-01-10 00:41:48,408 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:41:48,412 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:41:48,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:48,413 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:41:48,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:41:48,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:41:48,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:48,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:48,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:41:48,578 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:41:48,578 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:41:48,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:41:48,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:41:48,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:41:48,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:41:48,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:41:48,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:41:48,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:41:48,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:41:48,585 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:48,686 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:41:48,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:41:48,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:41:48 BasicIcfg [2025-01-10 00:41:48,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:41:48,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:41:48,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:41:48,693 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:41:48,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:34" (3/4) ... [2025-01-10 00:41:48,694 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:41:48,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:41:48,696 INFO L158 Benchmark]: Toolchain (without parser) took 15803.12ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 110.3MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 483.7MB. Max. memory is 16.1GB. [2025-01-10 00:41:48,696 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:41:48,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.02ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 85.5MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:41:48,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.96ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:41:48,697 INFO L158 Benchmark]: Boogie Preprocessor took 50.08ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 80.0MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:41:48,697 INFO L158 Benchmark]: RCFGBuilder took 661.82ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 91.4MB in the end (delta: -11.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-01-10 00:41:48,697 INFO L158 Benchmark]: TraceAbstraction took 14685.05ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 90.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 452.7MB. Max. memory is 16.1GB. [2025-01-10 00:41:48,697 INFO L158 Benchmark]: Witness Printer took 2.22ms. Allocated memory is still 2.5GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 117.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:41:48,698 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.02ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 85.5MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.96ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.08ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 80.0MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 661.82ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 91.4MB in the end (delta: -11.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14685.05ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 90.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 452.7MB. Max. memory is 16.1GB. * Witness Printer took 2.22ms. Allocated memory is still 2.5GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 117.1kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t89=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t90; [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t89=-2, t90=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t91; [L878] FCALL, FORK 0 pthread_create(&t91, ((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=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t89=-2, t90=-1, t91=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t92; [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t89=-2, t90=-1, t91=0, t92=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89=-2, t90=-1, t91=0, t92=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89=-2, t90=-1, t91=0, t92=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89=-2, t90=-1, t91=0, t92=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L895] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix004.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 874]: 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: 878]: 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: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 630 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1459 IncrementalHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 13 mSDtfsCounter, 1459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=9, InterpolantAutomatonStates: 52, 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.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 1388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-01-10 00:41:48,722 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/mix004.oepc.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 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:41:51,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:41:51,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:41:51,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:41:51,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:41:51,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:41:51,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:41:51,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:41:51,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:41:51,109 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:41:51,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:41:51,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:41:51,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:41:51,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:41:51,109 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:41:51,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:41:51,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:41:51,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:41:51,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:41:51,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:41:51,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:41:51,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:41:51,112 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:41:51,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:41:51,112 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:41:51,113 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:41:51,113 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:41:51,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:41:51,113 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:41:51,113 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:41:51,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:41:51,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:41:51,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:41:51,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:41:51,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:41:51,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:51,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:41:51,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:41:51,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:51,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:41:51,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:41:51,115 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 -> 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 [2025-01-10 00:41:51,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:41:51,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:41:51,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:41:51,392 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:41:51,393 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:41:51,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2025-01-10 00:41:52,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a14fca01/c8379854b58540fcb6288f09a59f1d30/FLAG943f0b331 [2025-01-10 00:41:53,020 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:41:53,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2025-01-10 00:41:53,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a14fca01/c8379854b58540fcb6288f09a59f1d30/FLAG943f0b331 [2025-01-10 00:41:53,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a14fca01/c8379854b58540fcb6288f09a59f1d30 [2025-01-10 00:41:53,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:41:53,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:41:53,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:41:53,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:41:53,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:41:53,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242c1b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53, skipping insertion in model container [2025-01-10 00:41:53,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:41:53,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:41:53,574 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:41:53,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:41:53,662 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:41:53,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53 WrapperNode [2025-01-10 00:41:53,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:41:53,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:41:53,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:41:53,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:41:53,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,713 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2025-01-10 00:41:53,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:41:53,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:41:53,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:41:53,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:41:53,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,750 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:41:53,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:41:53,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:41:53,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:41:53,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:41:53,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (1/1) ... [2025-01-10 00:41:53,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:41:53,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:53,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:41:53,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:41:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:41:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:41:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:41:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:41:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:41:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:41:53,876 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:41:54,022 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:41:54,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:41:54,304 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:41:54,304 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:41:54,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:41:54,492 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:41:54,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:54 BoogieIcfgContainer [2025-01-10 00:41:54,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:41:54,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:41:54,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:41:54,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:41:54,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:41:53" (1/3) ... [2025-01-10 00:41:54,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193ae02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:41:54, skipping insertion in model container [2025-01-10 00:41:54,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:41:53" (2/3) ... [2025-01-10 00:41:54,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193ae02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:41:54, skipping insertion in model container [2025-01-10 00:41:54,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:54" (3/3) ... [2025-01-10 00:41:54,501 INFO L128 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2025-01-10 00:41:54,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:41:54,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix004.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:41:54,513 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:41:54,565 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:54,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:41:54,623 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-10 00:41:54,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:54,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-01-10 00:41:54,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:41:54,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-01-10 00:41:54,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:54,647 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;@3681bb0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:54,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:41:54,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:54,654 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 00:41:54,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:54,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:54,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:41:54,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:54,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash 13106073, now seen corresponding path program 1 times [2025-01-10 00:41:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:41:54,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146329240] [2025-01-10 00:41:54,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:54,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:41:54,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:54,668 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-01-10 00:41:54,670 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-01-10 00:41:54,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:41:54,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:41:54,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:54,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:54,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:41:54,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:41:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:54,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:41:54,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:41:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146329240] [2025-01-10 00:41:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146329240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:54,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:54,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:41:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293085356] [2025-01-10 00:41:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:54,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:41:54,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:54,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:54,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-01-10 00:41:54,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-01-10 00:41:54,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:54,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-01-10 00:41:54,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:55,642 INFO L124 PetriNetUnfolderBase]: 3311/5200 cut-off events. [2025-01-10 00:41:55,643 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-10 00:41:55,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9880 conditions, 5200 events. 3311/5200 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 33844 event pairs, 2177 based on Foata normal form. 288/5441 useless extension candidates. Maximal degree in co-relation 9868. Up to 3661 conditions per place. [2025-01-10 00:41:55,683 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 41 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2025-01-10 00:41:55,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 245 flow [2025-01-10 00:41:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 00:41:55,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2025-01-10 00:41:55,695 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 128 transitions. [2025-01-10 00:41:55,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 245 flow [2025-01-10 00:41:55,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:41:55,704 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-01-10 00:41:55,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-01-10 00:41:55,709 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-01-10 00:41:55,710 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-01-10 00:41:55,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-01-10 00:41:55,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:55,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:55,720 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-01-10 00:41:55,915 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-01-10 00:41:55,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:55,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash 804200795, now seen corresponding path program 1 times [2025-01-10 00:41:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:41:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041602820] [2025-01-10 00:41:55,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:55,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:41:55,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:55,922 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-01-10 00:41:55,923 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-01-10 00:41:56,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:41:56,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:41:56,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:56,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:56,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:41:56,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:41:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:56,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:41:56,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:41:56,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041602820] [2025-01-10 00:41:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041602820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:56,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:56,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:41:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758987623] [2025-01-10 00:41:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:56,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:56,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:41:56,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:56,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:56,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-01-10 00:41:56,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:56,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:56,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-01-10 00:41:56,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:56,559 INFO L124 PetriNetUnfolderBase]: 2903/4923 cut-off events. [2025-01-10 00:41:56,560 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2025-01-10 00:41:56,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 4923 events. 2903/4923 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 35289 event pairs, 2903 based on Foata normal form. 144/4897 useless extension candidates. Maximal degree in co-relation 9317. Up to 4016 conditions per place. [2025-01-10 00:41:56,584 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 22 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-01-10 00:41:56,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 150 flow [2025-01-10 00:41:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 00:41:56,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-01-10 00:41:56,586 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 100 transitions. [2025-01-10 00:41:56,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 150 flow [2025-01-10 00:41:56,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:56,587 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-01-10 00:41:56,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:41:56,588 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 00:41:56,588 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-01-10 00:41:56,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:56,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:56,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:56,596 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-01-10 00:41:56,792 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-01-10 00:41:56,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:56,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 804202144, now seen corresponding path program 1 times [2025-01-10 00:41:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:41:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483380657] [2025-01-10 00:41:56,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:41:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:56,797 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-01-10 00:41:56,797 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-01-10 00:41:56,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:41:56,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:41:56,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:56,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:56,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:41:56,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:41:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:56,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:41:56,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:41:56,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483380657] [2025-01-10 00:41:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483380657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:56,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:41:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450402758] [2025-01-10 00:41:56,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:41:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:41:56,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:41:56,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:41:56,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:41:56,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:56,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:56,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:41:56,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:58,293 INFO L124 PetriNetUnfolderBase]: 8875/13633 cut-off events. [2025-01-10 00:41:58,293 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:58,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25955 conditions, 13633 events. 8875/13633 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 96936 event pairs, 1033 based on Foata normal form. 400/13860 useless extension candidates. Maximal degree in co-relation 25949. Up to 7301 conditions per place. [2025-01-10 00:41:58,378 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 53 selfloop transitions, 6 changer transitions 1/76 dead transitions. [2025-01-10 00:41:58,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 288 flow [2025-01-10 00:41:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:41:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:41:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-01-10 00:41:58,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2025-01-10 00:41:58,380 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 146 transitions. [2025-01-10 00:41:58,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 288 flow [2025-01-10 00:41:58,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:41:58,382 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2025-01-10 00:41:58,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-01-10 00:41:58,383 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-01-10 00:41:58,383 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2025-01-10 00:41:58,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:58,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:58,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:58,394 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-01-10 00:41:58,587 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-01-10 00:41:58,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:58,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash 486173407, now seen corresponding path program 1 times [2025-01-10 00:41:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:41:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769060051] [2025-01-10 00:41:58,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:58,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:41:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:58,594 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-01-10 00:41:58,596 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-01-10 00:41:58,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:41:58,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:41:58,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:58,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:58,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:41:58,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:41:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:58,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:41:58,730 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:41:58,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769060051] [2025-01-10 00:41:58,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769060051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:58,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:58,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:41:58,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287917885] [2025-01-10 00:41:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:58,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:41:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:41:58,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:41:58,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:41:58,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:41:58,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:58,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:58,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:41:58,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:59,599 INFO L124 PetriNetUnfolderBase]: 6751/10393 cut-off events. [2025-01-10 00:41:59,600 INFO L125 PetriNetUnfolderBase]: For 2428/2428 co-relation queries the response was YES. [2025-01-10 00:41:59,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23250 conditions, 10393 events. 6751/10393 cut-off events. For 2428/2428 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 69692 event pairs, 451 based on Foata normal form. 364/10604 useless extension candidates. Maximal degree in co-relation 23241. Up to 4601 conditions per place. [2025-01-10 00:41:59,651 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 68 selfloop transitions, 10 changer transitions 1/95 dead transitions. [2025-01-10 00:41:59,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 420 flow [2025-01-10 00:41:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:41:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:41:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2025-01-10 00:41:59,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6763636363636364 [2025-01-10 00:41:59,655 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 186 transitions. [2025-01-10 00:41:59,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 420 flow [2025-01-10 00:41:59,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 409 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:41:59,660 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2025-01-10 00:41:59,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2025-01-10 00:41:59,661 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-01-10 00:41:59,662 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2025-01-10 00:41:59,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:59,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:59,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:59,670 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-01-10 00:41:59,862 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-01-10 00:41:59,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:41:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash 865835169, now seen corresponding path program 1 times [2025-01-10 00:41:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:41:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070462440] [2025-01-10 00:41:59,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:59,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:41:59,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:41:59,868 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-01-10 00:41:59,873 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-01-10 00:41:59,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:41:59,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:41:59,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:59,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:59,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:41:59,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:00,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:00,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:00,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070462440] [2025-01-10 00:42:00,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070462440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:00,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:00,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388371306] [2025-01-10 00:42:00,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:00,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:00,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:00,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:00,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:42:00,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:00,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:00,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:42:00,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:00,529 INFO L124 PetriNetUnfolderBase]: 4259/6449 cut-off events. [2025-01-10 00:42:00,529 INFO L125 PetriNetUnfolderBase]: For 4750/4750 co-relation queries the response was YES. [2025-01-10 00:42:00,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16292 conditions, 6449 events. 4259/6449 cut-off events. For 4750/4750 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 37717 event pairs, 289 based on Foata normal form. 244/6551 useless extension candidates. Maximal degree in co-relation 16281. Up to 1788 conditions per place. [2025-01-10 00:42:00,555 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 81 selfloop transitions, 14 changer transitions 1/112 dead transitions. [2025-01-10 00:42:00,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 112 transitions, 551 flow [2025-01-10 00:42:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:42:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:42:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2025-01-10 00:42:00,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2025-01-10 00:42:00,557 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 224 transitions. [2025-01-10 00:42:00,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 112 transitions, 551 flow [2025-01-10 00:42:00,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 112 transitions, 521 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:00,575 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2025-01-10 00:42:00,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-01-10 00:42:00,578 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-01-10 00:42:00,578 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2025-01-10 00:42:00,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:00,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:00,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:00,585 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-01-10 00:42:00,778 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-01-10 00:42:00,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:00,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -629087346, now seen corresponding path program 1 times [2025-01-10 00:42:00,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:00,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535374828] [2025-01-10 00:42:00,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:00,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:00,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:00,783 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-01-10 00:42:00,785 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-01-10 00:42:00,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:42:00,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:42:00,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:00,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:00,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:42:00,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:00,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:00,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535374828] [2025-01-10 00:42:00,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535374828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:00,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:00,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565128334] [2025-01-10 00:42:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:00,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:42:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:00,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:42:00,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:42:00,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:42:00,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:00,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:00,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:42:00,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:01,674 INFO L124 PetriNetUnfolderBase]: 2895/4217 cut-off events. [2025-01-10 00:42:01,674 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2025-01-10 00:42:01,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11693 conditions, 4217 events. 2895/4217 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22036 event pairs, 231 based on Foata normal form. 96/4171 useless extension candidates. Maximal degree in co-relation 11681. Up to 1316 conditions per place. [2025-01-10 00:42:01,700 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 72 selfloop transitions, 18 changer transitions 1/107 dead transitions. [2025-01-10 00:42:01,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 541 flow [2025-01-10 00:42:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2025-01-10 00:42:01,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2025-01-10 00:42:01,702 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 240 transitions. [2025-01-10 00:42:01,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 541 flow [2025-01-10 00:42:01,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 495 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:01,730 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2025-01-10 00:42:01,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-01-10 00:42:01,732 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-01-10 00:42:01,732 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2025-01-10 00:42:01,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:01,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:01,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:01,742 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-01-10 00:42:01,933 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-01-10 00:42:01,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 617211529, now seen corresponding path program 1 times [2025-01-10 00:42:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154557376] [2025-01-10 00:42:01,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:01,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:01,937 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-01-10 00:42:01,939 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-01-10 00:42:01,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:02,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:02,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 00:42:02,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:02,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:02,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154557376] [2025-01-10 00:42:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154557376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:42:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271900753] [2025-01-10 00:42:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:02,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:42:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:02,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:42:02,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:42:02,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2025-01-10 00:42:02,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 11 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:02,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:02,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2025-01-10 00:42:02,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:03,262 INFO L124 PetriNetUnfolderBase]: 2145/3560 cut-off events. [2025-01-10 00:42:03,262 INFO L125 PetriNetUnfolderBase]: For 2182/2352 co-relation queries the response was YES. [2025-01-10 00:42:03,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8769 conditions, 3560 events. 2145/3560 cut-off events. For 2182/2352 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 21189 event pairs, 601 based on Foata normal form. 16/3403 useless extension candidates. Maximal degree in co-relation 8756. Up to 1078 conditions per place. [2025-01-10 00:42:03,279 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 55 selfloop transitions, 5 changer transitions 23/114 dead transitions. [2025-01-10 00:42:03,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 114 transitions, 559 flow [2025-01-10 00:42:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:42:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:42:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 324 transitions. [2025-01-10 00:42:03,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890909090909091 [2025-01-10 00:42:03,281 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 10 states and 324 transitions. [2025-01-10 00:42:03,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 114 transitions, 559 flow [2025-01-10 00:42:03,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 114 transitions, 450 flow, removed 22 selfloop flow, removed 10 redundant places. [2025-01-10 00:42:03,296 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 181 flow [2025-01-10 00:42:03,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=181, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-01-10 00:42:03,296 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2025-01-10 00:42:03,296 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 181 flow [2025-01-10 00:42:03,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 11 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:03,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:03,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:03,308 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-01-10 00:42:03,501 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-01-10 00:42:03,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:03,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1872954979, now seen corresponding path program 2 times [2025-01-10 00:42:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:03,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692547595] [2025-01-10 00:42:03,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:42:03,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:03,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:03,505 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-01-10 00:42:03,506 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-01-10 00:42:03,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:03,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:03,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:42:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:03,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:42:03,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:03,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:03,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692547595] [2025-01-10 00:42:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692547595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:42:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443176659] [2025-01-10 00:42:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:42:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:03,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:42:03,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:42:03,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2025-01-10 00:42:03,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 181 flow. Second operand has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:03,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:03,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2025-01-10 00:42:03,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:04,736 INFO L124 PetriNetUnfolderBase]: 9302/13400 cut-off events. [2025-01-10 00:42:04,737 INFO L125 PetriNetUnfolderBase]: For 4590/4590 co-relation queries the response was YES. [2025-01-10 00:42:04,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31716 conditions, 13400 events. 9302/13400 cut-off events. For 4590/4590 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 79917 event pairs, 2114 based on Foata normal form. 16/13309 useless extension candidates. Maximal degree in co-relation 31703. Up to 7211 conditions per place. [2025-01-10 00:42:04,798 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 58 selfloop transitions, 9 changer transitions 63/143 dead transitions. [2025-01-10 00:42:04,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 143 transitions, 717 flow [2025-01-10 00:42:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:42:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:42:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 272 transitions. [2025-01-10 00:42:04,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5494949494949495 [2025-01-10 00:42:04,799 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 181 flow. Second operand 9 states and 272 transitions. [2025-01-10 00:42:04,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 143 transitions, 717 flow [2025-01-10 00:42:04,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 143 transitions, 688 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:04,804 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 217 flow [2025-01-10 00:42:04,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=217, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2025-01-10 00:42:04,807 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2025-01-10 00:42:04,807 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 217 flow [2025-01-10 00:42:04,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:04,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:04,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:04,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 00:42:05,011 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-01-10 00:42:05,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:05,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash 717368799, now seen corresponding path program 3 times [2025-01-10 00:42:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:05,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285058357] [2025-01-10 00:42:05,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:42:05,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:05,022 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-01-10 00:42:05,023 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-01-10 00:42:05,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:05,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:05,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:42:05,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:05,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:42:05,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:05,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:05,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285058357] [2025-01-10 00:42:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285058357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:42:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005543314] [2025-01-10 00:42:05,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:05,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:42:05,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:05,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:42:05,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:42:05,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2025-01-10 00:42:05,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 217 flow. Second operand has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:05,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:05,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2025-01-10 00:42:05,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:06,108 INFO L124 PetriNetUnfolderBase]: 7491/10983 cut-off events. [2025-01-10 00:42:06,108 INFO L125 PetriNetUnfolderBase]: For 3185/3257 co-relation queries the response was YES. [2025-01-10 00:42:06,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26911 conditions, 10983 events. 7491/10983 cut-off events. For 3185/3257 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 63947 event pairs, 1381 based on Foata normal form. 32/10840 useless extension candidates. Maximal degree in co-relation 26895. Up to 6066 conditions per place. [2025-01-10 00:42:06,146 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 60 selfloop transitions, 14 changer transitions 63/151 dead transitions. [2025-01-10 00:42:06,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 151 transitions, 802 flow [2025-01-10 00:42:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:42:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:42:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 276 transitions. [2025-01-10 00:42:06,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5575757575757576 [2025-01-10 00:42:06,148 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 217 flow. Second operand 9 states and 276 transitions. [2025-01-10 00:42:06,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 151 transitions, 802 flow [2025-01-10 00:42:06,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 151 transitions, 737 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-01-10 00:42:06,155 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 271 flow [2025-01-10 00:42:06,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2025-01-10 00:42:06,156 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2025-01-10 00:42:06,156 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 271 flow [2025-01-10 00:42:06,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:06,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:06,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:06,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:42:06,361 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-01-10 00:42:06,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1533718561, now seen corresponding path program 4 times [2025-01-10 00:42:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781803735] [2025-01-10 00:42:06,362 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:42:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:06,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:06,364 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-01-10 00:42:06,366 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-01-10 00:42:06,415 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-01-10 00:42:06,429 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 39 statements. [2025-01-10 00:42:06,429 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 00:42:06,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:06,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 00:42:06,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:06,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:06,509 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:06,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781803735] [2025-01-10 00:42:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781803735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:06,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:06,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:42:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671757918] [2025-01-10 00:42:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:06,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:42:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:06,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:42:06,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:42:06,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2025-01-10 00:42:06,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:06,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:06,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2025-01-10 00:42:06,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:07,176 INFO L124 PetriNetUnfolderBase]: 5539/9069 cut-off events. [2025-01-10 00:42:07,177 INFO L125 PetriNetUnfolderBase]: For 1092/1106 co-relation queries the response was YES. [2025-01-10 00:42:07,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19292 conditions, 9069 events. 5539/9069 cut-off events. For 1092/1106 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 63593 event pairs, 1325 based on Foata normal form. 16/8621 useless extension candidates. Maximal degree in co-relation 19275. Up to 3293 conditions per place. [2025-01-10 00:42:07,293 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 44 selfloop transitions, 2 changer transitions 18/103 dead transitions. [2025-01-10 00:42:07,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 485 flow [2025-01-10 00:42:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2025-01-10 00:42:07,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5688311688311688 [2025-01-10 00:42:07,295 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 271 flow. Second operand 7 states and 219 transitions. [2025-01-10 00:42:07,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 485 flow [2025-01-10 00:42:07,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 103 transitions, 458 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:07,299 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 269 flow [2025-01-10 00:42:07,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2025-01-10 00:42:07,299 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2025-01-10 00:42:07,299 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 269 flow [2025-01-10 00:42:07,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:07,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:07,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:07,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:42:07,500 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-01-10 00:42:07,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:07,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash -786884165, now seen corresponding path program 5 times [2025-01-10 00:42:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:07,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158739958] [2025-01-10 00:42:07,502 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:42:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:07,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:07,504 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-01-10 00:42:07,506 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-01-10 00:42:07,559 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:07,578 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:07,579 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:42:07,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:07,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:42:07,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:07,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:07,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:07,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158739958] [2025-01-10 00:42:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158739958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:07,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:07,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:42:07,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087685612] [2025-01-10 00:42:07,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:07,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:42:07,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:07,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:42:07,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:42:07,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2025-01-10 00:42:07,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 269 flow. Second operand has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:07,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:07,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2025-01-10 00:42:07,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:09,417 INFO L124 PetriNetUnfolderBase]: 11863/17213 cut-off events. [2025-01-10 00:42:09,418 INFO L125 PetriNetUnfolderBase]: For 4952/4983 co-relation queries the response was YES. [2025-01-10 00:42:09,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41573 conditions, 17213 events. 11863/17213 cut-off events. For 4952/4983 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 104956 event pairs, 2023 based on Foata normal form. 18/16977 useless extension candidates. Maximal degree in co-relation 41555. Up to 8910 conditions per place. [2025-01-10 00:42:09,496 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 74 selfloop transitions, 11 changer transitions 54/154 dead transitions. [2025-01-10 00:42:09,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 154 transitions, 799 flow [2025-01-10 00:42:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:42:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:42:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 278 transitions. [2025-01-10 00:42:09,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5616161616161616 [2025-01-10 00:42:09,499 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 269 flow. Second operand 9 states and 278 transitions. [2025-01-10 00:42:09,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 154 transitions, 799 flow [2025-01-10 00:42:09,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 154 transitions, 788 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:09,504 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 272 flow [2025-01-10 00:42:09,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=272, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2025-01-10 00:42:09,506 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2025-01-10 00:42:09,506 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 272 flow [2025-01-10 00:42:09,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:09,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:09,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:09,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 00:42:09,706 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-01-10 00:42:09,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:09,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1854716699, now seen corresponding path program 6 times [2025-01-10 00:42:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:09,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129691457] [2025-01-10 00:42:09,711 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:42:09,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:09,714 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-01-10 00:42:09,715 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-01-10 00:42:09,791 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:09,815 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:09,815 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 00:42:09,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:09,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:42:09,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:42:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:09,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:42:09,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:42:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129691457] [2025-01-10 00:42:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129691457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:09,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:42:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552688430] [2025-01-10 00:42:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:09,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:42:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:42:09,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:42:09,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:42:10,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2025-01-10 00:42:10,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 272 flow. Second operand has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:10,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:10,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2025-01-10 00:42:10,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:11,452 INFO L124 PetriNetUnfolderBase]: 11577/16947 cut-off events. [2025-01-10 00:42:11,452 INFO L125 PetriNetUnfolderBase]: For 7774/7862 co-relation queries the response was YES. [2025-01-10 00:42:11,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41107 conditions, 16947 events. 11577/16947 cut-off events. For 7774/7862 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 104147 event pairs, 1614 based on Foata normal form. 16/16784 useless extension candidates. Maximal degree in co-relation 41086. Up to 8996 conditions per place. [2025-01-10 00:42:11,553 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 55 selfloop transitions, 8 changer transitions 62/139 dead transitions. [2025-01-10 00:42:11,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 139 transitions, 738 flow [2025-01-10 00:42:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:42:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:42:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 266 transitions. [2025-01-10 00:42:11,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5373737373737374 [2025-01-10 00:42:11,555 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 272 flow. Second operand 9 states and 266 transitions. [2025-01-10 00:42:11,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 139 transitions, 738 flow [2025-01-10 00:42:11,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 139 transitions, 706 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-01-10 00:42:11,561 INFO L231 Difference]: Finished difference. Result has 86 places, 59 transitions, 251 flow [2025-01-10 00:42:11,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=251, PETRI_PLACES=86, PETRI_TRANSITIONS=59} [2025-01-10 00:42:11,561 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2025-01-10 00:42:11,561 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 59 transitions, 251 flow [2025-01-10 00:42:11,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:11,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:11,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:11,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 00:42:11,762 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-01-10 00:42:11,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:11,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash 508472877, now seen corresponding path program 7 times [2025-01-10 00:42:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:42:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688289482] [2025-01-10 00:42:11,763 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 00:42:11,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:42:11,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:11,767 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-01-10 00:42:11,769 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-01-10 00:42:11,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:11,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:11,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:11,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:42:11,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:42:11,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:11,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:11,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:42:11,926 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:42:11,926 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:42:11,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:42:11,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:42:11,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:42:11,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:42:11,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:42:11,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:42:11,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:42:11,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:42:11,937 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-01-10 00:42:12,130 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-01-10 00:42:12,130 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:12,236 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:42:12,236 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:42:12,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:42:12 BasicIcfg [2025-01-10 00:42:12,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:42:12,241 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:42:12,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:42:12,241 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:42:12,244 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:41:54" (3/4) ... [2025-01-10 00:42:12,246 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:42:12,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:42:12,248 INFO L158 Benchmark]: Toolchain (without parser) took 18991.24ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 115.2MB in the beginning and 991.2MB in the end (delta: -876.0MB). Peak memory consumption was 528.5MB. Max. memory is 16.1GB. [2025-01-10 00:42:12,248 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:12,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.32ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 91.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:42:12,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.50ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:42:12,248 INFO L158 Benchmark]: Boogie Preprocessor took 66.11ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 85.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:42:12,248 INFO L158 Benchmark]: RCFGBuilder took 712.24ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 80.1MB in the end (delta: 5.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-01-10 00:42:12,248 INFO L158 Benchmark]: TraceAbstraction took 17746.19ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 79.3MB in the beginning and 991.8MB in the end (delta: -912.5MB). Peak memory consumption was 480.8MB. Max. memory is 16.1GB. [2025-01-10 00:42:12,248 INFO L158 Benchmark]: Witness Printer took 6.37ms. Allocated memory is still 1.5GB. Free memory was 991.8MB in the beginning and 991.2MB in the end (delta: 608.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:42:12,256 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.21ms. Allocated memory is still 117.4MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.32ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 91.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.50ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.11ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 85.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 712.24ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 80.1MB in the end (delta: 5.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17746.19ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 79.3MB in the beginning and 991.8MB in the end (delta: -912.5MB). Peak memory consumption was 480.8MB. Max. memory is 16.1GB. * Witness Printer took 6.37ms. Allocated memory is still 1.5GB. Free memory was 991.8MB in the beginning and 991.2MB in the end (delta: 608.5kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t89=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t90; [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t89=-1, t90=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t91; [L878] FCALL, FORK 0 pthread_create(&t91, ((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=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t89=-1, t90=0, t91=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L879] 0 pthread_t t92; [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t89=-1, t90=0, t91=1, t92=2, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89=-1, t90=0, t91=1, t92=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89=-1, t90=0, t91=1, t92=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89=-1, t90=0, t91=1, t92=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L895] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix004.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, 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: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 878]: 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: 874]: 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: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 869 mSDsluCounter, 451 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3297 IncrementalHoareTripleChecker+Invalid, 3345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 27 mSDtfsCounter, 3297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=11, InterpolantAutomatonStates: 81, 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, 1.6s InterpolantComputationTime, 393 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 1609 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1548 ConjunctsInSsa, 97 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-01-10 00:42:12,283 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