./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/safe004_power.oepc_pso.oepc_rmo.oepc.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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:18:47,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:18:47,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:18:47,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:18:47,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:18:47,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:18:47,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:18:47,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:18:47,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:18:47,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:18:47,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:18:47,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:18:47,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:18:47,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:18:47,985 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:18:47,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:18:47,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:18:47,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:18:47,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:18:47,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:18:47,990 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:18:47,990 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:18:47,990 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:18:47,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:18:47,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:18:47,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:18:47,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:18:47,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:18:47,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:18:47,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:18:47,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:18:47,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:18:47,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:18:47,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:18:47,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:18:47,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:18:47,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:18:47,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:18:47,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:18:47,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:18:47,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:18:47,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:18:47,995 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2024-11-17 03:18:48,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:18:48,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:18:48,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:18:48,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:18:48,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:18:48,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:18:49,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:18:49,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:18:49,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:18:49,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30dcab9c1/b0ee9cceced747e5b895017ee7b270b5/FLAGaf743f79e [2024-11-17 03:18:49,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30dcab9c1/b0ee9cceced747e5b895017ee7b270b5 [2024-11-17 03:18:49,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:18:49,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:18:49,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:18:49,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:18:49,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:18:49,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:49" (1/1) ... [2024-11-17 03:18:49,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cb0d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:49, skipping insertion in model container [2024-11-17 03:18:49,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:49" (1/1) ... [2024-11-17 03:18:50,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:18:50,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:18:50,383 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:18:50,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:18:50,489 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:18:50,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50 WrapperNode [2024-11-17 03:18:50,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:18:50,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:18:50,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:18:50,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:18:50,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,538 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-17 03:18:50,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:18:50,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:18:50,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:18:50,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:18:50,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,568 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-17 03:18:50,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:18:50,591 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:18:50,591 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:18:50,591 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:18:50,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (1/1) ... [2024-11-17 03:18:50,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:18:50,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:18:50,631 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-17 03:18:50,632 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-17 03:18:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:18:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:18:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:18:50,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:18:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:18:50,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:18:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:18:50,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:18:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:18:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:18:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:18:50,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:18:50,669 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:18:50,775 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:18:50,777 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:18:51,098 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:18:51,098 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:18:51,341 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:18:51,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:18:51,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:18:51 BoogieIcfgContainer [2024-11-17 03:18:51,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:18:51,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:18:51,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:18:51,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:18:51,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:18:49" (1/3) ... [2024-11-17 03:18:51,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1687562c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:51, skipping insertion in model container [2024-11-17 03:18:51,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:50" (2/3) ... [2024-11-17 03:18:51,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1687562c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:51, skipping insertion in model container [2024-11-17 03:18:51,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:18:51" (3/3) ... [2024-11-17 03:18:51,351 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:18:51,364 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:18:51,366 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:18:51,366 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:18:51,417 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:18:51,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-17 03:18:51,469 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-17 03:18:51,470 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:18:51,473 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 4. Compared 73 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-17 03:18:51,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-17 03:18:51,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-17 03:18:51,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:18:51,493 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;@7385aa8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:18:51,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-17 03:18:51,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:18:51,498 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-17 03:18:51,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:18:51,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:18:51,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:18:51,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:18:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:18:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 13866063, now seen corresponding path program 1 times [2024-11-17 03:18:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:18:51,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124853743] [2024-11-17 03:18:51,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:18:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:18:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:18:51,814 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-17 03:18:51,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:18:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124853743] [2024-11-17 03:18:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124853743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:18:51,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:18:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:18:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699589152] [2024-11-17 03:18:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:18:51,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:18:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:18:51,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:18:51,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:18:51,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:18:51,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:51,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:18:51,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:18:51,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:18:52,810 INFO L124 PetriNetUnfolderBase]: 5315/7708 cut-off events. [2024-11-17 03:18:52,811 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-17 03:18:52,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15359 conditions, 7708 events. 5315/7708 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 43541 event pairs, 575 based on Foata normal form. 432/8138 useless extension candidates. Maximal degree in co-relation 15348. Up to 6611 conditions per place. [2024-11-17 03:18:52,849 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-11-17 03:18:52,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 241 flow [2024-11-17 03:18:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:18:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:18:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-17 03:18:52,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-17 03:18:52,859 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 88 transitions. [2024-11-17 03:18:52,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 241 flow [2024-11-17 03:18:52,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:18:52,863 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-17 03:18:52,864 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-17 03:18:52,866 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-17 03:18:52,866 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-17 03:18:52,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:52,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:18:52,866 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:18:52,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:18:52,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:18:52,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:18:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1386928136, now seen corresponding path program 1 times [2024-11-17 03:18:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:18:52,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99469936] [2024-11-17 03:18:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:18:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:18:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:18:52,969 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-17 03:18:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:18:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99469936] [2024-11-17 03:18:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99469936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:18:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:18:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:18:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720154913] [2024-11-17 03:18:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:18:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:18:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:18:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:18:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:18:52,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:18:52,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:52,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:18:52,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:18:52,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:18:53,659 INFO L124 PetriNetUnfolderBase]: 4775/7461 cut-off events. [2024-11-17 03:18:53,660 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2024-11-17 03:18:53,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14693 conditions, 7461 events. 4775/7461 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 44118 event pairs, 4775 based on Foata normal form. 216/7672 useless extension candidates. Maximal degree in co-relation 14683. Up to 6804 conditions per place. [2024-11-17 03:18:53,690 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-17 03:18:53,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2024-11-17 03:18:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:18:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:18:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-17 03:18:53,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-11-17 03:18:53,693 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2024-11-17 03:18:53,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2024-11-17 03:18:53,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:18:53,694 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-17 03:18:53,696 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-17 03:18:53,697 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-17 03:18:53,697 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-17 03:18:53,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:53,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:18:53,697 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:18:53,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:18:53,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:18:53,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:18:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1386928507, now seen corresponding path program 1 times [2024-11-17 03:18:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:18:53,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848255816] [2024-11-17 03:18:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:18:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:18:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:18:53,970 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-17 03:18:53,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:18:53,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848255816] [2024-11-17 03:18:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848255816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:18:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:18:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:18:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326676269] [2024-11-17 03:18:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:18:53,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:18:53,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:18:53,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:18:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:18:53,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:18:53,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:53,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:18:53,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:18:53,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:18:55,027 INFO L124 PetriNetUnfolderBase]: 5831/8733 cut-off events. [2024-11-17 03:18:55,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:18:55,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17187 conditions, 8733 events. 5831/8733 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 49058 event pairs, 827 based on Foata normal form. 0/8548 useless extension candidates. Maximal degree in co-relation 17181. Up to 4993 conditions per place. [2024-11-17 03:18:55,062 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 2 changer transitions 70/117 dead transitions. [2024-11-17 03:18:55,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 117 transitions, 466 flow [2024-11-17 03:18:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:18:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:18:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-11-17 03:18:55,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2024-11-17 03:18:55,066 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 186 transitions. [2024-11-17 03:18:55,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 117 transitions, 466 flow [2024-11-17 03:18:55,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 117 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:18:55,069 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 89 flow [2024-11-17 03:18:55,069 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2024-11-17 03:18:55,070 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-17 03:18:55,070 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 89 flow [2024-11-17 03:18:55,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:55,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:18:55,070 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:18:55,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:18:55,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:18:55,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:18:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1609599622, now seen corresponding path program 1 times [2024-11-17 03:18:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:18:55,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979083334] [2024-11-17 03:18:55,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:18:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:18:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:18:55,590 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-17 03:18:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:18:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979083334] [2024-11-17 03:18:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979083334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:18:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:18:55,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:18:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046586928] [2024-11-17 03:18:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:18:55,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:18:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:18:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:18:55,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:18:55,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:18:55,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:55,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:18:55,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:18:55,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:18:56,719 INFO L124 PetriNetUnfolderBase]: 5354/8053 cut-off events. [2024-11-17 03:18:56,720 INFO L125 PetriNetUnfolderBase]: For 1751/1751 co-relation queries the response was YES. [2024-11-17 03:18:56,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17687 conditions, 8053 events. 5354/8053 cut-off events. For 1751/1751 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 46062 event pairs, 1028 based on Foata normal form. 209/8259 useless extension candidates. Maximal degree in co-relation 17675. Up to 5606 conditions per place. [2024-11-17 03:18:56,751 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 54 selfloop transitions, 11 changer transitions 67/137 dead transitions. [2024-11-17 03:18:56,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 599 flow [2024-11-17 03:18:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:18:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:18:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 225 transitions. [2024-11-17 03:18:56,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-11-17 03:18:56,754 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 89 flow. Second operand 10 states and 225 transitions. [2024-11-17 03:18:56,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 599 flow [2024-11-17 03:18:56,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 137 transitions, 563 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-17 03:18:56,828 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 176 flow [2024-11-17 03:18:56,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-17 03:18:56,829 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-17 03:18:56,829 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 176 flow [2024-11-17 03:18:56,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:56,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:18:56,830 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-17 03:18:56,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:18:56,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:18:56,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:18:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash 221916665, now seen corresponding path program 1 times [2024-11-17 03:18:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:18:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60874376] [2024-11-17 03:18:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:18:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:18:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:18:57,329 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-17 03:18:57,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:18:57,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60874376] [2024-11-17 03:18:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60874376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:18:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:18:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:18:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475939238] [2024-11-17 03:18:57,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:18:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:18:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:18:57,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:18:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:18:57,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:18:57,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:57,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:18:57,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:18:57,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:18:58,509 INFO L124 PetriNetUnfolderBase]: 4977/7466 cut-off events. [2024-11-17 03:18:58,509 INFO L125 PetriNetUnfolderBase]: For 8012/8014 co-relation queries the response was YES. [2024-11-17 03:18:58,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22888 conditions, 7466 events. 4977/7466 cut-off events. For 8012/8014 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 40958 event pairs, 1098 based on Foata normal form. 195/7658 useless extension candidates. Maximal degree in co-relation 22872. Up to 4034 conditions per place. [2024-11-17 03:18:58,542 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 57 selfloop transitions, 10 changer transitions 74/146 dead transitions. [2024-11-17 03:18:58,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 146 transitions, 868 flow [2024-11-17 03:18:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:18:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:18:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2024-11-17 03:18:58,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4954545454545455 [2024-11-17 03:18:58,544 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 176 flow. Second operand 10 states and 218 transitions. [2024-11-17 03:18:58,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 146 transitions, 868 flow [2024-11-17 03:18:58,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 146 transitions, 840 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-17 03:18:58,592 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 277 flow [2024-11-17 03:18:58,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=277, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2024-11-17 03:18:58,594 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2024-11-17 03:18:58,595 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 277 flow [2024-11-17 03:18:58,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:58,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:18:58,596 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-17 03:18:58,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:18:58,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:18:58,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:18:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash -515993642, now seen corresponding path program 1 times [2024-11-17 03:18:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:18:58,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135458323] [2024-11-17 03:18:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:18:58,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:18:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:18:58,960 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-17 03:18:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:18:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135458323] [2024-11-17 03:18:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135458323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:18:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:18:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:18:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384581169] [2024-11-17 03:18:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:18:58,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:18:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:18:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:18:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:18:58,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:18:58,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:18:58,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:18:58,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:18:58,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:18:59,997 INFO L124 PetriNetUnfolderBase]: 7140/10563 cut-off events. [2024-11-17 03:18:59,997 INFO L125 PetriNetUnfolderBase]: For 18738/18738 co-relation queries the response was YES. [2024-11-17 03:19:00,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35871 conditions, 10563 events. 7140/10563 cut-off events. For 18738/18738 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 59002 event pairs, 1334 based on Foata normal form. 156/10717 useless extension candidates. Maximal degree in co-relation 35848. Up to 5006 conditions per place. [2024-11-17 03:19:00,053 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 69 selfloop transitions, 5 changer transitions 63/142 dead transitions. [2024-11-17 03:19:00,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 142 transitions, 1042 flow [2024-11-17 03:19:00,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:19:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:19:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-11-17 03:19:00,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-17 03:19:00,055 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 277 flow. Second operand 8 states and 176 transitions. [2024-11-17 03:19:00,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 142 transitions, 1042 flow [2024-11-17 03:19:00,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 142 transitions, 1002 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-11-17 03:19:00,155 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 302 flow [2024-11-17 03:19:00,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=302, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2024-11-17 03:19:00,156 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2024-11-17 03:19:00,157 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 302 flow [2024-11-17 03:19:00,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:00,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:00,158 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] [2024-11-17 03:19:00,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:19:00,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:00,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash 945298984, now seen corresponding path program 1 times [2024-11-17 03:19:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:00,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451594924] [2024-11-17 03:19:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:00,620 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-17 03:19:00,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:00,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451594924] [2024-11-17 03:19:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451594924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:00,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:00,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:19:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716987765] [2024-11-17 03:19:00,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:00,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:19:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:19:00,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:19:00,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:00,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:00,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:00,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:00,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:01,578 INFO L124 PetriNetUnfolderBase]: 6415/9573 cut-off events. [2024-11-17 03:19:01,579 INFO L125 PetriNetUnfolderBase]: For 18768/18768 co-relation queries the response was YES. [2024-11-17 03:19:01,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34056 conditions, 9573 events. 6415/9573 cut-off events. For 18768/18768 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 53528 event pairs, 1666 based on Foata normal form. 176/9747 useless extension candidates. Maximal degree in co-relation 34029. Up to 4213 conditions per place. [2024-11-17 03:19:01,634 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 65 selfloop transitions, 10 changer transitions 47/127 dead transitions. [2024-11-17 03:19:01,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 127 transitions, 891 flow [2024-11-17 03:19:01,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:19:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:19:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-11-17 03:19:01,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-11-17 03:19:01,636 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 302 flow. Second operand 8 states and 180 transitions. [2024-11-17 03:19:01,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 127 transitions, 891 flow [2024-11-17 03:19:01,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 127 transitions, 853 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-17 03:19:01,684 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 323 flow [2024-11-17 03:19:01,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2024-11-17 03:19:01,685 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2024-11-17 03:19:01,685 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 323 flow [2024-11-17 03:19:01,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:01,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:01,685 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] [2024-11-17 03:19:01,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:19:01,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:01,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1635904035, now seen corresponding path program 1 times [2024-11-17 03:19:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353987125] [2024-11-17 03:19:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:02,262 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-17 03:19:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353987125] [2024-11-17 03:19:02,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353987125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:02,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:02,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:19:02,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324113046] [2024-11-17 03:19:02,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:02,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:19:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:02,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:19:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:19:02,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:02,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:02,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:02,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:02,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:03,123 INFO L124 PetriNetUnfolderBase]: 5297/8162 cut-off events. [2024-11-17 03:19:03,123 INFO L125 PetriNetUnfolderBase]: For 20789/20789 co-relation queries the response was YES. [2024-11-17 03:19:03,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28841 conditions, 8162 events. 5297/8162 cut-off events. For 20789/20789 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 46128 event pairs, 2911 based on Foata normal form. 111/8271 useless extension candidates. Maximal degree in co-relation 28814. Up to 6741 conditions per place. [2024-11-17 03:19:03,156 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 70 selfloop transitions, 14 changer transitions 44/133 dead transitions. [2024-11-17 03:19:03,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 133 transitions, 998 flow [2024-11-17 03:19:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:19:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:19:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-11-17 03:19:03,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-11-17 03:19:03,157 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 323 flow. Second operand 9 states and 188 transitions. [2024-11-17 03:19:03,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 133 transitions, 998 flow [2024-11-17 03:19:03,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 133 transitions, 958 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-17 03:19:03,194 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 427 flow [2024-11-17 03:19:03,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=427, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-11-17 03:19:03,195 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2024-11-17 03:19:03,195 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 427 flow [2024-11-17 03:19:03,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:03,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:03,196 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-17 03:19:03,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:19:03,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:03,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1563279910, now seen corresponding path program 1 times [2024-11-17 03:19:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231808308] [2024-11-17 03:19:03,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:03,749 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-17 03:19:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231808308] [2024-11-17 03:19:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231808308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:03,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:03,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:19:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277302441] [2024-11-17 03:19:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:03,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:19:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:03,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:19:03,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:19:03,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:03,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 427 flow. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:03,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:03,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:03,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:05,298 INFO L124 PetriNetUnfolderBase]: 7992/12085 cut-off events. [2024-11-17 03:19:05,298 INFO L125 PetriNetUnfolderBase]: For 33180/33182 co-relation queries the response was YES. [2024-11-17 03:19:05,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44947 conditions, 12085 events. 7992/12085 cut-off events. For 33180/33182 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 71372 event pairs, 2185 based on Foata normal form. 200/12282 useless extension candidates. Maximal degree in co-relation 44916. Up to 5429 conditions per place. [2024-11-17 03:19:05,366 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 71 selfloop transitions, 21 changer transitions 58/155 dead transitions. [2024-11-17 03:19:05,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 155 transitions, 1362 flow [2024-11-17 03:19:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:19:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:19:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-17 03:19:05,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-11-17 03:19:05,367 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 427 flow. Second operand 7 states and 166 transitions. [2024-11-17 03:19:05,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 155 transitions, 1362 flow [2024-11-17 03:19:05,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 155 transitions, 1306 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-17 03:19:05,450 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 552 flow [2024-11-17 03:19:05,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=552, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2024-11-17 03:19:05,451 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places. [2024-11-17 03:19:05,451 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 552 flow [2024-11-17 03:19:05,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:05,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:05,451 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-17 03:19:05,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:19:05,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:05,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1382723536, now seen corresponding path program 2 times [2024-11-17 03:19:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:05,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274355380] [2024-11-17 03:19:05,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:06,103 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-17 03:19:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:06,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274355380] [2024-11-17 03:19:06,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274355380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:06,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:06,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:19:06,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565188245] [2024-11-17 03:19:06,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:06,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:19:06,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:06,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:19:06,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:19:06,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:06,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 552 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:06,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:06,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:06,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:07,322 INFO L124 PetriNetUnfolderBase]: 6124/9506 cut-off events. [2024-11-17 03:19:07,323 INFO L125 PetriNetUnfolderBase]: For 35456/35456 co-relation queries the response was YES. [2024-11-17 03:19:07,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37785 conditions, 9506 events. 6124/9506 cut-off events. For 35456/35456 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 55820 event pairs, 1258 based on Foata normal form. 198/9702 useless extension candidates. Maximal degree in co-relation 37751. Up to 5432 conditions per place. [2024-11-17 03:19:07,379 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 101 selfloop transitions, 28 changer transitions 80/214 dead transitions. [2024-11-17 03:19:07,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 214 transitions, 2087 flow [2024-11-17 03:19:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:19:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:19:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 262 transitions. [2024-11-17 03:19:07,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2024-11-17 03:19:07,381 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 552 flow. Second operand 12 states and 262 transitions. [2024-11-17 03:19:07,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 214 transitions, 2087 flow [2024-11-17 03:19:07,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 214 transitions, 2043 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-11-17 03:19:07,441 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 810 flow [2024-11-17 03:19:07,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=810, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2024-11-17 03:19:07,441 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 45 predicate places. [2024-11-17 03:19:07,441 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 810 flow [2024-11-17 03:19:07,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:07,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:07,442 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-17 03:19:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:19:07,442 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 417431052, now seen corresponding path program 3 times [2024-11-17 03:19:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:07,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352017740] [2024-11-17 03:19:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:08,054 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-17 03:19:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352017740] [2024-11-17 03:19:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352017740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:08,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:19:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406456295] [2024-11-17 03:19:08,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:08,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:19:08,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:19:08,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:19:08,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:08,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 810 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:08,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:08,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:08,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:09,470 INFO L124 PetriNetUnfolderBase]: 6844/10617 cut-off events. [2024-11-17 03:19:09,470 INFO L125 PetriNetUnfolderBase]: For 66797/66797 co-relation queries the response was YES. [2024-11-17 03:19:09,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49159 conditions, 10617 events. 6844/10617 cut-off events. For 66797/66797 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 63957 event pairs, 2090 based on Foata normal form. 261/10876 useless extension candidates. Maximal degree in co-relation 49118. Up to 6580 conditions per place. [2024-11-17 03:19:09,528 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 111 selfloop transitions, 42 changer transitions 86/244 dead transitions. [2024-11-17 03:19:09,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 244 transitions, 2774 flow [2024-11-17 03:19:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:19:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-17 03:19:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 273 transitions. [2024-11-17 03:19:09,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-11-17 03:19:09,529 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 810 flow. Second operand 13 states and 273 transitions. [2024-11-17 03:19:09,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 244 transitions, 2774 flow [2024-11-17 03:19:09,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 244 transitions, 2598 flow, removed 79 selfloop flow, removed 6 redundant places. [2024-11-17 03:19:09,629 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 1244 flow [2024-11-17 03:19:09,629 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1244, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2024-11-17 03:19:09,630 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 57 predicate places. [2024-11-17 03:19:09,630 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 1244 flow [2024-11-17 03:19:09,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:09,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:09,630 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] [2024-11-17 03:19:09,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:19:09,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:09,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1197232997, now seen corresponding path program 1 times [2024-11-17 03:19:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837916942] [2024-11-17 03:19:09,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:09,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:09,758 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-17 03:19:09,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837916942] [2024-11-17 03:19:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837916942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:09,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:09,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:19:09,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840009634] [2024-11-17 03:19:09,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:09,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:19:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:09,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:19:09,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:19:09,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:09,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 1244 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:09,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:09,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:10,455 INFO L124 PetriNetUnfolderBase]: 4112/6530 cut-off events. [2024-11-17 03:19:10,456 INFO L125 PetriNetUnfolderBase]: For 76376/76381 co-relation queries the response was YES. [2024-11-17 03:19:10,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33834 conditions, 6530 events. 4112/6530 cut-off events. For 76376/76381 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 37754 event pairs, 516 based on Foata normal form. 313/6840 useless extension candidates. Maximal degree in co-relation 33787. Up to 3480 conditions per place. [2024-11-17 03:19:10,489 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 129 selfloop transitions, 5 changer transitions 15/154 dead transitions. [2024-11-17 03:19:10,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 154 transitions, 2165 flow [2024-11-17 03:19:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:19:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:19:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-17 03:19:10,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2024-11-17 03:19:10,490 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 1244 flow. Second operand 4 states and 103 transitions. [2024-11-17 03:19:10,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 154 transitions, 2165 flow [2024-11-17 03:19:10,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 154 transitions, 1779 flow, removed 114 selfloop flow, removed 15 redundant places. [2024-11-17 03:19:10,541 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 705 flow [2024-11-17 03:19:10,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=705, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2024-11-17 03:19:10,542 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places. [2024-11-17 03:19:10,542 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 705 flow [2024-11-17 03:19:10,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:10,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:10,542 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-17 03:19:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:19:10,542 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1662354210, now seen corresponding path program 1 times [2024-11-17 03:19:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473748599] [2024-11-17 03:19:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:11,568 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-17 03:19:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:11,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473748599] [2024-11-17 03:19:11,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473748599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:11,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:11,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:19:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800058104] [2024-11-17 03:19:11,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:11,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:19:11,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:19:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:19:11,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:11,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 705 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 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-17 03:19:11,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:11,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:11,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:12,718 INFO L124 PetriNetUnfolderBase]: 4582/7239 cut-off events. [2024-11-17 03:19:12,718 INFO L125 PetriNetUnfolderBase]: For 49842/49842 co-relation queries the response was YES. [2024-11-17 03:19:12,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34751 conditions, 7239 events. 4582/7239 cut-off events. For 49842/49842 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 41311 event pairs, 1307 based on Foata normal form. 92/7329 useless extension candidates. Maximal degree in co-relation 34714. Up to 4767 conditions per place. [2024-11-17 03:19:12,757 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 111 selfloop transitions, 41 changer transitions 46/203 dead transitions. [2024-11-17 03:19:12,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 203 transitions, 2100 flow [2024-11-17 03:19:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:19:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:19:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 246 transitions. [2024-11-17 03:19:12,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-11-17 03:19:12,759 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 705 flow. Second operand 12 states and 246 transitions. [2024-11-17 03:19:12,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 203 transitions, 2100 flow [2024-11-17 03:19:12,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 203 transitions, 2038 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-17 03:19:12,819 INFO L231 Difference]: Finished difference. Result has 104 places, 97 transitions, 1125 flow [2024-11-17 03:19:12,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1125, PETRI_PLACES=104, PETRI_TRANSITIONS=97} [2024-11-17 03:19:12,819 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 55 predicate places. [2024-11-17 03:19:12,819 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 97 transitions, 1125 flow [2024-11-17 03:19:12,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 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-17 03:19:12,820 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:12,820 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-17 03:19:12,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:19:12,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:12,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash 894329028, now seen corresponding path program 1 times [2024-11-17 03:19:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:12,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799233620] [2024-11-17 03:19:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:13,005 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-17 03:19:13,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:13,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799233620] [2024-11-17 03:19:13,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799233620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:13,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:13,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:19:13,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996893693] [2024-11-17 03:19:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:13,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:19:13,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:19:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:19:13,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:13,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 1125 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:13,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:13,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:13,524 INFO L124 PetriNetUnfolderBase]: 3001/4808 cut-off events. [2024-11-17 03:19:13,524 INFO L125 PetriNetUnfolderBase]: For 47864/47865 co-relation queries the response was YES. [2024-11-17 03:19:13,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23933 conditions, 4808 events. 3001/4808 cut-off events. For 47864/47865 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 26407 event pairs, 285 based on Foata normal form. 296/5101 useless extension candidates. Maximal degree in co-relation 23890. Up to 1630 conditions per place. [2024-11-17 03:19:13,548 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 157 selfloop transitions, 8 changer transitions 11/181 dead transitions. [2024-11-17 03:19:13,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 181 transitions, 2563 flow [2024-11-17 03:19:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:19:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:19:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-17 03:19:13,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5772727272727273 [2024-11-17 03:19:13,549 INFO L175 Difference]: Start difference. First operand has 104 places, 97 transitions, 1125 flow. Second operand 5 states and 127 transitions. [2024-11-17 03:19:13,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 181 transitions, 2563 flow [2024-11-17 03:19:13,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 181 transitions, 2375 flow, removed 79 selfloop flow, removed 7 redundant places. [2024-11-17 03:19:13,587 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 924 flow [2024-11-17 03:19:13,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=924, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-11-17 03:19:13,587 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 49 predicate places. [2024-11-17 03:19:13,587 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 924 flow [2024-11-17 03:19:13,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:13,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:13,588 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] [2024-11-17 03:19:13,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 03:19:13,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:13,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1772628287, now seen corresponding path program 1 times [2024-11-17 03:19:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:13,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227780763] [2024-11-17 03:19:13,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:13,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:15,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-17 03:19:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227780763] [2024-11-17 03:19:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227780763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:15,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:15,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:19:15,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133480672] [2024-11-17 03:19:15,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:15,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:19:15,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:19:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:19:15,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:15,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 924 flow. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 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-17 03:19:15,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:15,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:15,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:16,039 INFO L124 PetriNetUnfolderBase]: 3016/4861 cut-off events. [2024-11-17 03:19:16,040 INFO L125 PetriNetUnfolderBase]: For 34291/34291 co-relation queries the response was YES. [2024-11-17 03:19:16,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24017 conditions, 4861 events. 3016/4861 cut-off events. For 34291/34291 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 26018 event pairs, 823 based on Foata normal form. 64/4923 useless extension candidates. Maximal degree in co-relation 23976. Up to 2702 conditions per place. [2024-11-17 03:19:16,064 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 91 selfloop transitions, 32 changer transitions 59/187 dead transitions. [2024-11-17 03:19:16,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 187 transitions, 2040 flow [2024-11-17 03:19:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:19:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:19:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2024-11-17 03:19:16,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-11-17 03:19:16,066 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 924 flow. Second operand 12 states and 236 transitions. [2024-11-17 03:19:16,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 187 transitions, 2040 flow [2024-11-17 03:19:16,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 187 transitions, 1918 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-11-17 03:19:16,111 INFO L231 Difference]: Finished difference. Result has 109 places, 82 transitions, 930 flow [2024-11-17 03:19:16,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=930, PETRI_PLACES=109, PETRI_TRANSITIONS=82} [2024-11-17 03:19:16,113 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places. [2024-11-17 03:19:16,113 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 82 transitions, 930 flow [2024-11-17 03:19:16,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 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-17 03:19:16,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:16,113 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] [2024-11-17 03:19:16,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:19:16,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:16,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1938667883, now seen corresponding path program 2 times [2024-11-17 03:19:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:16,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797984625] [2024-11-17 03:19:16,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:16,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:17,818 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-17 03:19:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:17,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797984625] [2024-11-17 03:19:17,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797984625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:17,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 03:19:17,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249718457] [2024-11-17 03:19:17,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:17,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 03:19:17,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 03:19:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:19:17,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:17,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 82 transitions, 930 flow. Second operand has 12 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 0 states have call successors, (0), 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-17 03:19:17,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:17,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:17,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:19,330 INFO L124 PetriNetUnfolderBase]: 4221/6758 cut-off events. [2024-11-17 03:19:19,331 INFO L125 PetriNetUnfolderBase]: For 54630/54630 co-relation queries the response was YES. [2024-11-17 03:19:19,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32236 conditions, 6758 events. 4221/6758 cut-off events. For 54630/54630 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 39088 event pairs, 1189 based on Foata normal form. 68/6824 useless extension candidates. Maximal degree in co-relation 32192. Up to 2642 conditions per place. [2024-11-17 03:19:19,370 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 127 selfloop transitions, 22 changer transitions 99/253 dead transitions. [2024-11-17 03:19:19,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 253 transitions, 2920 flow [2024-11-17 03:19:19,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 03:19:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-17 03:19:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 336 transitions. [2024-11-17 03:19:19,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44919786096256686 [2024-11-17 03:19:19,371 INFO L175 Difference]: Start difference. First operand has 109 places, 82 transitions, 930 flow. Second operand 17 states and 336 transitions. [2024-11-17 03:19:19,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 253 transitions, 2920 flow [2024-11-17 03:19:19,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 253 transitions, 2793 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-11-17 03:19:19,436 INFO L231 Difference]: Finished difference. Result has 127 places, 78 transitions, 935 flow [2024-11-17 03:19:19,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=935, PETRI_PLACES=127, PETRI_TRANSITIONS=78} [2024-11-17 03:19:19,436 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 78 predicate places. [2024-11-17 03:19:19,437 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 78 transitions, 935 flow [2024-11-17 03:19:19,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 0 states have call successors, (0), 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-17 03:19:19,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:19,437 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] [2024-11-17 03:19:19,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 03:19:19,437 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash -490636543, now seen corresponding path program 3 times [2024-11-17 03:19:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:19,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619933485] [2024-11-17 03:19:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:19,602 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-17 03:19:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619933485] [2024-11-17 03:19:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619933485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:19,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:19,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:19:19,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748948495] [2024-11-17 03:19:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:19:19,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:19:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:19:19,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:19,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 78 transitions, 935 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:19,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:19,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:19,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:19,983 INFO L124 PetriNetUnfolderBase]: 1946/3172 cut-off events. [2024-11-17 03:19:19,983 INFO L125 PetriNetUnfolderBase]: For 32110/32111 co-relation queries the response was YES. [2024-11-17 03:19:20,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14983 conditions, 3172 events. 1946/3172 cut-off events. For 32110/32111 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16579 event pairs, 170 based on Foata normal form. 176/3346 useless extension candidates. Maximal degree in co-relation 14931. Up to 1180 conditions per place. [2024-11-17 03:19:20,042 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 97 selfloop transitions, 11 changer transitions 28/141 dead transitions. [2024-11-17 03:19:20,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 141 transitions, 2018 flow [2024-11-17 03:19:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:19:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:19:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-11-17 03:19:20,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-17 03:19:20,043 INFO L175 Difference]: Start difference. First operand has 127 places, 78 transitions, 935 flow. Second operand 6 states and 130 transitions. [2024-11-17 03:19:20,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 141 transitions, 2018 flow [2024-11-17 03:19:20,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 141 transitions, 1488 flow, removed 192 selfloop flow, removed 24 redundant places. [2024-11-17 03:19:20,062 INFO L231 Difference]: Finished difference. Result has 101 places, 65 transitions, 577 flow [2024-11-17 03:19:20,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=101, PETRI_TRANSITIONS=65} [2024-11-17 03:19:20,063 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 52 predicate places. [2024-11-17 03:19:20,063 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 65 transitions, 577 flow [2024-11-17 03:19:20,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:20,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:20,063 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-17 03:19:20,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 03:19:20,063 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:20,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2040798639, now seen corresponding path program 1 times [2024-11-17 03:19:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25271143] [2024-11-17 03:19:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:21,003 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-17 03:19:21,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:21,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25271143] [2024-11-17 03:19:21,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25271143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:19:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804330191] [2024-11-17 03:19:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:19:21,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:21,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:19:21,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:19:21,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:21,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 65 transitions, 577 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 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-17 03:19:21,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:21,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:21,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:21,529 INFO L124 PetriNetUnfolderBase]: 1285/2111 cut-off events. [2024-11-17 03:19:21,529 INFO L125 PetriNetUnfolderBase]: For 9746/9746 co-relation queries the response was YES. [2024-11-17 03:19:21,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8568 conditions, 2111 events. 1285/2111 cut-off events. For 9746/9746 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9714 event pairs, 268 based on Foata normal form. 8/2118 useless extension candidates. Maximal degree in co-relation 8531. Up to 1387 conditions per place. [2024-11-17 03:19:21,539 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 71 selfloop transitions, 11 changer transitions 55/142 dead transitions. [2024-11-17 03:19:21,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 142 transitions, 1234 flow [2024-11-17 03:19:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:19:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-17 03:19:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 230 transitions. [2024-11-17 03:19:21,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37337662337662336 [2024-11-17 03:19:21,540 INFO L175 Difference]: Start difference. First operand has 101 places, 65 transitions, 577 flow. Second operand 14 states and 230 transitions. [2024-11-17 03:19:21,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 142 transitions, 1234 flow [2024-11-17 03:19:21,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 142 transitions, 982 flow, removed 52 selfloop flow, removed 23 redundant places. [2024-11-17 03:19:21,556 INFO L231 Difference]: Finished difference. Result has 92 places, 62 transitions, 451 flow [2024-11-17 03:19:21,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=451, PETRI_PLACES=92, PETRI_TRANSITIONS=62} [2024-11-17 03:19:21,557 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 43 predicate places. [2024-11-17 03:19:21,557 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 62 transitions, 451 flow [2024-11-17 03:19:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 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-17 03:19:21,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:21,557 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-17 03:19:21,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 03:19:21,557 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:21,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:21,558 INFO L85 PathProgramCache]: Analyzing trace with hash 883712627, now seen corresponding path program 2 times [2024-11-17 03:19:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:21,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214763876] [2024-11-17 03:19:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:23,182 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-17 03:19:23,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:19:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214763876] [2024-11-17 03:19:23,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214763876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:23,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:23,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 03:19:23,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149961934] [2024-11-17 03:19:23,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:23,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:19:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:19:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:19:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:19:23,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:23,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 62 transitions, 451 flow. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 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-17 03:19:23,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:23,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:23,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:23,596 INFO L124 PetriNetUnfolderBase]: 1186/1958 cut-off events. [2024-11-17 03:19:23,596 INFO L125 PetriNetUnfolderBase]: For 3790/3790 co-relation queries the response was YES. [2024-11-17 03:19:23,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6238 conditions, 1958 events. 1186/1958 cut-off events. For 3790/3790 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8847 event pairs, 300 based on Foata normal form. 8/1965 useless extension candidates. Maximal degree in co-relation 6215. Up to 1103 conditions per place. [2024-11-17 03:19:23,604 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 59 selfloop transitions, 6 changer transitions 49/119 dead transitions. [2024-11-17 03:19:23,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 119 transitions, 900 flow [2024-11-17 03:19:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:19:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:19:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-11-17 03:19:23,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-11-17 03:19:23,605 INFO L175 Difference]: Start difference. First operand has 92 places, 62 transitions, 451 flow. Second operand 10 states and 175 transitions. [2024-11-17 03:19:23,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 119 transitions, 900 flow [2024-11-17 03:19:23,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 119 transitions, 831 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-11-17 03:19:23,631 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 362 flow [2024-11-17 03:19:23,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=362, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2024-11-17 03:19:23,631 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2024-11-17 03:19:23,631 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 362 flow [2024-11-17 03:19:23,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 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-17 03:19:23,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:23,632 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-17 03:19:23,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 03:19:23,632 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1929797833, now seen corresponding path program 3 times [2024-11-17 03:19:23,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:19:23,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972138089] [2024-11-17 03:19:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:19:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:19:23,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:19:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:19:23,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:19:23,778 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:19:23,779 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-17 03:19:23,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-17 03:19:23,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-17 03:19:23,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-17 03:19:23,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-17 03:19:23,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-17 03:19:23,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-17 03:19:23,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 03:19:23,784 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:19:23,858 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:19:23,858 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:19:23,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:19:23 BasicIcfg [2024-11-17 03:19:23,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:19:23,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:19:23,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:19:23,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:19:23,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:18:51" (3/4) ... [2024-11-17 03:19:23,864 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:19:23,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:19:23,865 INFO L158 Benchmark]: Toolchain (without parser) took 33878.74ms. Allocated memory was 151.0MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 78.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. [2024-11-17 03:19:23,866 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:19:23,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.19ms. Allocated memory is still 151.0MB. Free memory was 78.5MB in the beginning and 106.9MB in the end (delta: -28.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-17 03:19:23,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.02ms. Allocated memory is still 151.0MB. Free memory was 106.9MB in the beginning and 104.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:19:23,866 INFO L158 Benchmark]: Boogie Preprocessor took 51.48ms. Allocated memory is still 151.0MB. Free memory was 104.3MB in the beginning and 99.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:19:23,866 INFO L158 Benchmark]: IcfgBuilder took 751.87ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 99.6MB in the beginning and 131.1MB in the end (delta: -31.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2024-11-17 03:19:23,867 INFO L158 Benchmark]: TraceAbstraction took 32517.00ms. Allocated memory was 199.2MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 131.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 167.3MB. Max. memory is 16.1GB. [2024-11-17 03:19:23,867 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 2.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:19:23,868 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.15ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.19ms. Allocated memory is still 151.0MB. Free memory was 78.5MB in the beginning and 106.9MB in the end (delta: -28.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.02ms. Allocated memory is still 151.0MB. Free memory was 106.9MB in the beginning and 104.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.48ms. Allocated memory is still 151.0MB. Free memory was 104.3MB in the beginning and 99.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 751.87ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 99.6MB in the beginning and 131.1MB in the end (delta: -31.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32517.00ms. Allocated memory was 199.2MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 131.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 167.3MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 2.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-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] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-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] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 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, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 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) [L867] 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)) [L868] 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)) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L877] 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=1, __unbuffered_p2_EBX=1, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe004_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 32.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1762 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1757 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5430 IncrementalHoareTripleChecker+Invalid, 5727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 3 mSDtfsCounter, 5430 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1244occurred in iteration=11, InterpolantAutomatonStates: 171, 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.6s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 4664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 03:19:23,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/safe004_power.oepc_pso.oepc_rmo.oepc.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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:19:25,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:19:25,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:19:25,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:19:25,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:19:25,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:19:25,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:19:25,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:19:25,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:19:25,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:19:25,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:19:25,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:19:25,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:19:25,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:19:25,923 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:19:25,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:19:25,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:19:25,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:19:25,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:19:25,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:19:25,928 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:19:25,928 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:19:25,928 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:19:25,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:19:25,928 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:19:25,929 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:19:25,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:19:25,929 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:19:25,929 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:19:25,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:19:25,929 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:19:25,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:19:25,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:19:25,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:19:25,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:19:25,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:19:25,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:19:25,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:19:25,931 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:19:25,931 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:19:25,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:19:25,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:19:25,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:19:25,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:19:25,933 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2024-11-17 03:19:26,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:19:26,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:19:26,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:19:26,212 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:19:26,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:19:26,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:19:27,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:19:27,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:19:27,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:19:27,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0186af132/2274cafb60bf4c00a2405918c560ef91/FLAG57508567e [2024-11-17 03:19:27,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0186af132/2274cafb60bf4c00a2405918c560ef91 [2024-11-17 03:19:27,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:19:27,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:19:27,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:19:27,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:19:27,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:19:27,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:19:27" (1/1) ... [2024-11-17 03:19:27,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4faea539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:27, skipping insertion in model container [2024-11-17 03:19:27,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:19:27" (1/1) ... [2024-11-17 03:19:27,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:19:28,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:19:28,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:19:28,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:19:28,261 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:19:28,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28 WrapperNode [2024-11-17 03:19:28,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:19:28,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:19:28,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:19:28,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:19:28,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,326 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-17 03:19:28,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:19:28,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:19:28,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:19:28,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:19:28,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,361 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-17 03:19:28,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:19:28,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:19:28,376 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:19:28,376 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:19:28,377 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (1/1) ... [2024-11-17 03:19:28,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:19:28,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:19:28,403 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-17 03:19:28,408 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-17 03:19:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:19:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:19:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:19:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:19:28,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:19:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:19:28,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:19:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:19:28,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:19:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:19:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:19:28,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:19:28,443 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:19:28,583 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:19:28,585 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:19:28,951 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:19:28,951 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:19:29,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:19:29,174 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:19:29,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:19:29 BoogieIcfgContainer [2024-11-17 03:19:29,174 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:19:29,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:19:29,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:19:29,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:19:29,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:19:27" (1/3) ... [2024-11-17 03:19:29,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ad9788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:29, skipping insertion in model container [2024-11-17 03:19:29,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:28" (2/3) ... [2024-11-17 03:19:29,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ad9788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:29, skipping insertion in model container [2024-11-17 03:19:29,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:19:29" (3/3) ... [2024-11-17 03:19:29,182 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:19:29,194 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:19:29,194 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:19:29,194 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:19:29,250 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:19:29,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-17 03:19:29,299 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-17 03:19:29,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:19:29,302 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 4. Compared 73 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-17 03:19:29,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-17 03:19:29,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-17 03:19:29,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:19:29,318 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;@647aca7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:19:29,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-17 03:19:29,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:19:29,321 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-17 03:19:29,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:19:29,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:29,321 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:19:29,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:29,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash 13927631, now seen corresponding path program 1 times [2024-11-17 03:19:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:29,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224368500] [2024-11-17 03:19:29,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:29,334 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-17 03:19:29,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:29,336 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-17 03:19:29,337 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-17 03:19:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:29,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:19:29,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:29,440 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-17 03:19:29,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:29,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:29,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224368500] [2024-11-17 03:19:29,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224368500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:29,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:29,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:19:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644493590] [2024-11-17 03:19:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:29,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:19:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:29,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:19:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:19:29,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:29,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:29,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:29,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:29,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:30,372 INFO L124 PetriNetUnfolderBase]: 5315/7708 cut-off events. [2024-11-17 03:19:30,372 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-17 03:19:30,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15359 conditions, 7708 events. 5315/7708 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 43541 event pairs, 575 based on Foata normal form. 432/8138 useless extension candidates. Maximal degree in co-relation 15348. Up to 6611 conditions per place. [2024-11-17 03:19:30,408 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-11-17 03:19:30,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 241 flow [2024-11-17 03:19:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:19:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:19:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-17 03:19:30,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-17 03:19:30,418 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 88 transitions. [2024-11-17 03:19:30,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 241 flow [2024-11-17 03:19:30,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:19:30,422 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-17 03:19:30,424 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-17 03:19:30,426 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-17 03:19:30,426 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-17 03:19:30,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:30,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:30,426 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:19:30,430 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-17 03:19:30,629 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-17 03:19:30,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:30,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash 780230218, now seen corresponding path program 1 times [2024-11-17 03:19:30,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:30,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099729863] [2024-11-17 03:19:30,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:30,648 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-17 03:19:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:30,651 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-17 03:19:30,652 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-17 03:19:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:30,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:19:30,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:30,824 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-17 03:19:30,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:30,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:30,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099729863] [2024-11-17 03:19:30,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099729863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:30,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:30,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:19:30,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324176886] [2024-11-17 03:19:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:30,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:19:30,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:19:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:19:30,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:30,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:30,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:30,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:30,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:31,517 INFO L124 PetriNetUnfolderBase]: 3819/6233 cut-off events. [2024-11-17 03:19:31,517 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2024-11-17 03:19:31,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12201 conditions, 6233 events. 3819/6233 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 38198 event pairs, 535 based on Foata normal form. 216/6444 useless extension candidates. Maximal degree in co-relation 12191. Up to 3501 conditions per place. [2024-11-17 03:19:31,540 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 56 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2024-11-17 03:19:31,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 280 flow [2024-11-17 03:19:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:19:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:19:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-11-17 03:19:31,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-11-17 03:19:31,542 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 104 transitions. [2024-11-17 03:19:31,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 280 flow [2024-11-17 03:19:31,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:19:31,544 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-11-17 03:19:31,544 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-17 03:19:31,545 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-17 03:19:31,545 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-11-17 03:19:31,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:31,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:31,548 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-17 03:19:31,551 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-17 03:19:31,748 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-17 03:19:31,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:31,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash -811611850, now seen corresponding path program 1 times [2024-11-17 03:19:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:31,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571311652] [2024-11-17 03:19:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:31,750 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-17 03:19:31,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:31,753 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-17 03:19:31,753 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-17 03:19:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:31,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:19:31,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:31,870 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-17 03:19:31,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:31,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:31,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571311652] [2024-11-17 03:19:31,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571311652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:31,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:31,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:19:31,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795076428] [2024-11-17 03:19:31,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:31,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:19:31,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:31,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:19:31,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:19:31,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:31,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:31,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:31,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:31,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:32,217 INFO L124 PetriNetUnfolderBase]: 2043/3337 cut-off events. [2024-11-17 03:19:32,217 INFO L125 PetriNetUnfolderBase]: For 616/616 co-relation queries the response was YES. [2024-11-17 03:19:32,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7449 conditions, 3337 events. 2043/3337 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 17405 event pairs, 339 based on Foata normal form. 152/3484 useless extension candidates. Maximal degree in co-relation 7437. Up to 1149 conditions per place. [2024-11-17 03:19:32,232 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 71 selfloop transitions, 8 changer transitions 1/87 dead transitions. [2024-11-17 03:19:32,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 389 flow [2024-11-17 03:19:32,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:19:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:19:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-17 03:19:32,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-17 03:19:32,233 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 132 transitions. [2024-11-17 03:19:32,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 389 flow [2024-11-17 03:19:32,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 379 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:19:32,237 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-11-17 03:19:32,238 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-17 03:19:32,238 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-17 03:19:32,238 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-11-17 03:19:32,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:32,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:32,239 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-17 03:19:32,243 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-17 03:19:32,442 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-17 03:19:32,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:32,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash 465845779, now seen corresponding path program 1 times [2024-11-17 03:19:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:32,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730485735] [2024-11-17 03:19:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:32,446 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-17 03:19:32,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:32,449 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-17 03:19:32,450 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-17 03:19:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:32,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:19:32,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:32,585 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-17 03:19:32,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:32,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730485735] [2024-11-17 03:19:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730485735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:32,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:19:32,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3148820] [2024-11-17 03:19:32,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:32,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:19:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:32,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:19:32,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:19:32,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:32,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:32,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:32,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:32,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:32,957 INFO L124 PetriNetUnfolderBase]: 1179/1849 cut-off events. [2024-11-17 03:19:32,957 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2024-11-17 03:19:32,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 1849 events. 1179/1849 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 8096 event pairs, 303 based on Foata normal form. 56/1900 useless extension candidates. Maximal degree in co-relation 4599. Up to 672 conditions per place. [2024-11-17 03:19:32,970 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 60 selfloop transitions, 11 changer transitions 1/79 dead transitions. [2024-11-17 03:19:32,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 380 flow [2024-11-17 03:19:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:19:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:19:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-11-17 03:19:32,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-11-17 03:19:32,976 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 134 transitions. [2024-11-17 03:19:32,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 380 flow [2024-11-17 03:19:32,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 355 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-17 03:19:32,988 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-11-17 03:19:32,988 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-17 03:19:32,989 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-17 03:19:32,989 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-11-17 03:19:32,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:32,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:32,990 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-17 03:19:32,994 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 (5)] Forceful destruction successful, exit code 0 [2024-11-17 03:19:33,191 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-17 03:19:33,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:33,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2033688134, now seen corresponding path program 1 times [2024-11-17 03:19:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:33,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046092448] [2024-11-17 03:19:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:33,193 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-17 03:19:33,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:33,194 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-17 03:19:33,195 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-17 03:19:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:33,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:19:33,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:33,328 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-17 03:19:33,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:33,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:33,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046092448] [2024-11-17 03:19:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046092448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:33,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:19:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457339558] [2024-11-17 03:19:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:19:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:33,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:19:33,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:19:33,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-17 03:19:33,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:33,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:33,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-17 03:19:33,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:33,531 INFO L124 PetriNetUnfolderBase]: 1079/1685 cut-off events. [2024-11-17 03:19:33,531 INFO L125 PetriNetUnfolderBase]: For 1096/1096 co-relation queries the response was YES. [2024-11-17 03:19:33,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 1685 events. 1079/1685 cut-off events. For 1096/1096 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7189 event pairs, 1011 based on Foata normal form. 8/1688 useless extension candidates. Maximal degree in co-relation 4215. Up to 1652 conditions per place. [2024-11-17 03:19:33,539 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 33 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-17 03:19:33,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 234 flow [2024-11-17 03:19:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:19:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:19:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-17 03:19:33,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-11-17 03:19:33,540 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 57 transitions. [2024-11-17 03:19:33,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 234 flow [2024-11-17 03:19:33,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 178 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-17 03:19:33,545 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-11-17 03:19:33,546 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-17 03:19:33,546 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-17 03:19:33,546 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-11-17 03:19:33,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:33,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:33,547 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-17 03:19:33,555 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-17 03:19:33,747 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-17 03:19:33,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:33,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash -754558087, now seen corresponding path program 1 times [2024-11-17 03:19:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916240196] [2024-11-17 03:19:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:19:33,753 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-17 03:19:33,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:33,755 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-17 03:19:33,756 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-17 03:19:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:19:33,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:19:33,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:34,068 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-17 03:19:34,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:34,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916240196] [2024-11-17 03:19:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916240196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:34,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:34,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:19:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628171502] [2024-11-17 03:19:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:34,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:19:34,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:19:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:19:34,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:34,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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-17 03:19:34,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:34,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:34,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:34,337 INFO L124 PetriNetUnfolderBase]: 1641/2569 cut-off events. [2024-11-17 03:19:34,337 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2024-11-17 03:19:34,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 2569 events. 1641/2569 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12536 event pairs, 735 based on Foata normal form. 8/2574 useless extension candidates. Maximal degree in co-relation 5627. Up to 1419 conditions per place. [2024-11-17 03:19:34,344 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 20/75 dead transitions. [2024-11-17 03:19:34,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 339 flow [2024-11-17 03:19:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:19:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:19:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-17 03:19:34,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2024-11-17 03:19:34,346 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 5 states and 108 transitions. [2024-11-17 03:19:34,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 339 flow [2024-11-17 03:19:34,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:19:34,347 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 119 flow [2024-11-17 03:19:34,348 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-17 03:19:34,348 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2024-11-17 03:19:34,348 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 119 flow [2024-11-17 03:19:34,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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-17 03:19:34,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:34,349 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-17 03:19:34,355 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-17 03:19:34,549 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-17 03:19:34,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -49455803, now seen corresponding path program 2 times [2024-11-17 03:19:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:34,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596620748] [2024-11-17 03:19:34,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:19:34,551 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-17 03:19:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:34,553 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-17 03:19:34,554 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-17 03:19:34,638 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:19:34,638 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:19:34,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:19:34,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:34,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-17 03:19:34,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:34,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:34,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596620748] [2024-11-17 03:19:34,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596620748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:34,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:34,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:19:34,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375798944] [2024-11-17 03:19:34,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:34,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:19:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:34,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:19:34,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:19:34,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:34,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 119 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:34,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:34,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:34,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:35,272 INFO L124 PetriNetUnfolderBase]: 1272/2031 cut-off events. [2024-11-17 03:19:35,273 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-17 03:19:35,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 2031 events. 1272/2031 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9385 event pairs, 315 based on Foata normal form. 8/2038 useless extension candidates. Maximal degree in co-relation 4674. Up to 818 conditions per place. [2024-11-17 03:19:35,278 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 56 selfloop transitions, 6 changer transitions 40/108 dead transitions. [2024-11-17 03:19:35,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 514 flow [2024-11-17 03:19:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:19:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:19:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-11-17 03:19:35,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-11-17 03:19:35,280 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 119 flow. Second operand 9 states and 177 transitions. [2024-11-17 03:19:35,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 514 flow [2024-11-17 03:19:35,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 108 transitions, 496 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:19:35,282 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 151 flow [2024-11-17 03:19:35,282 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2024-11-17 03:19:35,283 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-11-17 03:19:35,283 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 151 flow [2024-11-17 03:19:35,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:35,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:35,283 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-17 03:19:35,290 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 (8)] Forceful destruction successful, exit code 0 [2024-11-17 03:19:35,486 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-17 03:19:35,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1332755265, now seen corresponding path program 3 times [2024-11-17 03:19:35,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:35,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513560788] [2024-11-17 03:19:35,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:19:35,488 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-17 03:19:35,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:35,495 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-17 03:19:35,497 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-17 03:19:35,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-17 03:19:35,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:19:35,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 03:19:35,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:35,796 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-17 03:19:35,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:35,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:35,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513560788] [2024-11-17 03:19:35,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513560788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:35,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:19:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012277435] [2024-11-17 03:19:35,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:35,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:19:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:19:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:19:35,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:35,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 151 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:35,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:35,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:35,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:36,204 INFO L124 PetriNetUnfolderBase]: 1254/2031 cut-off events. [2024-11-17 03:19:36,205 INFO L125 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2024-11-17 03:19:36,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5046 conditions, 2031 events. 1254/2031 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9354 event pairs, 337 based on Foata normal form. 8/2038 useless extension candidates. Maximal degree in co-relation 5032. Up to 760 conditions per place. [2024-11-17 03:19:36,216 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 69 selfloop transitions, 6 changer transitions 30/111 dead transitions. [2024-11-17 03:19:36,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 111 transitions, 558 flow [2024-11-17 03:19:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:19:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:19:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-11-17 03:19:36,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44191919191919193 [2024-11-17 03:19:36,218 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 151 flow. Second operand 9 states and 175 transitions. [2024-11-17 03:19:36,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 111 transitions, 558 flow [2024-11-17 03:19:36,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 111 transitions, 545 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-11-17 03:19:36,221 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 172 flow [2024-11-17 03:19:36,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=172, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2024-11-17 03:19:36,224 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2024-11-17 03:19:36,224 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 172 flow [2024-11-17 03:19:36,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:19:36,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:36,225 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-17 03:19:36,232 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 (9)] Forceful destruction successful, exit code 0 [2024-11-17 03:19:36,425 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-17 03:19:36,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1883220931, now seen corresponding path program 4 times [2024-11-17 03:19:36,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297104039] [2024-11-17 03:19:36,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:19:36,427 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-17 03:19:36,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:36,429 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-17 03:19:36,430 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-17 03:19:36,508 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:19:36,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:19:36,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 03:19:36,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:36,702 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-17 03:19:36,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:36,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297104039] [2024-11-17 03:19:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297104039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:36,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:19:36,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687243911] [2024-11-17 03:19:36,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:36,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:19:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:19:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:19:36,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:36,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-17 03:19:36,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:36,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:36,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:36,991 INFO L124 PetriNetUnfolderBase]: 1615/2598 cut-off events. [2024-11-17 03:19:36,991 INFO L125 PetriNetUnfolderBase]: For 1537/1538 co-relation queries the response was YES. [2024-11-17 03:19:36,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6768 conditions, 2598 events. 1615/2598 cut-off events. For 1537/1538 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12375 event pairs, 423 based on Foata normal form. 9/2606 useless extension candidates. Maximal degree in co-relation 6752. Up to 1420 conditions per place. [2024-11-17 03:19:37,000 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 51 selfloop transitions, 4 changer transitions 28/89 dead transitions. [2024-11-17 03:19:37,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 494 flow [2024-11-17 03:19:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:19:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:19:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-11-17 03:19:37,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-17 03:19:37,002 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 172 flow. Second operand 6 states and 124 transitions. [2024-11-17 03:19:37,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 494 flow [2024-11-17 03:19:37,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 468 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-17 03:19:37,005 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 186 flow [2024-11-17 03:19:37,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-11-17 03:19:37,005 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-11-17 03:19:37,005 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 186 flow [2024-11-17 03:19:37,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-17 03:19:37,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:37,006 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-17 03:19:37,013 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-17 03:19:37,210 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-17 03:19:37,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:37,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1157077893, now seen corresponding path program 5 times [2024-11-17 03:19:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:37,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613149012] [2024-11-17 03:19:37,211 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 03:19:37,211 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-17 03:19:37,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:37,212 INFO L229 MonitoredProcess]: Starting monitored process 11 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-17 03:19:37,213 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 (11)] Waiting until timeout for monitored process [2024-11-17 03:19:37,299 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:19:37,299 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:19:37,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-17 03:19:37,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:19:37,855 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-17 03:19:37,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:19:37,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:19:37,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613149012] [2024-11-17 03:19:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613149012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:19:37,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:19:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:19:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13868947] [2024-11-17 03:19:37,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:19:37,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:19:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:19:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:19:37,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:19:37,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-17 03:19:37,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 186 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 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-17 03:19:37,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:19:37,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-17 03:19:37,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:19:38,274 INFO L124 PetriNetUnfolderBase]: 859/1427 cut-off events. [2024-11-17 03:19:38,274 INFO L125 PetriNetUnfolderBase]: For 742/742 co-relation queries the response was YES. [2024-11-17 03:19:38,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 1427 events. 859/1427 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5977 event pairs, 172 based on Foata normal form. 8/1434 useless extension candidates. Maximal degree in co-relation 3771. Up to 672 conditions per place. [2024-11-17 03:19:38,279 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 46 selfloop transitions, 4 changer transitions 45/101 dead transitions. [2024-11-17 03:19:38,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 545 flow [2024-11-17 03:19:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:19:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:19:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-11-17 03:19:38,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-11-17 03:19:38,280 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 186 flow. Second operand 9 states and 168 transitions. [2024-11-17 03:19:38,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 545 flow [2024-11-17 03:19:38,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 101 transitions, 526 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-17 03:19:38,282 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 163 flow [2024-11-17 03:19:38,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=9, PETRI_FLOW=163, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2024-11-17 03:19:38,283 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2024-11-17 03:19:38,283 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 163 flow [2024-11-17 03:19:38,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 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-17 03:19:38,284 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:19:38,284 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-17 03:19:38,288 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 (11)] Ended with exit code 0 [2024-11-17 03:19:38,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-17 03:19:38,485 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-17 03:19:38,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:19:38,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1075486383, now seen corresponding path program 6 times [2024-11-17 03:19:38,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:19:38,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688821155] [2024-11-17 03:19:38,486 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 03:19:38,486 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-17 03:19:38,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:19:38,488 INFO L229 MonitoredProcess]: Starting monitored process 12 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-17 03:19:38,489 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 (12)] Waiting until timeout for monitored process [2024-11-17 03:19:38,565 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-17 03:19:38,566 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 03:19:38,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:19:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:19:38,653 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:19:38,653 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:19:38,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-17 03:19:38,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-17 03:19:38,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-17 03:19:38,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-17 03:19:38,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-17 03:19:38,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-17 03:19:38,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-17 03:19:38,661 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 (12)] Forceful destruction successful, exit code 0 [2024-11-17 03:19:38,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-17 03:19:38,856 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-17 03:19:38,919 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:19:38,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:19:38,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:19:38 BasicIcfg [2024-11-17 03:19:38,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:19:38,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:19:38,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:19:38,923 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:19:38,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:19:29" (3/4) ... [2024-11-17 03:19:38,925 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:19:38,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:19:38,926 INFO L158 Benchmark]: Toolchain (without parser) took 11176.47ms. Allocated memory was 71.3MB in the beginning and 675.3MB in the end (delta: 604.0MB). Free memory was 32.3MB in the beginning and 233.5MB in the end (delta: -201.2MB). Peak memory consumption was 401.1MB. Max. memory is 16.1GB. [2024-11-17 03:19:38,926 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 71.3MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:19:38,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.32ms. Allocated memory was 71.3MB in the beginning and 115.3MB in the end (delta: 44.0MB). Free memory was 32.1MB in the beginning and 88.7MB in the end (delta: -56.6MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-17 03:19:38,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.69ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 86.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:19:38,927 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 115.3MB. Free memory was 86.0MB in the beginning and 81.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:19:38,927 INFO L158 Benchmark]: IcfgBuilder took 798.65ms. Allocated memory is still 115.3MB. Free memory was 81.8MB in the beginning and 49.4MB in the end (delta: 32.4MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-11-17 03:19:38,927 INFO L158 Benchmark]: TraceAbstraction took 9746.63ms. Allocated memory was 115.3MB in the beginning and 675.3MB in the end (delta: 559.9MB). Free memory was 48.6MB in the beginning and 234.5MB in the end (delta: -185.9MB). Peak memory consumption was 374.5MB. Max. memory is 16.1GB. [2024-11-17 03:19:38,928 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 675.3MB. Free memory was 234.5MB in the beginning and 233.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:19:38,929 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 71.3MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.32ms. Allocated memory was 71.3MB in the beginning and 115.3MB in the end (delta: 44.0MB). Free memory was 32.1MB in the beginning and 88.7MB in the end (delta: -56.6MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.69ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 86.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 115.3MB. Free memory was 86.0MB in the beginning and 81.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 798.65ms. Allocated memory is still 115.3MB. Free memory was 81.8MB in the beginning and 49.4MB in the end (delta: 32.4MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9746.63ms. Allocated memory was 115.3MB in the beginning and 675.3MB in the end (delta: 559.9MB). Free memory was 48.6MB in the beginning and 234.5MB in the end (delta: -185.9MB). Peak memory consumption was 374.5MB. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 675.3MB. Free memory was 234.5MB in the beginning and 233.5MB in the end (delta: 1.0MB). 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; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=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] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=0, t1874=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] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=0, t1874=1, t1875=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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 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, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 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) [L867] 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)) [L868] 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)) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L877] 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=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe004_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 9.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 520 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2082 IncrementalHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 11 mSDtfsCounter, 2082 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1309 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-17 03:19:38,950 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