./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:31:49,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:31:49,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:31:49,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:31:49,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:31:49,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:31:49,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:31:49,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:31:49,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:31:49,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:31:49,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:31:49,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:31:49,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:31:49,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:31:49,349 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:31:49,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:31:49,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:31:49,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:31:49,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:31:49,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:31:49,351 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:31:49,351 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:31:49,352 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:31:49,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:31:49,352 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:31:49,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:31:49,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:31:49,353 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:31:49,353 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:31:49,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:31:49,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:31:49,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:31:49,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:31:49,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:49,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:31:49,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:31:49,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:31:49,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:31:49,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:31:49,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:31:49,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:31:49,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:31:49,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-11-09 10:31:49,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:31:49,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:31:49,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:31:49,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:31:49,578 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:31:49,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-09 10:31:50,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:31:51,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:31:51,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-09 10:31:51,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d75647d/3064d3b3176c45f4aa96c9c1bd370706/FLAG0fe3e5238 [2024-11-09 10:31:51,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d75647d/3064d3b3176c45f4aa96c9c1bd370706 [2024-11-09 10:31:51,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:31:51,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:31:51,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:51,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:31:51,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:31:51,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748b14cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51, skipping insertion in model container [2024-11-09 10:31:51,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:31:51,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:51,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:31:51,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:51,812 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:31:51,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51 WrapperNode [2024-11-09 10:31:51,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:51,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:51,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:31:51,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:31:51,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,892 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-09 10:31:51,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:51,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:31:51,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:31:51,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:31:51,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:31:51,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:51,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:31:51,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:31:51,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:31:51,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:31:51,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (1/1) ... [2024-11-09 10:31:52,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:52,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:31:52,038 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) [2024-11-09 10:31:52,040 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 [2024-11-09 10:31:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:31:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:31:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:31:52,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:31:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:31:52,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:31:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:31:52,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:31:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:31:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:31:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:31:52,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:31:52,081 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:31:52,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:31:52,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:31:52,379 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:31:52,379 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:31:52,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:31:52,532 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:31:52,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:52 BoogieIcfgContainer [2024-11-09 10:31:52,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:31:52,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:31:52,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:31:52,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:31:52,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:31:51" (1/3) ... [2024-11-09 10:31:52,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4c364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:31:52, skipping insertion in model container [2024-11-09 10:31:52,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:51" (2/3) ... [2024-11-09 10:31:52,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4c364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:31:52, skipping insertion in model container [2024-11-09 10:31:52,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:52" (3/3) ... [2024-11-09 10:31:52,576 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-09 10:31:52,626 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:31:52,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:31:52,629 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:31:52,680 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:31:52,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-09 10:31:52,730 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-09 10:31:52,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:52,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-09 10:31:52,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-09 10:31:52,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-09 10:31:52,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:31:52,761 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;@6bf7b427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:31:52,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:31:52,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:31:52,770 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-09 10:31:52,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:52,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:52,771 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:52,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:52,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -655888620, now seen corresponding path program 1 times [2024-11-09 10:31:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655059956] [2024-11-09 10:31:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:53,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655059956] [2024-11-09 10:31:53,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655059956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:53,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:53,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:31:53,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058862888] [2024-11-09 10:31:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:53,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:31:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:53,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:31:53,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:31:53,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-11-09 10:31:53,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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) [2024-11-09 10:31:53,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:53,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-11-09 10:31:53,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:53,434 INFO L124 PetriNetUnfolderBase]: 407/797 cut-off events. [2024-11-09 10:31:53,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 797 events. 407/797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5335 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1449. Up to 496 conditions per place. [2024-11-09 10:31:53,461 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-09 10:31:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 167 flow [2024-11-09 10:31:53,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:31:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:31:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-09 10:31:53,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2024-11-09 10:31:53,476 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 96 transitions. [2024-11-09 10:31:53,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 167 flow [2024-11-09 10:31:53,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:31:53,482 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-09 10:31:53,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-09 10:31:53,504 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-09 10:31:53,504 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-09 10:31:53,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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) [2024-11-09 10:31:53,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:53,505 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:31:53,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash 560481029, now seen corresponding path program 1 times [2024-11-09 10:31:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832492871] [2024-11-09 10:31:53,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:53,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832492871] [2024-11-09 10:31:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832492871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:53,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:31:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511154612] [2024-11-09 10:31:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:53,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:31:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:31:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:31:53,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-09 10:31:53,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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) [2024-11-09 10:31:53,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:53,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-09 10:31:53,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:53,710 INFO L124 PetriNetUnfolderBase]: 361/697 cut-off events. [2024-11-09 10:31:53,711 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:31:53,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 697 events. 361/697 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4744 event pairs, 361 based on Foata normal form. 24/696 useless extension candidates. Maximal degree in co-relation 1327. Up to 570 conditions per place. [2024-11-09 10:31:53,716 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-09 10:31:53,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 118 flow [2024-11-09 10:31:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:31:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:31:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-09 10:31:53,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-09 10:31:53,718 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 77 transitions. [2024-11-09 10:31:53,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 118 flow [2024-11-09 10:31:53,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:31:53,719 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-09 10:31:53,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-09 10:31:53,720 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-09 10:31:53,720 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-09 10:31:53,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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) [2024-11-09 10:31:53,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:53,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:53,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:31:53,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 560482423, now seen corresponding path program 1 times [2024-11-09 10:31:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:53,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497645142] [2024-11-09 10:31:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497645142] [2024-11-09 10:31:54,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497645142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:54,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:54,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:31:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913746712] [2024-11-09 10:31:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:31:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:54,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:31:54,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:31:54,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-09 10:31:54,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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) [2024-11-09 10:31:54,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:54,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-09 10:31:54,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:54,409 INFO L124 PetriNetUnfolderBase]: 1047/1956 cut-off events. [2024-11-09 10:31:54,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:54,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1956 events. 1047/1956 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12986 event pairs, 255 based on Foata normal form. 0/1885 useless extension candidates. Maximal degree in co-relation 3576. Up to 1012 conditions per place. [2024-11-09 10:31:54,431 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 29 selfloop transitions, 3 changer transitions 40/85 dead transitions. [2024-11-09 10:31:54,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 326 flow [2024-11-09 10:31:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:31:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:31:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-11-09 10:31:54,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5965909090909091 [2024-11-09 10:31:54,433 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 210 transitions. [2024-11-09 10:31:54,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 326 flow [2024-11-09 10:31:54,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:31:54,436 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 108 flow [2024-11-09 10:31:54,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-11-09 10:31:54,438 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-09 10:31:54,438 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 108 flow [2024-11-09 10:31:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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) [2024-11-09 10:31:54,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:54,438 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:31:54,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1020262390, now seen corresponding path program 1 times [2024-11-09 10:31:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934093666] [2024-11-09 10:31:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:55,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934093666] [2024-11-09 10:31:55,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934093666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:55,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:55,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:31:55,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112191374] [2024-11-09 10:31:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:55,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:31:55,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:55,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:31:55,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:31:55,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-09 10:31:55,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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) [2024-11-09 10:31:55,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:55,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-09 10:31:55,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:55,685 INFO L124 PetriNetUnfolderBase]: 2043/3634 cut-off events. [2024-11-09 10:31:55,686 INFO L125 PetriNetUnfolderBase]: For 2302/2302 co-relation queries the response was YES. [2024-11-09 10:31:55,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8614 conditions, 3634 events. 2043/3634 cut-off events. For 2302/2302 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 25604 event pairs, 275 based on Foata normal form. 113/3740 useless extension candidates. Maximal degree in co-relation 8602. Up to 1617 conditions per place. [2024-11-09 10:31:55,705 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 43 selfloop transitions, 12 changer transitions 55/121 dead transitions. [2024-11-09 10:31:55,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 121 transitions, 636 flow [2024-11-09 10:31:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:31:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:31:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions. [2024-11-09 10:31:55,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5840909090909091 [2024-11-09 10:31:55,707 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 108 flow. Second operand 10 states and 257 transitions. [2024-11-09 10:31:55,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 121 transitions, 636 flow [2024-11-09 10:31:55,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 121 transitions, 615 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-09 10:31:55,724 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 247 flow [2024-11-09 10:31:55,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-11-09 10:31:55,725 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-11-09 10:31:55,725 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 247 flow [2024-11-09 10:31:55,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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) [2024-11-09 10:31:55,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:55,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:55,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:31:55,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:55,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1934505525, now seen corresponding path program 1 times [2024-11-09 10:31:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:55,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774938031] [2024-11-09 10:31:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:55,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774938031] [2024-11-09 10:31:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774938031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:56,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:56,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:31:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429723611] [2024-11-09 10:31:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:56,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:31:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:31:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:31:56,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-09 10:31:56,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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) [2024-11-09 10:31:56,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:56,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-09 10:31:56,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:56,551 INFO L124 PetriNetUnfolderBase]: 1445/2807 cut-off events. [2024-11-09 10:31:56,552 INFO L125 PetriNetUnfolderBase]: For 6760/6781 co-relation queries the response was YES. [2024-11-09 10:31:56,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 2807 events. 1445/2807 cut-off events. For 6760/6781 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20580 event pairs, 360 based on Foata normal form. 78/2789 useless extension candidates. Maximal degree in co-relation 9331. Up to 1475 conditions per place. [2024-11-09 10:31:56,567 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 4 changer transitions 29/83 dead transitions. [2024-11-09 10:31:56,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 555 flow [2024-11-09 10:31:56,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:31:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:31:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-11-09 10:31:56,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-09 10:31:56,569 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 247 flow. Second operand 7 states and 175 transitions. [2024-11-09 10:31:56,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 555 flow [2024-11-09 10:31:56,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 543 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-09 10:31:56,580 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 261 flow [2024-11-09 10:31:56,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=7, PETRI_FLOW=261, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2024-11-09 10:31:56,581 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-11-09 10:31:56,581 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 261 flow [2024-11-09 10:31:56,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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) [2024-11-09 10:31:56,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:56,582 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:56,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:31:56,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:56,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:56,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1084705576, now seen corresponding path program 1 times [2024-11-09 10:31:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52048954] [2024-11-09 10:31:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:56,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:56,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52048954] [2024-11-09 10:31:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52048954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:31:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654627067] [2024-11-09 10:31:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:56,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:31:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:31:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:31:56,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-09 10:31:56,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2024-11-09 10:31:56,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:56,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-09 10:31:56,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:57,086 INFO L124 PetriNetUnfolderBase]: 2747/4642 cut-off events. [2024-11-09 10:31:57,087 INFO L125 PetriNetUnfolderBase]: For 8356/8657 co-relation queries the response was YES. [2024-11-09 10:31:57,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14169 conditions, 4642 events. 2747/4642 cut-off events. For 8356/8657 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30640 event pairs, 444 based on Foata normal form. 205/4677 useless extension candidates. Maximal degree in co-relation 14144. Up to 2523 conditions per place. [2024-11-09 10:31:57,114 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-09 10:31:57,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 513 flow [2024-11-09 10:31:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:31:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:31:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-09 10:31:57,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-11-09 10:31:57,118 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 261 flow. Second operand 4 states and 109 transitions. [2024-11-09 10:31:57,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 513 flow [2024-11-09 10:31:57,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 485 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-09 10:31:57,128 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 283 flow [2024-11-09 10:31:57,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-09 10:31:57,129 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-11-09 10:31:57,129 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 283 flow [2024-11-09 10:31:57,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2024-11-09 10:31:57,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:57,130 INFO L204 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] [2024-11-09 10:31:57,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:31:57,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:57,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1960827456, now seen corresponding path program 1 times [2024-11-09 10:31:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:57,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231180761] [2024-11-09 10:31:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:57,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:57,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231180761] [2024-11-09 10:31:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231180761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:57,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:31:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560313031] [2024-11-09 10:31:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:57,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:31:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:31:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:31:57,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-09 10:31:57,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2024-11-09 10:31:57,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:57,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-09 10:31:57,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:57,871 INFO L124 PetriNetUnfolderBase]: 2768/5123 cut-off events. [2024-11-09 10:31:57,871 INFO L125 PetriNetUnfolderBase]: For 9376/9573 co-relation queries the response was YES. [2024-11-09 10:31:57,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16879 conditions, 5123 events. 2768/5123 cut-off events. For 9376/9573 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 38652 event pairs, 900 based on Foata normal form. 151/4940 useless extension candidates. Maximal degree in co-relation 16856. Up to 1814 conditions per place. [2024-11-09 10:31:57,907 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 10 changer transitions 18/94 dead transitions. [2024-11-09 10:31:57,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 668 flow [2024-11-09 10:31:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:31:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:31:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-11-09 10:31:57,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-11-09 10:31:57,908 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 283 flow. Second operand 7 states and 182 transitions. [2024-11-09 10:31:57,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 668 flow [2024-11-09 10:31:57,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 658 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-09 10:31:57,914 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 362 flow [2024-11-09 10:31:57,914 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-11-09 10:31:57,915 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2024-11-09 10:31:57,915 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 362 flow [2024-11-09 10:31:57,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2024-11-09 10:31:57,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:57,915 INFO L204 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] [2024-11-09 10:31:57,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:31:57,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:57,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1523089990, now seen corresponding path program 1 times [2024-11-09 10:31:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184511789] [2024-11-09 10:31:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:58,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184511789] [2024-11-09 10:31:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184511789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:58,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:58,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:31:58,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218351734] [2024-11-09 10:31:58,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:58,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:31:58,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:58,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:31:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:31:58,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-09 10:31:58,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 362 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:58,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:58,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-09 10:31:58,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:59,260 INFO L124 PetriNetUnfolderBase]: 3143/5863 cut-off events. [2024-11-09 10:31:59,260 INFO L125 PetriNetUnfolderBase]: For 15744/16010 co-relation queries the response was YES. [2024-11-09 10:31:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20534 conditions, 5863 events. 3143/5863 cut-off events. For 15744/16010 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 45925 event pairs, 1024 based on Foata normal form. 146/5677 useless extension candidates. Maximal degree in co-relation 20506. Up to 3253 conditions per place. [2024-11-09 10:31:59,297 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 47 selfloop transitions, 14 changer transitions 17/104 dead transitions. [2024-11-09 10:31:59,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 794 flow [2024-11-09 10:31:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:31:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:31:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-11-09 10:31:59,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-09 10:31:59,299 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 362 flow. Second operand 9 states and 225 transitions. [2024-11-09 10:31:59,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 794 flow [2024-11-09 10:31:59,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 104 transitions, 765 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-09 10:31:59,326 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 493 flow [2024-11-09 10:31:59,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=493, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-11-09 10:31:59,327 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-11-09 10:31:59,327 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 493 flow [2024-11-09 10:31:59,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:59,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:59,327 INFO L204 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] [2024-11-09 10:31:59,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:31:59,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:31:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash 999921068, now seen corresponding path program 2 times [2024-11-09 10:31:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:59,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206575856] [2024-11-09 10:31:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206575856] [2024-11-09 10:31:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206575856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:59,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:59,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:31:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696138370] [2024-11-09 10:31:59,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:59,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:31:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:31:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:31:59,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-09 10:31:59,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 493 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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) [2024-11-09 10:31:59,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:59,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-09 10:31:59,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:00,060 INFO L124 PetriNetUnfolderBase]: 3176/5214 cut-off events. [2024-11-09 10:32:00,061 INFO L125 PetriNetUnfolderBase]: For 18781/19828 co-relation queries the response was YES. [2024-11-09 10:32:00,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19524 conditions, 5214 events. 3176/5214 cut-off events. For 18781/19828 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33739 event pairs, 247 based on Foata normal form. 362/5343 useless extension candidates. Maximal degree in co-relation 19490. Up to 1893 conditions per place. [2024-11-09 10:32:00,087 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 63 selfloop transitions, 8 changer transitions 22/111 dead transitions. [2024-11-09 10:32:00,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 1012 flow [2024-11-09 10:32:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:32:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:32:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-09 10:32:00,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-09 10:32:00,090 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 493 flow. Second operand 5 states and 138 transitions. [2024-11-09 10:32:00,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 1012 flow [2024-11-09 10:32:00,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 970 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-11-09 10:32:00,113 INFO L231 Difference]: Finished difference. Result has 87 places, 55 transitions, 386 flow [2024-11-09 10:32:00,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=87, PETRI_TRANSITIONS=55} [2024-11-09 10:32:00,114 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-09 10:32:00,114 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 55 transitions, 386 flow [2024-11-09 10:32:00,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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) [2024-11-09 10:32:00,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:00,114 INFO L204 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] [2024-11-09 10:32:00,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:32:00,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:00,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1178824607, now seen corresponding path program 1 times [2024-11-09 10:32:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:32:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836218873] [2024-11-09 10:32:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:32:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:32:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836218873] [2024-11-09 10:32:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836218873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:00,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:00,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:32:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807868063] [2024-11-09 10:32:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:00,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:00,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:32:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:00,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:00,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-09 10:32:00,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 55 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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) [2024-11-09 10:32:00,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:00,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-09 10:32:00,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:01,019 INFO L124 PetriNetUnfolderBase]: 2192/3650 cut-off events. [2024-11-09 10:32:01,020 INFO L125 PetriNetUnfolderBase]: For 15253/16678 co-relation queries the response was YES. [2024-11-09 10:32:01,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 3650 events. 2192/3650 cut-off events. For 15253/16678 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 23871 event pairs, 197 based on Foata normal form. 265/3714 useless extension candidates. Maximal degree in co-relation 14682. Up to 1616 conditions per place. [2024-11-09 10:32:01,044 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 57 selfloop transitions, 11 changer transitions 6/90 dead transitions. [2024-11-09 10:32:01,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 740 flow [2024-11-09 10:32:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-11-09 10:32:01,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2024-11-09 10:32:01,046 INFO L175 Difference]: Start difference. First operand has 87 places, 55 transitions, 386 flow. Second operand 6 states and 153 transitions. [2024-11-09 10:32:01,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 740 flow [2024-11-09 10:32:01,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 662 flow, removed 31 selfloop flow, removed 13 redundant places. [2024-11-09 10:32:01,058 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 342 flow [2024-11-09 10:32:01,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2024-11-09 10:32:01,058 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2024-11-09 10:32:01,059 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 342 flow [2024-11-09 10:32:01,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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) [2024-11-09 10:32:01,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:01,059 INFO L204 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] [2024-11-09 10:32:01,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:32:01,059 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:01,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash 826938328, now seen corresponding path program 1 times [2024-11-09 10:32:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:32:01,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639180256] [2024-11-09 10:32:01,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:32:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:01,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:32:01,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639180256] [2024-11-09 10:32:01,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639180256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:01,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:01,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:01,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431658726] [2024-11-09 10:32:01,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:01,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:01,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:32:01,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:01,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:01,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-09 10:32:01,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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) [2024-11-09 10:32:01,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:01,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-09 10:32:01,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:01,501 INFO L124 PetriNetUnfolderBase]: 916/1930 cut-off events. [2024-11-09 10:32:01,502 INFO L125 PetriNetUnfolderBase]: For 5546/5966 co-relation queries the response was YES. [2024-11-09 10:32:01,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 1930 events. 916/1930 cut-off events. For 5546/5966 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13726 event pairs, 242 based on Foata normal form. 56/1804 useless extension candidates. Maximal degree in co-relation 6625. Up to 689 conditions per place. [2024-11-09 10:32:01,514 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 23 selfloop transitions, 1 changer transitions 41/89 dead transitions. [2024-11-09 10:32:01,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 671 flow [2024-11-09 10:32:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-11-09 10:32:01,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-09 10:32:01,516 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 342 flow. Second operand 6 states and 150 transitions. [2024-11-09 10:32:01,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 671 flow [2024-11-09 10:32:01,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 557 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-11-09 10:32:01,528 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 234 flow [2024-11-09 10:32:01,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2024-11-09 10:32:01,529 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-11-09 10:32:01,529 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 234 flow [2024-11-09 10:32:01,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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) [2024-11-09 10:32:01,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:01,529 INFO L204 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] [2024-11-09 10:32:01,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:32:01,529 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:01,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash -967141076, now seen corresponding path program 2 times [2024-11-09 10:32:01,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:32:01,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230684274] [2024-11-09 10:32:01,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:01,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:32:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:32:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230684274] [2024-11-09 10:32:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230684274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:32:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082512470] [2024-11-09 10:32:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:02,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:32:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:32:02,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:32:02,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:32:02,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-09 10:32:02,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 45 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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) [2024-11-09 10:32:02,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:02,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-09 10:32:02,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:03,103 INFO L124 PetriNetUnfolderBase]: 509/1084 cut-off events. [2024-11-09 10:32:03,103 INFO L125 PetriNetUnfolderBase]: For 1429/1537 co-relation queries the response was YES. [2024-11-09 10:32:03,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1084 events. 509/1084 cut-off events. For 1429/1537 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6582 event pairs, 129 based on Foata normal form. 22/1011 useless extension candidates. Maximal degree in co-relation 3027. Up to 413 conditions per place. [2024-11-09 10:32:03,108 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 22 selfloop transitions, 7 changer transitions 34/83 dead transitions. [2024-11-09 10:32:03,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 500 flow [2024-11-09 10:32:03,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:32:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:32:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 227 transitions. [2024-11-09 10:32:03,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4690082644628099 [2024-11-09 10:32:03,109 INFO L175 Difference]: Start difference. First operand has 74 places, 45 transitions, 234 flow. Second operand 11 states and 227 transitions. [2024-11-09 10:32:03,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 500 flow [2024-11-09 10:32:03,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 463 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-11-09 10:32:03,114 INFO L231 Difference]: Finished difference. Result has 74 places, 42 transitions, 219 flow [2024-11-09 10:32:03,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=219, PETRI_PLACES=74, PETRI_TRANSITIONS=42} [2024-11-09 10:32:03,119 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-11-09 10:32:03,119 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 42 transitions, 219 flow [2024-11-09 10:32:03,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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) [2024-11-09 10:32:03,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:03,119 INFO L204 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] [2024-11-09 10:32:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:32:03,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1583802696, now seen corresponding path program 3 times [2024-11-09 10:32:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:32:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754491655] [2024-11-09 10:32:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:32:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:32:03,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:32:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:32:03,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:32:03,250 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:32:03,250 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:32:03,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:32:03,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:32:03,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:32:03,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:32:03,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-09 10:32:03,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:32:03,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:32:03,253 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:03,302 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:32:03,302 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:32:03,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:32:03 BasicIcfg [2024-11-09 10:32:03,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:32:03,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:32:03,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:32:03,311 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:32:03,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:52" (3/4) ... [2024-11-09 10:32:03,313 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:32:03,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:32:03,318 INFO L158 Benchmark]: Toolchain (without parser) took 12156.22ms. Allocated memory was 142.6MB in the beginning and 916.5MB in the end (delta: 773.8MB). Free memory was 71.1MB in the beginning and 481.6MB in the end (delta: -410.5MB). Peak memory consumption was 366.7MB. Max. memory is 16.1GB. [2024-11-09 10:32:03,319 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:32:03,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.10ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 70.8MB in the beginning and 158.9MB in the end (delta: -88.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-09 10:32:03,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.35ms. Allocated memory is still 209.7MB. Free memory was 158.9MB in the beginning and 155.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:03,319 INFO L158 Benchmark]: Boogie Preprocessor took 87.06ms. Allocated memory is still 209.7MB. Free memory was 155.8MB in the beginning and 152.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:32:03,319 INFO L158 Benchmark]: RCFGBuilder took 552.31ms. Allocated memory is still 209.7MB. Free memory was 151.6MB in the beginning and 102.4MB in the end (delta: 49.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:03,319 INFO L158 Benchmark]: TraceAbstraction took 10743.02ms. Allocated memory was 209.7MB in the beginning and 916.5MB in the end (delta: 706.7MB). Free memory was 173.9MB in the beginning and 481.6MB in the end (delta: -307.8MB). Peak memory consumption was 400.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:03,320 INFO L158 Benchmark]: Witness Printer took 7.08ms. Allocated memory is still 916.5MB. Free memory is still 481.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:32:03,321 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.14ms. Allocated memory is still 142.6MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 650.10ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 70.8MB in the beginning and 158.9MB in the end (delta: -88.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.35ms. Allocated memory is still 209.7MB. Free memory was 158.9MB in the beginning and 155.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.06ms. Allocated memory is still 209.7MB. Free memory was 155.8MB in the beginning and 152.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.31ms. Allocated memory is still 209.7MB. Free memory was 151.6MB in the beginning and 102.4MB in the end (delta: 49.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10743.02ms. Allocated memory was 209.7MB in the beginning and 916.5MB in the end (delta: 706.7MB). Free memory was 173.9MB in the beginning and 481.6MB in the end (delta: -307.8MB). Peak memory consumption was 400.2MB. Max. memory is 16.1GB. * Witness Printer took 7.08ms. Allocated memory is still 916.5MB. Free memory is still 481.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, weak$$choice0=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=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, weak$$choice0=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=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=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=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 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=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: 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, 68 locations, 7 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: 10.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538 IncrementalHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 45 mSDtfsCounter, 1538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=8, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:32:03,368 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/11.0.12-open/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.5.800.v20200727-1323.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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:32:05,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:32:05,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:32:05,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:32:05,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:32:05,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:32:05,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:32:05,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:32:05,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:32:05,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:32:05,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:32:05,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:32:05,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:32:05,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:32:05,574 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:32:05,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:32:05,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:32:05,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:32:05,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:32:05,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:32:05,576 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:32:05,579 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:32:05,579 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:32:05,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:32:05,579 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:32:05,579 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:32:05,579 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:32:05,580 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:32:05,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:32:05,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:32:05,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:32:05,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:32:05,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:32:05,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:32:05,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:32:05,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:32:05,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:32:05,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:32:05,581 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:32:05,581 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:32:05,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:32:05,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:32:05,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:32:05,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:32:05,583 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-11-09 10:32:05,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:32:05,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:32:05,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:32:05,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:32:05,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:32:05,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-09 10:32:07,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:32:07,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:32:07,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-09 10:32:07,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c271ba3/1d84c93662734755a9bcc529e9fb4704/FLAGc0424ce86 [2024-11-09 10:32:07,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c271ba3/1d84c93662734755a9bcc529e9fb4704 [2024-11-09 10:32:07,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:32:07,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:32:07,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:32:07,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:32:07,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:32:07,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:32:07" (1/1) ... [2024-11-09 10:32:07,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1abac99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:07, skipping insertion in model container [2024-11-09 10:32:07,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:32:07" (1/1) ... [2024-11-09 10:32:07,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:32:08,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:32:08,099 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:32:08,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:32:08,210 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:32:08,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08 WrapperNode [2024-11-09 10:32:08,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:32:08,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:32:08,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:32:08,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:32:08,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,255 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-09 10:32:08,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:32:08,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:32:08,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:32:08,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:32:08,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,286 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:32:08,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:32:08,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:32:08,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:32:08,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:32:08,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (1/1) ... [2024-11-09 10:32:08,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:32:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:32:08,335 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) [2024-11-09 10:32:08,337 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 [2024-11-09 10:32:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:32:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:32:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:32:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:32:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:32:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:32:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:32:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:32:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:32:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:32:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:32:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:32:08,374 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:32:08,494 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:32:08,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:32:08,823 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:32:08,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:32:09,037 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:32:09,038 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:32:09,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:32:09 BoogieIcfgContainer [2024-11-09 10:32:09,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:32:09,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:32:09,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:32:09,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:32:09,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:32:07" (1/3) ... [2024-11-09 10:32:09,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1fdb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:32:09, skipping insertion in model container [2024-11-09 10:32:09,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:32:08" (2/3) ... [2024-11-09 10:32:09,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1fdb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:32:09, skipping insertion in model container [2024-11-09 10:32:09,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:32:09" (3/3) ... [2024-11-09 10:32:09,046 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-09 10:32:09,058 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:32:09,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:32:09,058 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:32:09,105 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:32:09,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-09 10:32:09,158 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-09 10:32:09,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:32:09,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-09 10:32:09,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-09 10:32:09,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-09 10:32:09,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:32:09,182 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;@1df7cde1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:32:09,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:32:09,188 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:32:09,188 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-09 10:32:09,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:32:09,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:09,189 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:09,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 368939028, now seen corresponding path program 1 times [2024-11-09 10:32:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773279728] [2024-11-09 10:32:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:09,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:09,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:09,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:09,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:32:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:09,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:32:09,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:09,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:09,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773279728] [2024-11-09 10:32:09,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773279728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:32:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223204982] [2024-11-09 10:32:09,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:09,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:32:09,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:32:09,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:32:09,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-11-09 10:32:09,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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) [2024-11-09 10:32:09,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:09,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-11-09 10:32:09,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:09,591 INFO L124 PetriNetUnfolderBase]: 407/797 cut-off events. [2024-11-09 10:32:09,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:32:09,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 797 events. 407/797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5335 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1449. Up to 496 conditions per place. [2024-11-09 10:32:09,598 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-09 10:32:09,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 167 flow [2024-11-09 10:32:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:32:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:32:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-09 10:32:09,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2024-11-09 10:32:09,608 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 96 transitions. [2024-11-09 10:32:09,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 167 flow [2024-11-09 10:32:09,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:32:09,613 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-09 10:32:09,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-09 10:32:09,617 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-09 10:32:09,617 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-09 10:32:09,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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) [2024-11-09 10:32:09,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:09,618 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:09,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:32:09,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:09,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash -46216889, now seen corresponding path program 1 times [2024-11-09 10:32:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:09,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742004224] [2024-11-09 10:32:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:09,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:09,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:09,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:32:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:09,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:32:09,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:09,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:09,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742004224] [2024-11-09 10:32:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742004224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:09,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:09,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:32:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425585153] [2024-11-09 10:32:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:09,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:32:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:32:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:32:09,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-09 10:32:09,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:32:09,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:09,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-09 10:32:09,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:10,211 INFO L124 PetriNetUnfolderBase]: 1129/1945 cut-off events. [2024-11-09 10:32:10,211 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-11-09 10:32:10,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 1945 events. 1129/1945 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12298 event pairs, 94 based on Foata normal form. 60/1996 useless extension candidates. Maximal degree in co-relation 3795. Up to 1184 conditions per place. [2024-11-09 10:32:10,221 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 38 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-09 10:32:10,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 220 flow [2024-11-09 10:32:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:32:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:32:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-09 10:32:10,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-09 10:32:10,223 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 110 transitions. [2024-11-09 10:32:10,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 220 flow [2024-11-09 10:32:10,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:32:10,225 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-11-09 10:32:10,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-11-09 10:32:10,225 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-09 10:32:10,225 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-11-09 10:32:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:32:10,226 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:10,226 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:10,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:32:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:10,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:10,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1930264810, now seen corresponding path program 1 times [2024-11-09 10:32:10,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:10,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885369396] [2024-11-09 10:32:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:10,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:10,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:10,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:10,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:32:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:10,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:32:10,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:10,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:10,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885369396] [2024-11-09 10:32:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885369396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:10,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:10,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:32:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922632212] [2024-11-09 10:32:10,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:10,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:32:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:10,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:32:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:32:10,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-09 10:32:10,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2024-11-09 10:32:10,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:10,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-09 10:32:10,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:10,794 INFO L124 PetriNetUnfolderBase]: 748/1316 cut-off events. [2024-11-09 10:32:10,795 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-11-09 10:32:10,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2963 conditions, 1316 events. 748/1316 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7332 event pairs, 34 based on Foata normal form. 54/1361 useless extension candidates. Maximal degree in co-relation 2951. Up to 645 conditions per place. [2024-11-09 10:32:10,802 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2024-11-09 10:32:10,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 305 flow [2024-11-09 10:32:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:32:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:32:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-09 10:32:10,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-09 10:32:10,804 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 138 transitions. [2024-11-09 10:32:10,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 305 flow [2024-11-09 10:32:10,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 295 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:32:10,806 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-11-09 10:32:10,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-09 10:32:10,807 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-09 10:32:10,807 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-11-09 10:32:10,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2024-11-09 10:32:10,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:10,808 INFO L204 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] [2024-11-09 10:32:10,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:32:11,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:11,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1127643693, now seen corresponding path program 1 times [2024-11-09 10:32:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863844908] [2024-11-09 10:32:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:11,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:11,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:11,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:11,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:32:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:11,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:32:11,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:11,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:11,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863844908] [2024-11-09 10:32:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863844908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:11,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:32:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227850978] [2024-11-09 10:32:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:11,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:11,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-09 10:32:11,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2024-11-09 10:32:11,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:11,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-09 10:32:11,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:11,509 INFO L124 PetriNetUnfolderBase]: 381/663 cut-off events. [2024-11-09 10:32:11,509 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-11-09 10:32:11,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 663 events. 381/663 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2869 event pairs, 23 based on Foata normal form. 32/686 useless extension candidates. Maximal degree in co-relation 1727. Up to 228 conditions per place. [2024-11-09 10:32:11,518 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 42 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-09 10:32:11,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 320 flow [2024-11-09 10:32:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-11-09 10:32:11,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-11-09 10:32:11,523 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 152 transitions. [2024-11-09 10:32:11,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 320 flow [2024-11-09 10:32:11,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 10:32:11,531 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-11-09 10:32:11,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-09 10:32:11,532 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-09 10:32:11,532 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-11-09 10:32:11,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2024-11-09 10:32:11,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:11,533 INFO L204 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] [2024-11-09 10:32:11,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:32:11,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:11,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:11,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash 307696606, now seen corresponding path program 1 times [2024-11-09 10:32:11,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:11,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602325052] [2024-11-09 10:32:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:11,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:11,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:11,740 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:11,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:32:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:11,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:32:11,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:11,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:11,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:11,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602325052] [2024-11-09 10:32:11,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602325052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:11,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:11,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:32:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910629482] [2024-11-09 10:32:11,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:11,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:32:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:32:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:32:11,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-09 10:32:11,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-11-09 10:32:11,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:11,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-09 10:32:11,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:11,931 INFO L124 PetriNetUnfolderBase]: 186/390 cut-off events. [2024-11-09 10:32:11,931 INFO L125 PetriNetUnfolderBase]: For 131/136 co-relation queries the response was YES. [2024-11-09 10:32:11,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 390 events. 186/390 cut-off events. For 131/136 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1769 event pairs, 178 based on Foata normal form. 8/359 useless extension candidates. Maximal degree in co-relation 839. Up to 311 conditions per place. [2024-11-09 10:32:11,933 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-09 10:32:11,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 202 flow [2024-11-09 10:32:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:32:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:32:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-09 10:32:11,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-09 10:32:11,934 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 77 transitions. [2024-11-09 10:32:11,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 202 flow [2024-11-09 10:32:11,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 146 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-09 10:32:11,936 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-11-09 10:32:11,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-11-09 10:32:11,937 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-09 10:32:11,937 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-11-09 10:32:11,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-11-09 10:32:11,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:11,937 INFO L204 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] [2024-11-09 10:32:11,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:32:12,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:12,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:12,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash 307698000, now seen corresponding path program 1 times [2024-11-09 10:32:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:12,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745107478] [2024-11-09 10:32:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:12,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:12,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:12,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:12,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:32:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:12,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:32:12,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:12,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:12,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745107478] [2024-11-09 10:32:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745107478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:12,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:12,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:32:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874113655] [2024-11-09 10:32:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:32:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:12,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:32:12,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:32:12,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-09 10:32:12,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2024-11-09 10:32:12,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:12,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-09 10:32:12,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:12,781 INFO L124 PetriNetUnfolderBase]: 488/977 cut-off events. [2024-11-09 10:32:12,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:32:12,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 977 events. 488/977 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5329 event pairs, 215 based on Foata normal form. 8/914 useless extension candidates. Maximal degree in co-relation 1884. Up to 391 conditions per place. [2024-11-09 10:32:12,786 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 13/62 dead transitions. [2024-11-09 10:32:12,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 240 flow [2024-11-09 10:32:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:32:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:32:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-11-09 10:32:12,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6045454545454545 [2024-11-09 10:32:12,788 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 5 states and 133 transitions. [2024-11-09 10:32:12,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 240 flow [2024-11-09 10:32:12,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:32:12,790 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 119 flow [2024-11-09 10:32:12,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-11-09 10:32:12,791 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2024-11-09 10:32:12,792 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 119 flow [2024-11-09 10:32:12,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2024-11-09 10:32:12,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:12,793 INFO L204 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] [2024-11-09 10:32:12,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:32:12,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:12,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:12,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1939789950, now seen corresponding path program 2 times [2024-11-09 10:32:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:12,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865827896] [2024-11-09 10:32:12,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:32:12,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:12,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:12,999 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:13,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:32:13,064 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:32:13,064 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:13,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:32:13,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:13,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:13,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:13,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865827896] [2024-11-09 10:32:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865827896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875356473] [2024-11-09 10:32:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:13,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:13,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-09 10:32:13,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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) [2024-11-09 10:32:13,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:13,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-09 10:32:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:13,363 INFO L124 PetriNetUnfolderBase]: 360/766 cut-off events. [2024-11-09 10:32:13,364 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 10:32:13,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 766 events. 360/766 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3867 event pairs, 110 based on Foata normal form. 8/747 useless extension candidates. Maximal degree in co-relation 1539. Up to 326 conditions per place. [2024-11-09 10:32:13,366 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 22 selfloop transitions, 1 changer transitions 22/65 dead transitions. [2024-11-09 10:32:13,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 267 flow [2024-11-09 10:32:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-11-09 10:32:13,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-09 10:32:13,367 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 119 flow. Second operand 6 states and 154 transitions. [2024-11-09 10:32:13,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 267 flow [2024-11-09 10:32:13,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 253 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:32:13,369 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 120 flow [2024-11-09 10:32:13,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=6, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-11-09 10:32:13,370 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-09 10:32:13,370 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 120 flow [2024-11-09 10:32:13,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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) [2024-11-09 10:32:13,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:13,370 INFO L204 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] [2024-11-09 10:32:13,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:32:13,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:13,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash 273720844, now seen corresponding path program 3 times [2024-11-09 10:32:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528611784] [2024-11-09 10:32:13,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:32:13,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:13,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:13,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:13,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:32:13,661 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:32:13,661 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:13,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 10:32:13,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:32:14,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:14,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:14,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528611784] [2024-11-09 10:32:14,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528611784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:14,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:14,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:32:14,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855138551] [2024-11-09 10:32:14,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:14,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:32:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:32:14,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:32:14,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-09 10:32:14,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 120 flow. Second operand has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 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) [2024-11-09 10:32:14,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:14,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-09 10:32:14,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:14,244 INFO L124 PetriNetUnfolderBase]: 337/678 cut-off events. [2024-11-09 10:32:14,244 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:32:14,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 678 events. 337/678 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3302 event pairs, 101 based on Foata normal form. 8/638 useless extension candidates. Maximal degree in co-relation 1368. Up to 230 conditions per place. [2024-11-09 10:32:14,246 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 21 selfloop transitions, 4 changer transitions 20/66 dead transitions. [2024-11-09 10:32:14,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 268 flow [2024-11-09 10:32:14,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:32:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:32:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-09 10:32:14,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-09 10:32:14,248 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 120 flow. Second operand 8 states and 198 transitions. [2024-11-09 10:32:14,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 268 flow [2024-11-09 10:32:14,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 257 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:32:14,249 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 127 flow [2024-11-09 10:32:14,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-11-09 10:32:14,250 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-09 10:32:14,250 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 127 flow [2024-11-09 10:32:14,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 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) [2024-11-09 10:32:14,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:14,250 INFO L204 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] [2024-11-09 10:32:14,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 10:32:14,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:14,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:32:14,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 596103760, now seen corresponding path program 4 times [2024-11-09 10:32:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575325039] [2024-11-09 10:32:14,452 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:32:14,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:14,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:14,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:32:14,522 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:32:14,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:32:14,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:32:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:32:14,611 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:32:14,611 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:32:14,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:32:14,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:32:14,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:32:14,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:32:14,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:32:14,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-09 10:32:14,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:32:14,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:32:14,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:14,819 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-09 10:32:14,895 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:32:14,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:32:14,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:32:14 BasicIcfg [2024-11-09 10:32:14,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:32:14,899 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:32:14,899 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:32:14,900 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:32:14,900 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:32:09" (3/4) ... [2024-11-09 10:32:14,901 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:32:14,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:32:14,903 INFO L158 Benchmark]: Toolchain (without parser) took 7216.75ms. Allocated memory was 65.0MB in the beginning and 180.4MB in the end (delta: 115.3MB). Free memory was 43.9MB in the beginning and 118.2MB in the end (delta: -74.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-09 10:32:14,903 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:32:14,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.80ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 43.6MB in the beginning and 67.8MB in the end (delta: -24.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:14,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.36ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 64.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:32:14,904 INFO L158 Benchmark]: Boogie Preprocessor took 46.22ms. Allocated memory is still 96.5MB. Free memory was 64.9MB in the beginning and 61.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:32:14,904 INFO L158 Benchmark]: RCFGBuilder took 736.27ms. Allocated memory is still 96.5MB. Free memory was 61.5MB in the beginning and 60.3MB in the end (delta: 1.2MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-09 10:32:14,904 INFO L158 Benchmark]: TraceAbstraction took 5858.49ms. Allocated memory was 96.5MB in the beginning and 180.4MB in the end (delta: 83.9MB). Free memory was 59.6MB in the beginning and 118.2MB in the end (delta: -58.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-09 10:32:14,904 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 180.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:32:14,905 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.74ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.80ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 43.6MB in the beginning and 67.8MB in the end (delta: -24.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.36ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 64.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.22ms. Allocated memory is still 96.5MB. Free memory was 64.9MB in the beginning and 61.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.27ms. Allocated memory is still 96.5MB. Free memory was 61.5MB in the beginning and 60.3MB in the end (delta: 1.2MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5858.49ms. Allocated memory was 96.5MB in the beginning and 180.4MB in the end (delta: 83.9MB). Free memory was 59.6MB in the beginning and 118.2MB in the end (delta: -58.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 180.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=0, weak$$choice0=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=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492=0, t1493=1, weak$$choice0=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=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=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=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 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=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: 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: 818]: 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, 68 locations, 7 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: 5.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 849 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 10 mSDtfsCounter, 849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 40, 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, 1.0s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 SizeOfPredicates, 12 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:32:14,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample