./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:12:00,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:12:00,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:12:00,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:12:00,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:12:00,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:12:00,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:12:00,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:12:00,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:12:00,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:12:00,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:12:00,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:12:00,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:12:00,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:12:00,771 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:12:00,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:12:00,771 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:12:00,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:12:00,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:12:00,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:12:00,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:12:00,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:12:00,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:12:00,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:12:00,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:12:00,774 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2025-03-17 14:12:01,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:12:01,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:12:01,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:12:01,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:12:01,012 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:12:01,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2025-03-17 14:12:02,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068e2a3e8/68387516841f4724aaa7ed26bb095857/FLAG4040dcd07 [2025-03-17 14:12:02,363 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:12:02,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2025-03-17 14:12:02,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068e2a3e8/68387516841f4724aaa7ed26bb095857/FLAG4040dcd07 [2025-03-17 14:12:02,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068e2a3e8/68387516841f4724aaa7ed26bb095857 [2025-03-17 14:12:02,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:12:02,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:12:02,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:12:02,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:12:02,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:12:02,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e43a951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02, skipping insertion in model container [2025-03-17 14:12:02,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:12:02,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:12:02,716 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:12:02,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:12:02,821 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:12:02,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02 WrapperNode [2025-03-17 14:12:02,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:12:02,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:12:02,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:12:02,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:12:02,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,868 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2025-03-17 14:12:02,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:12:02,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:12:02,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:12:02,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:12:02,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,907 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 4 writes are split as follows [0, 4]. [2025-03-17 14:12:02,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:12:02,933 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:12:02,937 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:12:02,937 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:12:02,938 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (1/1) ... [2025-03-17 14:12:02,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:12:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:02,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:12:02,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:12:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:12:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:12:02,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:12:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:12:02,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:12:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:12:02,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:12:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:12:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:12:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:12:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:12:02,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:12:02,984 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:12:03,098 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:12:03,099 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:12:03,451 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:12:03,451 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:12:03,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:12:03,777 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:12:03,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:12:03 BoogieIcfgContainer [2025-03-17 14:12:03,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:12:03,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:12:03,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:12:03,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:12:03,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:12:02" (1/3) ... [2025-03-17 14:12:03,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b5cba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:12:03, skipping insertion in model container [2025-03-17 14:12:03,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:02" (2/3) ... [2025-03-17 14:12:03,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b5cba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:12:03, skipping insertion in model container [2025-03-17 14:12:03,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:12:03" (3/3) ... [2025-03-17 14:12:03,786 INFO L128 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2025-03-17 14:12:03,801 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:12:03,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe014_power.opt.i that has 4 procedures, 69 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-17 14:12:03,803 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:12:03,936 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:12:03,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 70 transitions, 152 flow [2025-03-17 14:12:04,001 INFO L124 PetriNetUnfolderBase]: 2/67 cut-off events. [2025-03-17 14:12:04,002 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:04,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 67 events. 2/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 229 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-17 14:12:04,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 70 transitions, 152 flow [2025-03-17 14:12:04,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 67 transitions, 143 flow [2025-03-17 14:12:04,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:12:04,029 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;@3bc6e091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:12:04,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-17 14:12:04,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:12:04,034 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-17 14:12:04,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:04,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:04,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:12:04,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:04,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash 21650667, now seen corresponding path program 1 times [2025-03-17 14:12:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874094221] [2025-03-17 14:12:04,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:04,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:12:04,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:12:04,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:04,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874094221] [2025-03-17 14:12:04,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874094221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:04,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:04,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530705416] [2025-03-17 14:12:04,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:04,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:04,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:04,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:04,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:04,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:04,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:04,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:04,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:04,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:06,219 INFO L124 PetriNetUnfolderBase]: 13427/20342 cut-off events. [2025-03-17 14:12:06,220 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-17 14:12:06,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39265 conditions, 20342 events. 13427/20342 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 136346 event pairs, 13427 based on Foata normal form. 756/17046 useless extension candidates. Maximal degree in co-relation 39254. Up to 18818 conditions per place. [2025-03-17 14:12:06,340 INFO L140 encePairwiseOnDemand]: 48/70 looper letters, 37 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-03-17 14:12:06,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 175 flow [2025-03-17 14:12:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-17 14:12:06,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2025-03-17 14:12:06,351 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 143 flow. Second operand 3 states and 89 transitions. [2025-03-17 14:12:06,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 175 flow [2025-03-17 14:12:06,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:12:06,356 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2025-03-17 14:12:06,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-03-17 14:12:06,362 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -21 predicate places. [2025-03-17 14:12:06,362 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2025-03-17 14:12:06,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:06,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:06,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:12:06,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:12:06,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:06,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash 21650668, now seen corresponding path program 1 times [2025-03-17 14:12:06,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010752598] [2025-03-17 14:12:06,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:06,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:12:06,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:12:06,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:06,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010752598] [2025-03-17 14:12:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010752598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61047835] [2025-03-17 14:12:06,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:06,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:06,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:06,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:06,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:06,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:06,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:06,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:06,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:07,642 INFO L124 PetriNetUnfolderBase]: 7511/11637 cut-off events. [2025-03-17 14:12:07,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:07,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22347 conditions, 11637 events. 7511/11637 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 73446 event pairs, 7511 based on Foata normal form. 0/10696 useless extension candidates. Maximal degree in co-relation 22341. Up to 10620 conditions per place. [2025-03-17 14:12:07,706 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 32 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-03-17 14:12:07,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 154 flow [2025-03-17 14:12:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-17 14:12:07,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3238095238095238 [2025-03-17 14:12:07,709 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 68 transitions. [2025-03-17 14:12:07,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 154 flow [2025-03-17 14:12:07,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:12:07,711 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 89 flow [2025-03-17 14:12:07,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-17 14:12:07,712 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-03-17 14:12:07,713 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 89 flow [2025-03-17 14:12:07,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:07,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:07,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:07,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:12:07,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:07,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash -637405282, now seen corresponding path program 1 times [2025-03-17 14:12:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734431981] [2025-03-17 14:12:07,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:07,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:07,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:12:07,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:12:07,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:07,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734431981] [2025-03-17 14:12:07,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734431981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:07,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:07,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940495912] [2025-03-17 14:12:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:07,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:07,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:07,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:07,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:07,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:07,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:07,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:07,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:08,635 INFO L124 PetriNetUnfolderBase]: 6395/9369 cut-off events. [2025-03-17 14:12:08,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:08,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18532 conditions, 9369 events. 6395/9369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 54627 event pairs, 1931 based on Foata normal form. 0/8932 useless extension candidates. Maximal degree in co-relation 18525. Up to 6193 conditions per place. [2025-03-17 14:12:08,663 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-17 14:12:08,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2025-03-17 14:12:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-17 14:12:08,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-17 14:12:08,665 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 89 flow. Second operand 3 states and 84 transitions. [2025-03-17 14:12:08,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2025-03-17 14:12:08,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:12:08,667 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 88 flow [2025-03-17 14:12:08,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-03-17 14:12:08,667 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-03-17 14:12:08,668 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 88 flow [2025-03-17 14:12:08,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:08,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:08,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:08,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:12:08,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:08,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1571232040, now seen corresponding path program 1 times [2025-03-17 14:12:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:08,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550815548] [2025-03-17 14:12:08,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:08,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:12:08,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:12:08,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:08,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:08,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550815548] [2025-03-17 14:12:08,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550815548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:08,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:08,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106530898] [2025-03-17 14:12:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:08,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:08,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:08,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:08,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:08,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:08,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:08,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:08,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:08,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:09,318 INFO L124 PetriNetUnfolderBase]: 5663/8200 cut-off events. [2025-03-17 14:12:09,319 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-03-17 14:12:09,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16728 conditions, 8200 events. 5663/8200 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 46478 event pairs, 803 based on Foata normal form. 0/7838 useless extension candidates. Maximal degree in co-relation 16720. Up to 7199 conditions per place. [2025-03-17 14:12:09,348 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-17 14:12:09,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 244 flow [2025-03-17 14:12:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-17 14:12:09,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-17 14:12:09,350 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 85 transitions. [2025-03-17 14:12:09,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 244 flow [2025-03-17 14:12:09,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:12:09,352 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-03-17 14:12:09,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-03-17 14:12:09,352 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-03-17 14:12:09,352 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-03-17 14:12:09,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:09,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:09,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:12:09,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1874429705, now seen corresponding path program 1 times [2025-03-17 14:12:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850507017] [2025-03-17 14:12:09,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:09,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:12:09,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:12:09,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:09,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:09,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850507017] [2025-03-17 14:12:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850507017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:09,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:09,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:12:09,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485736921] [2025-03-17 14:12:09,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:09,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:12:09,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:09,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:12:09,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:12:09,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:09,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:09,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:09,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:09,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:10,117 INFO L124 PetriNetUnfolderBase]: 5219/7576 cut-off events. [2025-03-17 14:12:10,118 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-03-17 14:12:10,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15953 conditions, 7576 events. 5219/7576 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 42777 event pairs, 659 based on Foata normal form. 0/7574 useless extension candidates. Maximal degree in co-relation 15944. Up to 6574 conditions per place. [2025-03-17 14:12:10,151 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-03-17 14:12:10,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 242 flow [2025-03-17 14:12:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:12:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:12:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-17 14:12:10,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-03-17 14:12:10,153 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 93 transitions. [2025-03-17 14:12:10,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 242 flow [2025-03-17 14:12:10,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:12:10,156 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-03-17 14:12:10,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2025-03-17 14:12:10,157 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-03-17 14:12:10,157 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-03-17 14:12:10,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:10,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:10,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:10,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:12:10,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:10,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1874429704, now seen corresponding path program 1 times [2025-03-17 14:12:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700569251] [2025-03-17 14:12:10,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:10,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:12:10,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:12:10,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:10,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700569251] [2025-03-17 14:12:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700569251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:10,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:10,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:12:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286726956] [2025-03-17 14:12:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:12:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:12:10,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:12:10,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:10,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:10,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:10,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:10,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:11,210 INFO L124 PetriNetUnfolderBase]: 4775/6952 cut-off events. [2025-03-17 14:12:11,211 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-03-17 14:12:11,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14525 conditions, 6952 events. 4775/6952 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 39125 event pairs, 515 based on Foata normal form. 180/7130 useless extension candidates. Maximal degree in co-relation 14516. Up to 5950 conditions per place. [2025-03-17 14:12:11,243 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 49 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-03-17 14:12:11,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 236 flow [2025-03-17 14:12:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:12:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:12:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-17 14:12:11,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2025-03-17 14:12:11,244 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 92 transitions. [2025-03-17 14:12:11,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 236 flow [2025-03-17 14:12:11,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:12:11,245 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-03-17 14:12:11,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-03-17 14:12:11,246 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2025-03-17 14:12:11,246 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-03-17 14:12:11,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:11,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:11,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:11,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:12:11,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:11,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1779387022, now seen corresponding path program 1 times [2025-03-17 14:12:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553334713] [2025-03-17 14:12:11,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:11,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:12:11,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:12:11,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:11,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:11,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:11,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553334713] [2025-03-17 14:12:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553334713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:11,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666630250] [2025-03-17 14:12:11,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:11,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:11,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:11,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:11,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:11,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:11,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:11,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:11,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:11,882 INFO L124 PetriNetUnfolderBase]: 4775/7461 cut-off events. [2025-03-17 14:12:11,882 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-03-17 14:12:11,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15033 conditions, 7461 events. 4775/7461 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 44025 event pairs, 4775 based on Foata normal form. 216/7672 useless extension candidates. Maximal degree in co-relation 15025. Up to 6804 conditions per place. [2025-03-17 14:12:11,904 INFO L140 encePairwiseOnDemand]: 68/70 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-03-17 14:12:11,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 141 flow [2025-03-17 14:12:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-17 14:12:11,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2025-03-17 14:12:11,905 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 57 transitions. [2025-03-17 14:12:11,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 141 flow [2025-03-17 14:12:11,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:12:11,906 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-03-17 14:12:11,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-03-17 14:12:11,907 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -27 predicate places. [2025-03-17 14:12:11,907 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-03-17 14:12:11,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:11,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:11,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:11,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:12:11,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:11,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:11,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1779385181, now seen corresponding path program 1 times [2025-03-17 14:12:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84792142] [2025-03-17 14:12:11,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:11,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:11,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:12:11,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:12:11,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:11,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:12,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:12,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84792142] [2025-03-17 14:12:12,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84792142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:12,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:12,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:12:12,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91616476] [2025-03-17 14:12:12,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:12,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:12:12,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:12,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:12:12,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:12:12,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:12,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:12,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:12,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:12,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:12,771 INFO L124 PetriNetUnfolderBase]: 5831/8733 cut-off events. [2025-03-17 14:12:12,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:12,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18033 conditions, 8733 events. 5831/8733 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 49546 event pairs, 827 based on Foata normal form. 0/8548 useless extension candidates. Maximal degree in co-relation 18025. Up to 4993 conditions per place. [2025-03-17 14:12:12,799 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 40 selfloop transitions, 2 changer transitions 70/117 dead transitions. [2025-03-17 14:12:12,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 117 transitions, 482 flow [2025-03-17 14:12:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:12:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:12:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-03-17 14:12:12,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-03-17 14:12:12,800 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 186 transitions. [2025-03-17 14:12:12,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 117 transitions, 482 flow [2025-03-17 14:12:12,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 117 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:12:12,801 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 93 flow [2025-03-17 14:12:12,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-03-17 14:12:12,802 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2025-03-17 14:12:12,802 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 93 flow [2025-03-17 14:12:12,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:12,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:12,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:12,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:12:12,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:12,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:12,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2066333822, now seen corresponding path program 1 times [2025-03-17 14:12:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:12,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343854835] [2025-03-17 14:12:12,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:12,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:12,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:12:12,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:12:12,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:12,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343854835] [2025-03-17 14:12:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343854835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:12,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:12:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929136113] [2025-03-17 14:12:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:12:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:12,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:12:12,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:12:12,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:12,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:12,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:12,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:12,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:13,761 INFO L124 PetriNetUnfolderBase]: 6273/9304 cut-off events. [2025-03-17 14:12:13,761 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2025-03-17 14:12:13,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20958 conditions, 9304 events. 6273/9304 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 51888 event pairs, 645 based on Foata normal form. 180/9480 useless extension candidates. Maximal degree in co-relation 20944. Up to 4121 conditions per place. [2025-03-17 14:12:13,792 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 49 selfloop transitions, 3 changer transitions 59/116 dead transitions. [2025-03-17 14:12:13,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 116 transitions, 510 flow [2025-03-17 14:12:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:12:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:12:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2025-03-17 14:12:13,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2025-03-17 14:12:13,794 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 93 flow. Second operand 8 states and 185 transitions. [2025-03-17 14:12:13,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 116 transitions, 510 flow [2025-03-17 14:12:13,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 116 transitions, 488 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-17 14:12:13,846 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 103 flow [2025-03-17 14:12:13,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=103, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2025-03-17 14:12:13,846 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2025-03-17 14:12:13,846 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 103 flow [2025-03-17 14:12:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:13,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:13,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:13,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:12:13,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:13,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -752555435, now seen corresponding path program 1 times [2025-03-17 14:12:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651662733] [2025-03-17 14:12:13,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:13,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:12:13,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:12:13,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:13,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:13,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651662733] [2025-03-17 14:12:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651662733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:13,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:13,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:12:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747072690] [2025-03-17 14:12:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:13,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:12:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:13,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:12:13,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:12:13,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:13,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:13,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:13,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:13,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:14,522 INFO L124 PetriNetUnfolderBase]: 3688/5612 cut-off events. [2025-03-17 14:12:14,522 INFO L125 PetriNetUnfolderBase]: For 1866/1866 co-relation queries the response was YES. [2025-03-17 14:12:14,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13397 conditions, 5612 events. 3688/5612 cut-off events. For 1866/1866 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 30114 event pairs, 1874 based on Foata normal form. 150/5758 useless extension candidates. Maximal degree in co-relation 13381. Up to 3946 conditions per place. [2025-03-17 14:12:14,546 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 42 selfloop transitions, 2 changer transitions 47/96 dead transitions. [2025-03-17 14:12:14,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 441 flow [2025-03-17 14:12:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:12:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:12:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-03-17 14:12:14,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3183673469387755 [2025-03-17 14:12:14,547 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 103 flow. Second operand 7 states and 156 transitions. [2025-03-17 14:12:14,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 441 flow [2025-03-17 14:12:14,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 407 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-17 14:12:14,567 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 99 flow [2025-03-17 14:12:14,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-03-17 14:12:14,567 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2025-03-17 14:12:14,567 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 99 flow [2025-03-17 14:12:14,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:14,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:14,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:12:14,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:14,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1879174393, now seen corresponding path program 1 times [2025-03-17 14:12:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808969558] [2025-03-17 14:12:14,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:14,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:12:14,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:12:14,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:14,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:14,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:14,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808969558] [2025-03-17 14:12:14,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808969558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:14,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:14,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:12:14,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812976436] [2025-03-17 14:12:14,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:14,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:12:14,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:14,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:12:14,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:12:14,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:14,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:14,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:14,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:14,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:15,433 INFO L124 PetriNetUnfolderBase]: 4960/7424 cut-off events. [2025-03-17 14:12:15,434 INFO L125 PetriNetUnfolderBase]: For 1500/1500 co-relation queries the response was YES. [2025-03-17 14:12:15,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17253 conditions, 7424 events. 4960/7424 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 40025 event pairs, 2612 based on Foata normal form. 120/7540 useless extension candidates. Maximal degree in co-relation 17239. Up to 3796 conditions per place. [2025-03-17 14:12:15,459 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 37 selfloop transitions, 2 changer transitions 57/101 dead transitions. [2025-03-17 14:12:15,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 452 flow [2025-03-17 14:12:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:12:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:12:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-03-17 14:12:15,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32653061224489793 [2025-03-17 14:12:15,461 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 99 flow. Second operand 7 states and 160 transitions. [2025-03-17 14:12:15,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 452 flow [2025-03-17 14:12:15,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 434 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 14:12:15,481 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 101 flow [2025-03-17 14:12:15,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-03-17 14:12:15,482 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2025-03-17 14:12:15,482 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 101 flow [2025-03-17 14:12:15,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:15,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:15,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:15,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:12:15,483 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:15,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1774209189, now seen corresponding path program 2 times [2025-03-17 14:12:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:15,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111933612] [2025-03-17 14:12:15,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:12:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:15,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:12:15,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:12:15,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:12:15,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111933612] [2025-03-17 14:12:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111933612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:12:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441888996] [2025-03-17 14:12:15,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:15,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:12:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:15,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:12:15,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:12:15,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:15,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:15,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:15,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:15,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:16,102 INFO L124 PetriNetUnfolderBase]: 3002/4611 cut-off events. [2025-03-17 14:12:16,102 INFO L125 PetriNetUnfolderBase]: For 1560/1560 co-relation queries the response was YES. [2025-03-17 14:12:16,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10614 conditions, 4611 events. 3002/4611 cut-off events. For 1560/1560 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23977 event pairs, 425 based on Foata normal form. 120/4729 useless extension candidates. Maximal degree in co-relation 10600. Up to 3366 conditions per place. [2025-03-17 14:12:16,119 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 44 selfloop transitions, 2 changer transitions 41/92 dead transitions. [2025-03-17 14:12:16,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 424 flow [2025-03-17 14:12:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:12:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:12:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2025-03-17 14:12:16,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31020408163265306 [2025-03-17 14:12:16,120 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 101 flow. Second operand 7 states and 152 transitions. [2025-03-17 14:12:16,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 424 flow [2025-03-17 14:12:16,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 396 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-17 14:12:16,127 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 103 flow [2025-03-17 14:12:16,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2025-03-17 14:12:16,128 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2025-03-17 14:12:16,128 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 103 flow [2025-03-17 14:12:16,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:16,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:16,128 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-03-17 14:12:16,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:12:16,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:16,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1867768892, now seen corresponding path program 1 times [2025-03-17 14:12:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:16,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399114173] [2025-03-17 14:12:16,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:16,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:16,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:12:16,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:12:16,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:16,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:16,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:16,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399114173] [2025-03-17 14:12:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399114173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:16,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:16,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:12:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227023668] [2025-03-17 14:12:16,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:16,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:12:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:16,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:12:16,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:12:16,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:16,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 103 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:16,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:16,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:16,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:17,444 INFO L124 PetriNetUnfolderBase]: 3022/4591 cut-off events. [2025-03-17 14:12:17,444 INFO L125 PetriNetUnfolderBase]: For 1454/1454 co-relation queries the response was YES. [2025-03-17 14:12:17,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10778 conditions, 4591 events. 3022/4591 cut-off events. For 1454/1454 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 22623 event pairs, 181 based on Foata normal form. 100/4689 useless extension candidates. Maximal degree in co-relation 10762. Up to 2437 conditions per place. [2025-03-17 14:12:17,461 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 61 selfloop transitions, 6 changer transitions 55/127 dead transitions. [2025-03-17 14:12:17,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 127 transitions, 571 flow [2025-03-17 14:12:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:12:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:12:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-03-17 14:12:17,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2025-03-17 14:12:17,462 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 103 flow. Second operand 11 states and 224 transitions. [2025-03-17 14:12:17,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 127 transitions, 571 flow [2025-03-17 14:12:17,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 127 transitions, 545 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-17 14:12:17,470 INFO L231 Difference]: Finished difference. Result has 68 places, 37 transitions, 148 flow [2025-03-17 14:12:17,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=148, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2025-03-17 14:12:17,471 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-03-17 14:12:17,471 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 37 transitions, 148 flow [2025-03-17 14:12:17,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:17,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:17,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:17,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:12:17,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:17,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1066995881, now seen corresponding path program 1 times [2025-03-17 14:12:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:17,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555753544] [2025-03-17 14:12:17,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:17,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:17,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:12:17,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:12:17,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:17,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:18,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555753544] [2025-03-17 14:12:18,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555753544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:18,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:18,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:12:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540676793] [2025-03-17 14:12:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:18,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:12:18,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:18,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:12:18,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:12:18,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:18,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 37 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:18,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:18,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:18,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:18,591 INFO L124 PetriNetUnfolderBase]: 2951/4500 cut-off events. [2025-03-17 14:12:18,591 INFO L125 PetriNetUnfolderBase]: For 3998/3998 co-relation queries the response was YES. [2025-03-17 14:12:18,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12381 conditions, 4500 events. 2951/4500 cut-off events. For 3998/3998 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 22147 event pairs, 217 based on Foata normal form. 80/4578 useless extension candidates. Maximal degree in co-relation 12360. Up to 2670 conditions per place. [2025-03-17 14:12:18,607 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 67 selfloop transitions, 8 changer transitions 37/117 dead transitions. [2025-03-17 14:12:18,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 609 flow [2025-03-17 14:12:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:12:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:12:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2025-03-17 14:12:18,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30317460317460315 [2025-03-17 14:12:18,608 INFO L175 Difference]: Start difference. First operand has 68 places, 37 transitions, 148 flow. Second operand 9 states and 191 transitions. [2025-03-17 14:12:18,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 609 flow [2025-03-17 14:12:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 587 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-17 14:12:18,618 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 227 flow [2025-03-17 14:12:18,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=227, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2025-03-17 14:12:18,619 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-03-17 14:12:18,619 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 227 flow [2025-03-17 14:12:18,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:18,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:18,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:18,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:12:18,623 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:18,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1738852193, now seen corresponding path program 2 times [2025-03-17 14:12:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:18,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828461635] [2025-03-17 14:12:18,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:12:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:18,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:12:18,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:12:18,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:12:18,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828461635] [2025-03-17 14:12:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828461635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:18,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:12:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237899457] [2025-03-17 14:12:18,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:18,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:12:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:18,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:12:18,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:12:18,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:18,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:18,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:18,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:18,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:19,067 INFO L124 PetriNetUnfolderBase]: 2424/3790 cut-off events. [2025-03-17 14:12:19,067 INFO L125 PetriNetUnfolderBase]: For 5884/5884 co-relation queries the response was YES. [2025-03-17 14:12:19,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11390 conditions, 3790 events. 2424/3790 cut-off events. For 5884/5884 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19220 event pairs, 364 based on Foata normal form. 176/3963 useless extension candidates. Maximal degree in co-relation 11365. Up to 1945 conditions per place. [2025-03-17 14:12:19,084 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 72 selfloop transitions, 5 changer transitions 1/83 dead transitions. [2025-03-17 14:12:19,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 571 flow [2025-03-17 14:12:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:12:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:12:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-03-17 14:12:19,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2025-03-17 14:12:19,085 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 227 flow. Second operand 4 states and 103 transitions. [2025-03-17 14:12:19,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 571 flow [2025-03-17 14:12:19,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 543 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-17 14:12:19,094 INFO L231 Difference]: Finished difference. Result has 69 places, 47 transitions, 241 flow [2025-03-17 14:12:19,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2025-03-17 14:12:19,095 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2025-03-17 14:12:19,095 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 241 flow [2025-03-17 14:12:19,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:19,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:19,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:19,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:12:19,095 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:19,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1369893108, now seen corresponding path program 1 times [2025-03-17 14:12:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770346118] [2025-03-17 14:12:19,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:19,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:12:19,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:12:19,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:19,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:19,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770346118] [2025-03-17 14:12:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770346118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:19,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:19,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:12:19,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334169807] [2025-03-17 14:12:19,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:12:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:19,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:12:19,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:12:19,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:19,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 47 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:19,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:19,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:19,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:19,541 INFO L124 PetriNetUnfolderBase]: 1544/2460 cut-off events. [2025-03-17 14:12:19,541 INFO L125 PetriNetUnfolderBase]: For 3063/3063 co-relation queries the response was YES. [2025-03-17 14:12:19,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7646 conditions, 2460 events. 1544/2460 cut-off events. For 3063/3063 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11380 event pairs, 226 based on Foata normal form. 130/2587 useless extension candidates. Maximal degree in co-relation 7621. Up to 777 conditions per place. [2025-03-17 14:12:19,553 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 79 selfloop transitions, 8 changer transitions 1/93 dead transitions. [2025-03-17 14:12:19,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 623 flow [2025-03-17 14:12:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:12:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:12:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-17 14:12:19,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3628571428571429 [2025-03-17 14:12:19,554 INFO L175 Difference]: Start difference. First operand has 69 places, 47 transitions, 241 flow. Second operand 5 states and 127 transitions. [2025-03-17 14:12:19,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 623 flow [2025-03-17 14:12:19,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 93 transitions, 603 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 14:12:19,559 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 253 flow [2025-03-17 14:12:19,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2025-03-17 14:12:19,559 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -4 predicate places. [2025-03-17 14:12:19,560 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 253 flow [2025-03-17 14:12:19,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:19,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:19,560 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-03-17 14:12:19,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:12:19,560 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:19,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash 372337539, now seen corresponding path program 1 times [2025-03-17 14:12:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:19,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462342778] [2025-03-17 14:12:19,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:19,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:12:19,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:12:19,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:19,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:19,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:19,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462342778] [2025-03-17 14:12:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462342778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:19,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:19,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:12:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730072354] [2025-03-17 14:12:19,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:19,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:12:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:19,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:12:19,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:12:19,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:19,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:19,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:19,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:19,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:19,965 INFO L124 PetriNetUnfolderBase]: 961/1523 cut-off events. [2025-03-17 14:12:19,965 INFO L125 PetriNetUnfolderBase]: For 2496/2496 co-relation queries the response was YES. [2025-03-17 14:12:19,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5010 conditions, 1523 events. 961/1523 cut-off events. For 2496/2496 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6348 event pairs, 197 based on Foata normal form. 52/1572 useless extension candidates. Maximal degree in co-relation 4985. Up to 546 conditions per place. [2025-03-17 14:12:19,971 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 64 selfloop transitions, 11 changer transitions 1/81 dead transitions. [2025-03-17 14:12:19,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 538 flow [2025-03-17 14:12:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:12:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:12:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2025-03-17 14:12:19,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3119047619047619 [2025-03-17 14:12:19,973 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 253 flow. Second operand 6 states and 131 transitions. [2025-03-17 14:12:19,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 538 flow [2025-03-17 14:12:19,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 434 flow, removed 22 selfloop flow, removed 14 redundant places. [2025-03-17 14:12:19,979 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 195 flow [2025-03-17 14:12:19,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-03-17 14:12:19,979 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2025-03-17 14:12:19,979 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 195 flow [2025-03-17 14:12:19,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:19,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:19,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:19,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:12:19,980 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:19,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:19,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2011747240, now seen corresponding path program 1 times [2025-03-17 14:12:19,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:19,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064796422] [2025-03-17 14:12:19,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:19,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:19,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:12:19,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:19,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:19,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064796422] [2025-03-17 14:12:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064796422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:20,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:20,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:12:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091723553] [2025-03-17 14:12:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:12:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:20,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:12:20,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:12:20,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:20,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:20,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:20,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:20,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:20,411 INFO L124 PetriNetUnfolderBase]: 1353/2143 cut-off events. [2025-03-17 14:12:20,411 INFO L125 PetriNetUnfolderBase]: For 2260/2260 co-relation queries the response was YES. [2025-03-17 14:12:20,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6215 conditions, 2143 events. 1353/2143 cut-off events. For 2260/2260 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9514 event pairs, 831 based on Foata normal form. 8/2147 useless extension candidates. Maximal degree in co-relation 6197. Up to 1293 conditions per place. [2025-03-17 14:12:20,419 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 42 selfloop transitions, 2 changer transitions 39/88 dead transitions. [2025-03-17 14:12:20,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 557 flow [2025-03-17 14:12:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:12:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:12:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2025-03-17 14:12:20,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2693877551020408 [2025-03-17 14:12:20,420 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 195 flow. Second operand 7 states and 132 transitions. [2025-03-17 14:12:20,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 557 flow [2025-03-17 14:12:20,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 440 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-17 14:12:20,427 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 153 flow [2025-03-17 14:12:20,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2025-03-17 14:12:20,427 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2025-03-17 14:12:20,427 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 153 flow [2025-03-17 14:12:20,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:20,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:20,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:20,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:12:20,428 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:20,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:20,428 INFO L85 PathProgramCache]: Analyzing trace with hash -443280636, now seen corresponding path program 2 times [2025-03-17 14:12:20,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:20,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658496624] [2025-03-17 14:12:20,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:12:20,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:20,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:12:20,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:20,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:12:20,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:20,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:12:20,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658496624] [2025-03-17 14:12:20,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658496624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:20,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:20,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:12:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734048806] [2025-03-17 14:12:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:20,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:12:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:12:20,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:12:20,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:12:20,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:20,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:20,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:20,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:20,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:20,869 INFO L124 PetriNetUnfolderBase]: 1325/2098 cut-off events. [2025-03-17 14:12:20,869 INFO L125 PetriNetUnfolderBase]: For 910/910 co-relation queries the response was YES. [2025-03-17 14:12:20,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 2098 events. 1325/2098 cut-off events. For 910/910 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9472 event pairs, 309 based on Foata normal form. 8/2103 useless extension candidates. Maximal degree in co-relation 5390. Up to 1070 conditions per place. [2025-03-17 14:12:20,877 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 39 selfloop transitions, 1 changer transitions 37/82 dead transitions. [2025-03-17 14:12:20,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 433 flow [2025-03-17 14:12:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:12:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:12:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-03-17 14:12:20,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2761904761904762 [2025-03-17 14:12:20,878 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 153 flow. Second operand 6 states and 116 transitions. [2025-03-17 14:12:20,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 433 flow [2025-03-17 14:12:20,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 419 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-17 14:12:20,881 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 140 flow [2025-03-17 14:12:20,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2025-03-17 14:12:20,882 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2025-03-17 14:12:20,882 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 140 flow [2025-03-17 14:12:20,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:20,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:20,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:20,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:12:20,883 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:20,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1352810158, now seen corresponding path program 3 times [2025-03-17 14:12:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:12:20,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068082912] [2025-03-17 14:12:20,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:12:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:12:20,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:12:20,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:20,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:12:20,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:12:20,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:12:20,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:12:20,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:20,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:20,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:12:21,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:12:21,014 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:12:21,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2025-03-17 14:12:21,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2025-03-17 14:12:21,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONMEMORY_LEAK (35 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONMEMORY_LEAK (4 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2025-03-17 14:12:21,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2025-03-17 14:12:21,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:12:21,020 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:21,100 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:12:21,100 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:12:21,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:12:21 BasicIcfg [2025-03-17 14:12:21,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:12:21,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:12:21,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:12:21,106 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:12:21,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:12:03" (3/4) ... [2025-03-17 14:12:21,108 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:12:21,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:12:21,109 INFO L158 Benchmark]: Toolchain (without parser) took 18706.98ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 131.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. [2025-03-17 14:12:21,109 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:12:21,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.79ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 108.2MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:12:21,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.94ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 105.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:12:21,109 INFO L158 Benchmark]: Boogie Preprocessor took 63.47ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 102.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:12:21,110 INFO L158 Benchmark]: IcfgBuilder took 844.10ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 59.4MB in the end (delta: 43.0MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2025-03-17 14:12:21,110 INFO L158 Benchmark]: TraceAbstraction took 17325.07ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 58.4MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-03-17 14:12:21,111 INFO L158 Benchmark]: Witness Printer took 2.13ms. Allocated memory is still 2.3GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 316.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:12:21,112 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 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.79ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 108.2MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.94ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 105.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.47ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 102.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 844.10ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 59.4MB in the end (delta: 43.0MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17325.07ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 58.4MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 2.13ms. Allocated memory is still 2.3GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 316.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L846] 0 pthread_t t2101; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, t2101=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L848] 0 pthread_t t2102; [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 114 locations, 112 edges, 53 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1048 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2856 IncrementalHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 5 mSDtfsCounter, 2856 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=16, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 1645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:12:21,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:12:23,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:12:23,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:12:23,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:12:23,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:12:23,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:12:23,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:12:23,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:12:23,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:12:23,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:12:23,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:12:23,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:12:23,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:12:23,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:12:23,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:12:23,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:12:23,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:12:23,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:12:23,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:12:23,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:12:23,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:12:23,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:12:23,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:12:23,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:12:23,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:12:23,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:12:23,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:12:23,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:12:23,412 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:12:23,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:12:23,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:12:23,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:12:23,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:12:23,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:12:23,412 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2025-03-17 14:12:23,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:12:23,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:12:23,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:12:23,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:12:23,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:12:23,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2025-03-17 14:12:24,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e65738a8/46486e2803ec4e1ebc27f035130e233f/FLAG8b9689e8c [2025-03-17 14:12:25,083 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:12:25,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2025-03-17 14:12:25,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e65738a8/46486e2803ec4e1ebc27f035130e233f/FLAG8b9689e8c [2025-03-17 14:12:25,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e65738a8/46486e2803ec4e1ebc27f035130e233f [2025-03-17 14:12:25,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:12:25,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:12:25,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:12:25,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:12:25,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:12:25,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bae3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25, skipping insertion in model container [2025-03-17 14:12:25,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:12:25,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:12:25,659 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:12:25,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:12:25,750 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:12:25,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25 WrapperNode [2025-03-17 14:12:25,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:12:25,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:12:25,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:12:25,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:12:25,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,797 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2025-03-17 14:12:25,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:12:25,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:12:25,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:12:25,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:12:25,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,834 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 4 writes are split as follows [0, 4]. [2025-03-17 14:12:25,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:12:25,848 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:12:25,848 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:12:25,848 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:12:25,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (1/1) ... [2025-03-17 14:12:25,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:12:25,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:25,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:12:25,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:12:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:12:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:12:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:12:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:12:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:12:25,892 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:12:25,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:12:25,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:12:26,418 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:12:26,418 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:12:26,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:12:26,777 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:12:26,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:12:26 BoogieIcfgContainer [2025-03-17 14:12:26,778 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:12:26,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:12:26,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:12:26,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:12:26,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:12:25" (1/3) ... [2025-03-17 14:12:26,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e024ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:12:26, skipping insertion in model container [2025-03-17 14:12:26,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:12:25" (2/3) ... [2025-03-17 14:12:26,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e024ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:12:26, skipping insertion in model container [2025-03-17 14:12:26,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:12:26" (3/3) ... [2025-03-17 14:12:26,785 INFO L128 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2025-03-17 14:12:26,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:12:26,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe014_power.opt.i that has 4 procedures, 69 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-17 14:12:26,800 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:12:26,927 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:12:26,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 70 transitions, 152 flow [2025-03-17 14:12:26,978 INFO L124 PetriNetUnfolderBase]: 2/67 cut-off events. [2025-03-17 14:12:26,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:26,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 67 events. 2/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 229 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-17 14:12:26,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 70 transitions, 152 flow [2025-03-17 14:12:26,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 67 transitions, 143 flow [2025-03-17 14:12:26,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:12:26,999 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6afb60b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:12:26,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-17 14:12:27,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:12:27,003 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-17 14:12:27,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:27,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:27,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:12:27,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:27,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash 21712235, now seen corresponding path program 1 times [2025-03-17 14:12:27,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:27,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885688889] [2025-03-17 14:12:27,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:27,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:27,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:12:27,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:12:27,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:12:27,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:27,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:27,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:12:27,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:27,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:27,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885688889] [2025-03-17 14:12:27,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885688889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:27,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:27,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:27,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128139346] [2025-03-17 14:12:27,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:27,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:27,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:27,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:27,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:27,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:27,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:27,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:27,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:29,421 INFO L124 PetriNetUnfolderBase]: 13427/20342 cut-off events. [2025-03-17 14:12:29,421 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-17 14:12:29,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39265 conditions, 20342 events. 13427/20342 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 136346 event pairs, 13427 based on Foata normal form. 756/17046 useless extension candidates. Maximal degree in co-relation 39254. Up to 18818 conditions per place. [2025-03-17 14:12:29,580 INFO L140 encePairwiseOnDemand]: 48/70 looper letters, 37 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-03-17 14:12:29,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 175 flow [2025-03-17 14:12:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-17 14:12:29,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2025-03-17 14:12:29,594 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 143 flow. Second operand 3 states and 89 transitions. [2025-03-17 14:12:29,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 175 flow [2025-03-17 14:12:29,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:12:29,602 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2025-03-17 14:12:29,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-03-17 14:12:29,607 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -21 predicate places. [2025-03-17 14:12:29,607 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2025-03-17 14:12:29,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:29,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:29,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:12:29,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:12:29,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:29,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:29,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash 21712236, now seen corresponding path program 1 times [2025-03-17 14:12:29,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:29,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901824552] [2025-03-17 14:12:29,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:29,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:29,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:29,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:12:29,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:12:29,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:12:29,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:29,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:29,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:12:29,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:29,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:29,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:29,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901824552] [2025-03-17 14:12:29,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901824552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:29,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:29,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:29,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221254219] [2025-03-17 14:12:29,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:29,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:29,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:29,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:29,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:29,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:29,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:29,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:30,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:30,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:30,861 INFO L124 PetriNetUnfolderBase]: 7511/11637 cut-off events. [2025-03-17 14:12:30,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:30,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22347 conditions, 11637 events. 7511/11637 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 73446 event pairs, 7511 based on Foata normal form. 0/10696 useless extension candidates. Maximal degree in co-relation 22341. Up to 10620 conditions per place. [2025-03-17 14:12:30,918 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 32 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-03-17 14:12:30,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 154 flow [2025-03-17 14:12:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-17 14:12:30,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3238095238095238 [2025-03-17 14:12:30,920 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 68 transitions. [2025-03-17 14:12:30,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 154 flow [2025-03-17 14:12:30,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:12:30,920 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 89 flow [2025-03-17 14:12:30,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-17 14:12:30,921 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-03-17 14:12:30,921 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 89 flow [2025-03-17 14:12:30,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:30,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:30,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:30,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:12:31,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:31,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1067480736, now seen corresponding path program 1 times [2025-03-17 14:12:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672420423] [2025-03-17 14:12:31,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:31,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:31,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:31,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:31,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:12:31,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:12:31,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:12:31,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:31,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:31,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:12:31,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:31,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:31,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:31,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672420423] [2025-03-17 14:12:31,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672420423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:31,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:31,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188813708] [2025-03-17 14:12:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:31,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:31,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:31,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:31,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:31,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:31,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:31,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:31,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:32,091 INFO L124 PetriNetUnfolderBase]: 6395/9369 cut-off events. [2025-03-17 14:12:32,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:32,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18532 conditions, 9369 events. 6395/9369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 54589 event pairs, 1931 based on Foata normal form. 0/8932 useless extension candidates. Maximal degree in co-relation 18525. Up to 6193 conditions per place. [2025-03-17 14:12:32,128 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-17 14:12:32,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2025-03-17 14:12:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-17 14:12:32,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-17 14:12:32,130 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 89 flow. Second operand 3 states and 84 transitions. [2025-03-17 14:12:32,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2025-03-17 14:12:32,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:12:32,131 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 88 flow [2025-03-17 14:12:32,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-03-17 14:12:32,132 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-03-17 14:12:32,132 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 88 flow [2025-03-17 14:12:32,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:32,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:32,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:32,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:12:32,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:32,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:32,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash -710811670, now seen corresponding path program 1 times [2025-03-17 14:12:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754680161] [2025-03-17 14:12:32,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:32,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:32,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:32,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:32,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:12:32,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:12:32,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:12:32,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:32,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:12:32,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:32,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:32,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:32,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754680161] [2025-03-17 14:12:32,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754680161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:32,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:32,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602408482] [2025-03-17 14:12:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:32,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:32,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:32,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:32,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:32,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:32,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:32,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:32,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:32,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:33,139 INFO L124 PetriNetUnfolderBase]: 5663/8200 cut-off events. [2025-03-17 14:12:33,140 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-03-17 14:12:33,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16728 conditions, 8200 events. 5663/8200 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 46519 event pairs, 803 based on Foata normal form. 0/7838 useless extension candidates. Maximal degree in co-relation 16720. Up to 7199 conditions per place. [2025-03-17 14:12:33,166 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-17 14:12:33,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 244 flow [2025-03-17 14:12:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-17 14:12:33,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-17 14:12:33,168 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 85 transitions. [2025-03-17 14:12:33,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 244 flow [2025-03-17 14:12:33,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:12:33,170 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2025-03-17 14:12:33,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-03-17 14:12:33,170 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-03-17 14:12:33,170 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2025-03-17 14:12:33,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:33,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:33,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:33,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:12:33,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:33,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash -190146695, now seen corresponding path program 1 times [2025-03-17 14:12:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:33,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025444151] [2025-03-17 14:12:33,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:33,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:33,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:33,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:12:33,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:12:33,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:12:33,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:33,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:33,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:12:33,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:33,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:33,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:33,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025444151] [2025-03-17 14:12:33,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025444151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:33,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:33,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:12:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938448483] [2025-03-17 14:12:33,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:33,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:12:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:33,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:12:33,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:12:33,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:33,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:33,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:33,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:33,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:34,130 INFO L124 PetriNetUnfolderBase]: 5219/7576 cut-off events. [2025-03-17 14:12:34,130 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-03-17 14:12:34,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15953 conditions, 7576 events. 5219/7576 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 42745 event pairs, 659 based on Foata normal form. 0/7574 useless extension candidates. Maximal degree in co-relation 15944. Up to 6574 conditions per place. [2025-03-17 14:12:34,150 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-03-17 14:12:34,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 242 flow [2025-03-17 14:12:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:12:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:12:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-17 14:12:34,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-03-17 14:12:34,151 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 93 transitions. [2025-03-17 14:12:34,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 242 flow [2025-03-17 14:12:34,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:12:34,155 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2025-03-17 14:12:34,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2025-03-17 14:12:34,156 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2025-03-17 14:12:34,156 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2025-03-17 14:12:34,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:34,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:34,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:34,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:12:34,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:34,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:34,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash -190146694, now seen corresponding path program 1 times [2025-03-17 14:12:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:34,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676392563] [2025-03-17 14:12:34,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:34,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:34,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:34,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:34,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:12:34,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:12:34,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:12:34,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:34,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:34,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:12:34,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:34,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:34,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:34,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676392563] [2025-03-17 14:12:34,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676392563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:12:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407583971] [2025-03-17 14:12:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:34,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:12:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:34,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:12:34,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:12:34,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:34,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:34,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:34,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:34,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:35,029 INFO L124 PetriNetUnfolderBase]: 4775/6952 cut-off events. [2025-03-17 14:12:35,030 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-03-17 14:12:35,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14525 conditions, 6952 events. 4775/6952 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 39119 event pairs, 515 based on Foata normal form. 180/7130 useless extension candidates. Maximal degree in co-relation 14516. Up to 5950 conditions per place. [2025-03-17 14:12:35,053 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 49 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-03-17 14:12:35,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 236 flow [2025-03-17 14:12:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:12:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:12:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-17 14:12:35,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2025-03-17 14:12:35,055 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 92 transitions. [2025-03-17 14:12:35,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 236 flow [2025-03-17 14:12:35,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:12:35,056 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2025-03-17 14:12:35,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-03-17 14:12:35,056 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2025-03-17 14:12:35,056 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2025-03-17 14:12:35,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:35,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:35,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:35,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:12:35,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:35,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1908882356, now seen corresponding path program 1 times [2025-03-17 14:12:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521927943] [2025-03-17 14:12:35,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:35,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:35,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:35,259 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:35,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:12:35,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:12:35,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:12:35,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:35,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:35,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:12:35,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:35,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:35,360 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:35,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521927943] [2025-03-17 14:12:35,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521927943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:35,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:35,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:12:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769954130] [2025-03-17 14:12:35,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:35,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:12:35,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:35,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:12:35,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:12:35,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2025-03-17 14:12:35,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:35,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:35,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2025-03-17 14:12:35,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:35,788 INFO L124 PetriNetUnfolderBase]: 4775/7461 cut-off events. [2025-03-17 14:12:35,788 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-03-17 14:12:35,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15033 conditions, 7461 events. 4775/7461 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 44025 event pairs, 4775 based on Foata normal form. 216/7672 useless extension candidates. Maximal degree in co-relation 15025. Up to 6804 conditions per place. [2025-03-17 14:12:35,808 INFO L140 encePairwiseOnDemand]: 68/70 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-03-17 14:12:35,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 141 flow [2025-03-17 14:12:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:12:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:12:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-17 14:12:35,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2025-03-17 14:12:35,809 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 57 transitions. [2025-03-17 14:12:35,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 141 flow [2025-03-17 14:12:35,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:12:35,810 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2025-03-17 14:12:35,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-03-17 14:12:35,811 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -27 predicate places. [2025-03-17 14:12:35,811 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2025-03-17 14:12:35,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:35,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:35,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:35,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:12:36,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:36,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:36,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:36,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1908884197, now seen corresponding path program 1 times [2025-03-17 14:12:36,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:36,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314282259] [2025-03-17 14:12:36,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:36,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:36,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:36,014 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:36,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:12:36,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:12:36,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:12:36,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:36,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:36,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:12:36,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:36,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:36,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:36,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314282259] [2025-03-17 14:12:36,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314282259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:36,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:36,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:12:36,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635324881] [2025-03-17 14:12:36,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:36,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:12:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:36,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:12:36,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:12:36,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:36,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:36,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:36,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:36,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:36,513 INFO L124 PetriNetUnfolderBase]: 3471/5581 cut-off events. [2025-03-17 14:12:36,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:12:36,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11273 conditions, 5581 events. 3471/5581 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 32874 event pairs, 535 based on Foata normal form. 216/5792 useless extension candidates. Maximal degree in co-relation 11265. Up to 3001 conditions per place. [2025-03-17 14:12:36,531 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 55 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2025-03-17 14:12:36,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 276 flow [2025-03-17 14:12:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:12:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:12:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-03-17 14:12:36,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2025-03-17 14:12:36,532 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 103 transitions. [2025-03-17 14:12:36,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 276 flow [2025-03-17 14:12:36,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:12:36,533 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2025-03-17 14:12:36,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-03-17 14:12:36,534 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -24 predicate places. [2025-03-17 14:12:36,534 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2025-03-17 14:12:36,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:36,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:36,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:36,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:12:36,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:36,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash -915415997, now seen corresponding path program 1 times [2025-03-17 14:12:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:36,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981348009] [2025-03-17 14:12:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:36,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:36,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:12:36,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:12:36,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:12:36,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:36,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:36,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:12:36,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:36,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:36,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:36,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981348009] [2025-03-17 14:12:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981348009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:36,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:12:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653722735] [2025-03-17 14:12:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:36,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:12:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:36,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:12:36,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:12:36,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:36,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:36,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:36,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:36,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:37,140 INFO L124 PetriNetUnfolderBase]: 1935/3117 cut-off events. [2025-03-17 14:12:37,140 INFO L125 PetriNetUnfolderBase]: For 604/604 co-relation queries the response was YES. [2025-03-17 14:12:37,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7316 conditions, 3117 events. 1935/3117 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15761 event pairs, 339 based on Foata normal form. 152/3264 useless extension candidates. Maximal degree in co-relation 7305. Up to 985 conditions per place. [2025-03-17 14:12:37,150 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 70 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-03-17 14:12:37,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 394 flow [2025-03-17 14:12:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:12:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:12:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-17 14:12:37,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3742857142857143 [2025-03-17 14:12:37,151 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 131 transitions. [2025-03-17 14:12:37,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 394 flow [2025-03-17 14:12:37,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 384 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:12:37,153 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2025-03-17 14:12:37,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-03-17 14:12:37,154 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2025-03-17 14:12:37,154 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2025-03-17 14:12:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:37,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:37,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:37,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:12:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:37,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:37,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1405050533, now seen corresponding path program 1 times [2025-03-17 14:12:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263810299] [2025-03-17 14:12:37,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:37,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:37,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:37,362 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:37,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:12:37,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:12:37,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:12:37,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:37,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:37,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:12:37,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:37,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:37,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263810299] [2025-03-17 14:12:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263810299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:12:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47884599] [2025-03-17 14:12:37,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:37,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:12:37,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:37,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:12:37,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:12:37,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:37,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:37,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:37,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:37,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:37,769 INFO L124 PetriNetUnfolderBase]: 1167/1821 cut-off events. [2025-03-17 14:12:37,769 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2025-03-17 14:12:37,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 1821 events. 1167/1821 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7969 event pairs, 303 based on Foata normal form. 56/1872 useless extension candidates. Maximal degree in co-relation 4735. Up to 672 conditions per place. [2025-03-17 14:12:37,775 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 59 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2025-03-17 14:12:37,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 383 flow [2025-03-17 14:12:37,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:12:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:12:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-17 14:12:37,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2025-03-17 14:12:37,776 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 133 transitions. [2025-03-17 14:12:37,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 383 flow [2025-03-17 14:12:37,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 358 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-17 14:12:37,782 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2025-03-17 14:12:37,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-03-17 14:12:37,783 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2025-03-17 14:12:37,783 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2025-03-17 14:12:37,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:37,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:37,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:37,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:12:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:37,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:37,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1140102856, now seen corresponding path program 1 times [2025-03-17 14:12:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470811007] [2025-03-17 14:12:37,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:12:37,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:37,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:37,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:37,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:12:38,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:12:38,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:38,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:38,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:38,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:12:38,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:38,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:38,206 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:38,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470811007] [2025-03-17 14:12:38,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470811007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:38,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:12:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549353087] [2025-03-17 14:12:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:38,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:12:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:38,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:12:38,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:12:38,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:38,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:38,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:38,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:38,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:38,611 INFO L124 PetriNetUnfolderBase]: 1641/2567 cut-off events. [2025-03-17 14:12:38,612 INFO L125 PetriNetUnfolderBase]: For 1828/1828 co-relation queries the response was YES. [2025-03-17 14:12:38,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 2567 events. 1641/2567 cut-off events. For 1828/1828 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12010 event pairs, 397 based on Foata normal form. 8/2570 useless extension candidates. Maximal degree in co-relation 6757. Up to 1185 conditions per place. [2025-03-17 14:12:38,621 INFO L140 encePairwiseOnDemand]: 59/70 looper letters, 50 selfloop transitions, 8 changer transitions 54/118 dead transitions. [2025-03-17 14:12:38,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 118 transitions, 659 flow [2025-03-17 14:12:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:12:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:12:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2025-03-17 14:12:38,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2957142857142857 [2025-03-17 14:12:38,622 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 10 states and 207 transitions. [2025-03-17 14:12:38,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 118 transitions, 659 flow [2025-03-17 14:12:38,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 534 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-17 14:12:38,631 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 165 flow [2025-03-17 14:12:38,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=165, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2025-03-17 14:12:38,631 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2025-03-17 14:12:38,632 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 165 flow [2025-03-17 14:12:38,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:38,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:38,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:38,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:12:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:38,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:38,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1623769852, now seen corresponding path program 2 times [2025-03-17 14:12:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683876410] [2025-03-17 14:12:38,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:12:38,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:38,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:38,835 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:38,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:12:38,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:12:38,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:38,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:12:38,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:38,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:12:38,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:39,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:39,073 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683876410] [2025-03-17 14:12:39,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683876410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:39,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:39,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:12:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692169427] [2025-03-17 14:12:39,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:39,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:12:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:39,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:12:39,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:12:39,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:39,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 165 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:39,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:39,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:39,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:39,425 INFO L124 PetriNetUnfolderBase]: 1517/2386 cut-off events. [2025-03-17 14:12:39,425 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2025-03-17 14:12:39,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6171 conditions, 2386 events. 1517/2386 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11174 event pairs, 305 based on Foata normal form. 8/2390 useless extension candidates. Maximal degree in co-relation 6154. Up to 1185 conditions per place. [2025-03-17 14:12:39,433 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 51 selfloop transitions, 9 changer transitions 43/109 dead transitions. [2025-03-17 14:12:39,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 563 flow [2025-03-17 14:12:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:12:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:12:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2025-03-17 14:12:39,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2025-03-17 14:12:39,435 INFO L175 Difference]: Start difference. First operand has 66 places, 44 transitions, 165 flow. Second operand 9 states and 186 transitions. [2025-03-17 14:12:39,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 563 flow [2025-03-17 14:12:39,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 525 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-17 14:12:39,439 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 185 flow [2025-03-17 14:12:39,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=185, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-03-17 14:12:39,440 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2025-03-17 14:12:39,440 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 185 flow [2025-03-17 14:12:39,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:39,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:39,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:39,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:12:39,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:39,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -87155644, now seen corresponding path program 3 times [2025-03-17 14:12:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138370199] [2025-03-17 14:12:39,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:12:39,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:39,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:39,644 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:39,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:12:39,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:12:39,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:39,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:12:39,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:12:39,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:12:39,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:12:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:12:39,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:12:39,802 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:12:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138370199] [2025-03-17 14:12:39,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138370199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:12:39,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:12:39,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:12:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105748750] [2025-03-17 14:12:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:12:39,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:12:39,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:12:39,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:12:39,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:12:39,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 70 [2025-03-17 14:12:39,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 185 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:39,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:12:39,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 70 [2025-03-17 14:12:39,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:12:40,083 INFO L124 PetriNetUnfolderBase]: 1659/2602 cut-off events. [2025-03-17 14:12:40,083 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2025-03-17 14:12:40,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 2602 events. 1659/2602 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12246 event pairs, 269 based on Foata normal form. 8/2606 useless extension candidates. Maximal degree in co-relation 7050. Up to 1280 conditions per place. [2025-03-17 14:12:40,091 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 56 selfloop transitions, 4 changer transitions 27/93 dead transitions. [2025-03-17 14:12:40,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 527 flow [2025-03-17 14:12:40,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:12:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:12:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-17 14:12:40,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30238095238095236 [2025-03-17 14:12:40,092 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 185 flow. Second operand 6 states and 127 transitions. [2025-03-17 14:12:40,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 527 flow [2025-03-17 14:12:40,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 500 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-17 14:12:40,095 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 180 flow [2025-03-17 14:12:40,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2025-03-17 14:12:40,095 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2025-03-17 14:12:40,095 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 180 flow [2025-03-17 14:12:40,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:12:40,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:12:40,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:40,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 14:12:40,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:40,296 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-17 14:12:40,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:12:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2061982952, now seen corresponding path program 4 times [2025-03-17 14:12:40,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:12:40,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245556782] [2025-03-17 14:12:40,297 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:12:40,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:40,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:12:40,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:12:40,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:12:40,374 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:12:40,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:40,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:12:40,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:12:40,413 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:12:40,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:12:40,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:12:40,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:12:40,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:12:40,501 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 14:12:40,501 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:12:40,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2025-03-17 14:12:40,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONMEMORY_LEAK (35 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2025-03-17 14:12:40,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONMEMORY_LEAK (4 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2025-03-17 14:12:40,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2025-03-17 14:12:40,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2025-03-17 14:12:40,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:12:40,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:12:40,708 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:12:40,781 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:12:40,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:12:40,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:12:40 BasicIcfg [2025-03-17 14:12:40,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:12:40,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:12:40,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:12:40,786 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:12:40,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:12:26" (3/4) ... [2025-03-17 14:12:40,787 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:12:40,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:12:40,788 INFO L158 Benchmark]: Toolchain (without parser) took 15392.61ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 91.1MB in the beginning and 1.1GB in the end (delta: -963.3MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB. [2025-03-17 14:12:40,789 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:12:40,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.70ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 66.9MB in the end (delta: 24.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:12:40,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.52ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 64.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:12:40,789 INFO L158 Benchmark]: Boogie Preprocessor took 49.12ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 61.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:12:40,789 INFO L158 Benchmark]: IcfgBuilder took 930.33ms. Allocated memory is still 117.4MB. Free memory was 61.2MB in the beginning and 38.0MB in the end (delta: 23.2MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2025-03-17 14:12:40,789 INFO L158 Benchmark]: TraceAbstraction took 14005.23ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 37.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 345.8MB. Max. memory is 16.1GB. [2025-03-17 14:12:40,790 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 94.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:12:40,790 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.33ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.70ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 66.9MB in the end (delta: 24.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.52ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 64.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.12ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 61.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 930.33ms. Allocated memory is still 117.4MB. Free memory was 61.2MB in the beginning and 38.0MB in the end (delta: 23.2MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14005.23ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 37.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 345.8MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 94.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L846] 0 pthread_t t2101; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-2, t2101=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L848] 0 pthread_t t2102; [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-2, t2101=-1, t2102=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-2, t2101=-1, t2102=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-2, t2101=-1, t2102=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-2, t2101=-1, t2102=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 114 locations, 112 edges, 53 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 599 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1748 IncrementalHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 1 mSDtfsCounter, 1748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=12, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 991 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1644 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:12:40,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample