./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:30:45,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:30:45,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:30:45,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:30:45,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:30:45,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:30:45,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:30:45,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:30:45,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:30:45,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:30:45,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:30:45,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:30:45,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:30:45,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:30:45,287 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:30:45,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:30:45,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:30:45,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:30:45,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:30:45,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:30:45,289 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:30:45,289 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:30:45,290 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:30:45,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:30:45,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:30:45,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:30:45,291 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:30:45,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:30:45,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:30:45,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:30:45,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:30:45,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:30:45,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:30:45,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:30:45,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:30:45,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:30:45,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:30:45,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:30:45,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:30:45,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:30:45,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:30:45,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:30:45,295 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-11-22 21:30:45,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:30:45,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:30:45,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:30:45,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:30:45,477 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:30:45,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-22 21:30:47,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:30:47,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:30:47,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-22 21:30:47,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980f29fae/a0f4742a2d8442faa9799f0c2fdabed5/FLAG6d6db5704 [2024-11-22 21:30:47,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980f29fae/a0f4742a2d8442faa9799f0c2fdabed5 [2024-11-22 21:30:47,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:30:47,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:30:47,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:30:47,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:30:47,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:30:47,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49973b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47, skipping insertion in model container [2024-11-22 21:30:47,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:30:47,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:30:47,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:30:47,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:30:47,838 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:30:47,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47 WrapperNode [2024-11-22 21:30:47,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:30:47,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:30:47,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:30:47,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:30:47,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,897 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-22 21:30:47,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:30:47,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:30:47,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:30:47,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:30:47,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,937 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-22 21:30:47,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:30:47,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:30:47,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:30:47,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:30:47,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (1/1) ... [2024-11-22 21:30:47,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:30:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:30:47,993 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-22 21:30:48,005 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-22 21:30:48,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:30:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:30:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:30:48,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:30:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:30:48,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:30:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:30:48,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:30:48,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:30:48,049 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:30:48,146 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:30:48,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:30:48,588 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:30:48,588 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:30:48,711 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:30:48,711 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:30:48,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:48 BoogieIcfgContainer [2024-11-22 21:30:48,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:30:48,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:30:48,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:30:48,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:30:48,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:30:47" (1/3) ... [2024-11-22 21:30:48,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505a71de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:48, skipping insertion in model container [2024-11-22 21:30:48,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:47" (2/3) ... [2024-11-22 21:30:48,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505a71de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:48, skipping insertion in model container [2024-11-22 21:30:48,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:48" (3/3) ... [2024-11-22 21:30:48,720 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-22 21:30:48,731 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:30:48,732 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:30:48,732 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:30:48,768 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:30:48,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-22 21:30:48,810 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-22 21:30:48,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:48,813 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 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-22 21:30:48,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-22 21:30:48,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-22 21:30:48,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:30:48,834 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;@3912a8e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:30:48,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 21:30:48,838 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:30:48,839 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:30:48,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:48,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:48,840 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:30:48,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash 11936538, now seen corresponding path program 1 times [2024-11-22 21:30:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553204196] [2024-11-22 21:30:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:49,179 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-22 21:30:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:49,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553204196] [2024-11-22 21:30:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553204196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:49,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:49,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:30:49,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001825175] [2024-11-22 21:30:49,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:49,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:30:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:30:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:30:49,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-22 21:30:49,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:49,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:49,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-22 21:30:49,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:49,560 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-22 21:30:49,560 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:30:49,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8336 event pairs, 104 based on Foata normal form. 72/1334 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-22 21:30:49,573 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-22 21:30:49,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-22 21:30:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:30:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:30:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-22 21:30:49,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-22 21:30:49,587 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-22 21:30:49,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-22 21:30:49,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:30:49,593 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-22 21:30:49,594 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-22 21:30:49,598 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-22 21:30:49,599 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-22 21:30:49,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:49,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:49,599 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:49,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:30:49,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:49,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1110516793, now seen corresponding path program 1 times [2024-11-22 21:30:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:49,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781999385] [2024-11-22 21:30:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:49,709 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-22 21:30:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781999385] [2024-11-22 21:30:49,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781999385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:49,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:49,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:30:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755807179] [2024-11-22 21:30:49,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:49,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:30:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:49,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:30:49,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:30:49,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-22 21:30:49,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:49,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:49,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-22 21:30:49,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:49,894 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-11-22 21:30:49,894 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-22 21:30:49,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7025 event pairs, 605 based on Foata normal form. 36/1130 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-11-22 21:30:49,910 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-22 21:30:49,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-22 21:30:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:30:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:30:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-22 21:30:49,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-22 21:30:49,912 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-22 21:30:49,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-22 21:30:49,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:30:49,913 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-22 21:30:49,913 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-22 21:30:49,913 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-22 21:30:49,914 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-22 21:30:49,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:49,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:49,914 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:49,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:30:49,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:49,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1110515302, now seen corresponding path program 1 times [2024-11-22 21:30:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018676542] [2024-11-22 21:30:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:50,561 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-22 21:30:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018676542] [2024-11-22 21:30:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018676542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878863743] [2024-11-22 21:30:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:50,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:30:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:30:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:30:50,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:50,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:50,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:50,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:50,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:51,320 INFO L124 PetriNetUnfolderBase]: 2046/3482 cut-off events. [2024-11-22 21:30:51,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:51,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6567 conditions, 3482 events. 2046/3482 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22482 event pairs, 295 based on Foata normal form. 0/3393 useless extension candidates. Maximal degree in co-relation 6561. Up to 1454 conditions per place. [2024-11-22 21:30:51,332 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 35 selfloop transitions, 8 changer transitions 71/125 dead transitions. [2024-11-22 21:30:51,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 125 transitions, 486 flow [2024-11-22 21:30:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:30:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 21:30:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 297 transitions. [2024-11-22 21:30:51,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-22 21:30:51,336 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 297 transitions. [2024-11-22 21:30:51,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 125 transitions, 486 flow [2024-11-22 21:30:51,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 125 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:30:51,339 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 175 flow [2024-11-22 21:30:51,339 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=175, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2024-11-22 21:30:51,340 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-11-22 21:30:51,340 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 175 flow [2024-11-22 21:30:51,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:51,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:51,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:51,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:30:51,341 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:51,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -187697849, now seen corresponding path program 1 times [2024-11-22 21:30:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:51,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838533835] [2024-11-22 21:30:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:51,767 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-22 21:30:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838533835] [2024-11-22 21:30:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838533835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:51,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:51,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315455224] [2024-11-22 21:30:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:51,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:30:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:51,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:30:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:30:51,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-22 21:30:51,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:51,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:51,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-22 21:30:51,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:52,621 INFO L124 PetriNetUnfolderBase]: 2257/3687 cut-off events. [2024-11-22 21:30:52,622 INFO L125 PetriNetUnfolderBase]: For 8772/8796 co-relation queries the response was YES. [2024-11-22 21:30:52,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13006 conditions, 3687 events. 2257/3687 cut-off events. For 8772/8796 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22804 event pairs, 193 based on Foata normal form. 103/3777 useless extension candidates. Maximal degree in co-relation 12988. Up to 1470 conditions per place. [2024-11-22 21:30:52,643 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 55 selfloop transitions, 27 changer transitions 82/174 dead transitions. [2024-11-22 21:30:52,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 174 transitions, 1239 flow [2024-11-22 21:30:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:30:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-22 21:30:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 328 transitions. [2024-11-22 21:30:52,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5734265734265734 [2024-11-22 21:30:52,647 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 175 flow. Second operand 13 states and 328 transitions. [2024-11-22 21:30:52,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 174 transitions, 1239 flow [2024-11-22 21:30:52,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 174 transitions, 1110 flow, removed 62 selfloop flow, removed 5 redundant places. [2024-11-22 21:30:52,674 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 461 flow [2024-11-22 21:30:52,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=461, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-11-22 21:30:52,674 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-11-22 21:30:52,675 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 461 flow [2024-11-22 21:30:52,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:52,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:52,675 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:52,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:30:52,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:52,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash -633034119, now seen corresponding path program 2 times [2024-11-22 21:30:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735543973] [2024-11-22 21:30:52,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:30:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:52,692 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:30:52,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:53,134 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-22 21:30:53,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735543973] [2024-11-22 21:30:53,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735543973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:53,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:30:53,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122678454] [2024-11-22 21:30:53,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:53,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:30:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:53,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:30:53,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:30:53,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-22 21:30:53,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 461 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-22 21:30:53,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:53,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-22 21:30:53,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:53,778 INFO L124 PetriNetUnfolderBase]: 2408/3969 cut-off events. [2024-11-22 21:30:53,778 INFO L125 PetriNetUnfolderBase]: For 27601/27639 co-relation queries the response was YES. [2024-11-22 21:30:53,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20073 conditions, 3969 events. 2408/3969 cut-off events. For 27601/27639 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25048 event pairs, 319 based on Foata normal form. 90/4041 useless extension candidates. Maximal degree in co-relation 20046. Up to 1482 conditions per place. [2024-11-22 21:30:53,804 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 50 selfloop transitions, 10 changer transitions 71/141 dead transitions. [2024-11-22 21:30:53,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 141 transitions, 1514 flow [2024-11-22 21:30:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:30:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:30:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-11-22 21:30:53,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-22 21:30:53,806 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 461 flow. Second operand 9 states and 220 transitions. [2024-11-22 21:30:53,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 141 transitions, 1514 flow [2024-11-22 21:30:53,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 141 transitions, 1468 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-11-22 21:30:53,825 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 373 flow [2024-11-22 21:30:53,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=373, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2024-11-22 21:30:53,826 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-11-22 21:30:53,826 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 373 flow [2024-11-22 21:30:53,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-22 21:30:53,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:53,826 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-22 21:30:53,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:30:53,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:53,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:53,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1363118346, now seen corresponding path program 1 times [2024-11-22 21:30:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:53,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714156724] [2024-11-22 21:30:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:54,379 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-22 21:30:54,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:54,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714156724] [2024-11-22 21:30:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714156724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:54,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:54,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:30:54,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113142381] [2024-11-22 21:30:54,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:54,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:30:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:30:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:30:54,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-22 21:30:54,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 373 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-22 21:30:54,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:54,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-22 21:30:54,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:55,095 INFO L124 PetriNetUnfolderBase]: 1593/2685 cut-off events. [2024-11-22 21:30:55,095 INFO L125 PetriNetUnfolderBase]: For 19128/19128 co-relation queries the response was YES. [2024-11-22 21:30:55,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13755 conditions, 2685 events. 1593/2685 cut-off events. For 19128/19128 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15590 event pairs, 537 based on Foata normal form. 72/2750 useless extension candidates. Maximal degree in co-relation 13731. Up to 1643 conditions per place. [2024-11-22 21:30:55,156 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 45 selfloop transitions, 22 changer transitions 49/127 dead transitions. [2024-11-22 21:30:55,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 127 transitions, 1291 flow [2024-11-22 21:30:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:30:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:30:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-11-22 21:30:55,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-22 21:30:55,158 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 373 flow. Second operand 10 states and 242 transitions. [2024-11-22 21:30:55,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 127 transitions, 1291 flow [2024-11-22 21:30:55,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 1160 flow, removed 31 selfloop flow, removed 11 redundant places. [2024-11-22 21:30:55,172 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 497 flow [2024-11-22 21:30:55,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=497, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2024-11-22 21:30:55,173 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2024-11-22 21:30:55,173 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 56 transitions, 497 flow [2024-11-22 21:30:55,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-22 21:30:55,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:55,174 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-22 21:30:55,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:30:55,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:55,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash 383827254, now seen corresponding path program 1 times [2024-11-22 21:30:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:55,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889242267] [2024-11-22 21:30:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:55,458 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-22 21:30:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:55,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889242267] [2024-11-22 21:30:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889242267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:55,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:55,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:30:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742379103] [2024-11-22 21:30:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:55,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:30:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:55,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:30:55,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:30:55,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:30:55,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 56 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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-22 21:30:55,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:55,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:30:55,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:56,082 INFO L124 PetriNetUnfolderBase]: 1293/2235 cut-off events. [2024-11-22 21:30:56,082 INFO L125 PetriNetUnfolderBase]: For 25640/25824 co-relation queries the response was YES. [2024-11-22 21:30:56,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13424 conditions, 2235 events. 1293/2235 cut-off events. For 25640/25824 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13107 event pairs, 551 based on Foata normal form. 214/2392 useless extension candidates. Maximal degree in co-relation 13399. Up to 1371 conditions per place. [2024-11-22 21:30:56,108 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 46 selfloop transitions, 11 changer transitions 40/116 dead transitions. [2024-11-22 21:30:56,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 116 transitions, 1409 flow [2024-11-22 21:30:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:30:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:30:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-11-22 21:30:56,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5659090909090909 [2024-11-22 21:30:56,110 INFO L175 Difference]: Start difference. First operand has 78 places, 56 transitions, 497 flow. Second operand 10 states and 249 transitions. [2024-11-22 21:30:56,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 116 transitions, 1409 flow [2024-11-22 21:30:56,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 1309 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-11-22 21:30:56,125 INFO L231 Difference]: Finished difference. Result has 84 places, 59 transitions, 590 flow [2024-11-22 21:30:56,126 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=590, PETRI_PLACES=84, PETRI_TRANSITIONS=59} [2024-11-22 21:30:56,126 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2024-11-22 21:30:56,127 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 59 transitions, 590 flow [2024-11-22 21:30:56,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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-22 21:30:56,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:56,127 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-22 21:30:56,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:30:56,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:56,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1042347252, now seen corresponding path program 1 times [2024-11-22 21:30:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:56,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702767861] [2024-11-22 21:30:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:56,579 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-22 21:30:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702767861] [2024-11-22 21:30:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702767861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:56,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:30:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575526427] [2024-11-22 21:30:56,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:56,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:30:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:56,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:30:56,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:30:56,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:30:56,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 59 transitions, 590 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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-22 21:30:56,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:56,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:30:56,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:57,006 INFO L124 PetriNetUnfolderBase]: 1360/2364 cut-off events. [2024-11-22 21:30:57,006 INFO L125 PetriNetUnfolderBase]: For 30657/30833 co-relation queries the response was YES. [2024-11-22 21:30:57,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14751 conditions, 2364 events. 1360/2364 cut-off events. For 30657/30833 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13956 event pairs, 440 based on Foata normal form. 221/2544 useless extension candidates. Maximal degree in co-relation 14722. Up to 1501 conditions per place. [2024-11-22 21:30:57,028 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 53 selfloop transitions, 12 changer transitions 35/119 dead transitions. [2024-11-22 21:30:57,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 1418 flow [2024-11-22 21:30:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:30:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:30:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-22 21:30:57,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636 [2024-11-22 21:30:57,029 INFO L175 Difference]: Start difference. First operand has 84 places, 59 transitions, 590 flow. Second operand 8 states and 205 transitions. [2024-11-22 21:30:57,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 1418 flow [2024-11-22 21:30:57,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 119 transitions, 1292 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-11-22 21:30:57,050 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 668 flow [2024-11-22 21:30:57,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2024-11-22 21:30:57,050 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-11-22 21:30:57,051 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 668 flow [2024-11-22 21:30:57,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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-22 21:30:57,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:57,051 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-22 21:30:57,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:30:57,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:57,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1580354623, now seen corresponding path program 1 times [2024-11-22 21:30:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:57,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485731216] [2024-11-22 21:30:57,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:57,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:57,564 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-22 21:30:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485731216] [2024-11-22 21:30:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485731216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:30:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313835339] [2024-11-22 21:30:57,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:57,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:30:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:30:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:30:57,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:30:57,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 668 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-22 21:30:57,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:57,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:30:57,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:58,002 INFO L124 PetriNetUnfolderBase]: 1239/2149 cut-off events. [2024-11-22 21:30:58,002 INFO L125 PetriNetUnfolderBase]: For 29753/29904 co-relation queries the response was YES. [2024-11-22 21:30:58,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13958 conditions, 2149 events. 1239/2149 cut-off events. For 29753/29904 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12470 event pairs, 482 based on Foata normal form. 160/2266 useless extension candidates. Maximal degree in co-relation 13930. Up to 1394 conditions per place. [2024-11-22 21:30:58,021 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 50 selfloop transitions, 10 changer transitions 31/110 dead transitions. [2024-11-22 21:30:58,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 110 transitions, 1374 flow [2024-11-22 21:30:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:30:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:30:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-11-22 21:30:58,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364 [2024-11-22 21:30:58,023 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 668 flow. Second operand 8 states and 202 transitions. [2024-11-22 21:30:58,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 110 transitions, 1374 flow [2024-11-22 21:30:58,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 1336 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-22 21:30:58,038 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 673 flow [2024-11-22 21:30:58,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2024-11-22 21:30:58,039 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-22 21:30:58,039 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 673 flow [2024-11-22 21:30:58,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-22 21:30:58,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:58,043 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-22 21:30:58,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:30:58,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:58,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1328354205, now seen corresponding path program 1 times [2024-11-22 21:30:58,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:58,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379697656] [2024-11-22 21:30:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:58,577 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-22 21:30:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:58,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379697656] [2024-11-22 21:30:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379697656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:58,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:30:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159200357] [2024-11-22 21:30:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:30:58,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:30:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:30:58,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:30:58,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 65 transitions, 673 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 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-22 21:30:58,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:58,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:30:58,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:59,070 INFO L124 PetriNetUnfolderBase]: 1186/2070 cut-off events. [2024-11-22 21:30:59,070 INFO L125 PetriNetUnfolderBase]: For 28768/28912 co-relation queries the response was YES. [2024-11-22 21:30:59,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13392 conditions, 2070 events. 1186/2070 cut-off events. For 28768/28912 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11908 event pairs, 345 based on Foata normal form. 169/2198 useless extension candidates. Maximal degree in co-relation 13361. Up to 1302 conditions per place. [2024-11-22 21:30:59,087 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 54 selfloop transitions, 13 changer transitions 27/113 dead transitions. [2024-11-22 21:30:59,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 1383 flow [2024-11-22 21:30:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:30:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:30:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-11-22 21:30:59,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5710227272727273 [2024-11-22 21:30:59,089 INFO L175 Difference]: Start difference. First operand has 87 places, 65 transitions, 673 flow. Second operand 8 states and 201 transitions. [2024-11-22 21:30:59,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 1383 flow [2024-11-22 21:30:59,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 113 transitions, 1309 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-11-22 21:30:59,107 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 750 flow [2024-11-22 21:30:59,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2024-11-22 21:30:59,109 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 39 predicate places. [2024-11-22 21:30:59,109 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 750 flow [2024-11-22 21:30:59,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 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-22 21:30:59,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:59,110 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-22 21:30:59,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:30:59,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:59,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash -616261378, now seen corresponding path program 1 times [2024-11-22 21:30:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436127628] [2024-11-22 21:30:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:59,524 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-22 21:30:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436127628] [2024-11-22 21:30:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436127628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:59,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:59,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:30:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399202706] [2024-11-22 21:30:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:59,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:30:59,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:59,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:30:59,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:30:59,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:30:59,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 750 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 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-22 21:30:59,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:59,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:30:59,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:00,140 INFO L124 PetriNetUnfolderBase]: 1986/3452 cut-off events. [2024-11-22 21:31:00,140 INFO L125 PetriNetUnfolderBase]: For 58541/58670 co-relation queries the response was YES. [2024-11-22 21:31:00,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23919 conditions, 3452 events. 1986/3452 cut-off events. For 58541/58670 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22207 event pairs, 539 based on Foata normal form. 158/3567 useless extension candidates. Maximal degree in co-relation 23889. Up to 1472 conditions per place. [2024-11-22 21:31:00,172 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 81 selfloop transitions, 33 changer transitions 20/153 dead transitions. [2024-11-22 21:31:00,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 2114 flow [2024-11-22 21:31:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:31:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:31:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-11-22 21:31:00,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6164772727272727 [2024-11-22 21:31:00,173 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 750 flow. Second operand 8 states and 217 transitions. [2024-11-22 21:31:00,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 2114 flow [2024-11-22 21:31:00,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 153 transitions, 1961 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-11-22 21:31:00,203 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 1208 flow [2024-11-22 21:31:00,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1208, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2024-11-22 21:31:00,203 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 42 predicate places. [2024-11-22 21:31:00,204 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 1208 flow [2024-11-22 21:31:00,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 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-22 21:31:00,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:00,204 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-22 21:31:00,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:31:00,204 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:00,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1612613360, now seen corresponding path program 2 times [2024-11-22 21:31:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:00,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731793004] [2024-11-22 21:31:00,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:31:00,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:00,220 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:31:00,220 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:31:00,545 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-22 21:31:00,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731793004] [2024-11-22 21:31:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731793004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:00,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:00,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:31:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174295336] [2024-11-22 21:31:00,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:00,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:31:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:00,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:31:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:31:00,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:31:00,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 1208 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 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-22 21:31:00,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:00,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:31:00,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:01,354 INFO L124 PetriNetUnfolderBase]: 2414/4176 cut-off events. [2024-11-22 21:31:01,354 INFO L125 PetriNetUnfolderBase]: For 79785/79944 co-relation queries the response was YES. [2024-11-22 21:31:01,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30827 conditions, 4176 events. 2414/4176 cut-off events. For 79785/79944 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 27758 event pairs, 461 based on Foata normal form. 256/4385 useless extension candidates. Maximal degree in co-relation 30795. Up to 2219 conditions per place. [2024-11-22 21:31:01,387 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 65 selfloop transitions, 37 changer transitions 39/160 dead transitions. [2024-11-22 21:31:01,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 160 transitions, 2434 flow [2024-11-22 21:31:01,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:31:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:31:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-11-22 21:31:01,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-11-22 21:31:01,394 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 1208 flow. Second operand 9 states and 230 transitions. [2024-11-22 21:31:01,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 160 transitions, 2434 flow [2024-11-22 21:31:01,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 160 transitions, 2371 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-11-22 21:31:01,425 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 1449 flow [2024-11-22 21:31:01,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1449, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2024-11-22 21:31:01,427 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 50 predicate places. [2024-11-22 21:31:01,427 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 1449 flow [2024-11-22 21:31:01,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 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-22 21:31:01,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:01,428 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] [2024-11-22 21:31:01,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:31:01,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash 981761535, now seen corresponding path program 1 times [2024-11-22 21:31:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186125751] [2024-11-22 21:31:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:01,546 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-22 21:31:01,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:01,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186125751] [2024-11-22 21:31:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186125751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:01,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:01,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:01,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549114431] [2024-11-22 21:31:01,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:01,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:31:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:31:01,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:31:01,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-22 21:31:01,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 1449 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:01,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:01,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-22 21:31:01,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:02,414 INFO L124 PetriNetUnfolderBase]: 3122/5392 cut-off events. [2024-11-22 21:31:02,414 INFO L125 PetriNetUnfolderBase]: For 139229/139587 co-relation queries the response was YES. [2024-11-22 21:31:02,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42611 conditions, 5392 events. 3122/5392 cut-off events. For 139229/139587 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 38208 event pairs, 971 based on Foata normal form. 256/5481 useless extension candidates. Maximal degree in co-relation 42576. Up to 2202 conditions per place. [2024-11-22 21:31:02,455 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 68 selfloop transitions, 4 changer transitions 55/146 dead transitions. [2024-11-22 21:31:02,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 146 transitions, 2675 flow [2024-11-22 21:31:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:31:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:31:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-22 21:31:02,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-22 21:31:02,459 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 1449 flow. Second operand 5 states and 132 transitions. [2024-11-22 21:31:02,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 146 transitions, 2675 flow [2024-11-22 21:31:02,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 146 transitions, 2625 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:02,519 INFO L231 Difference]: Finished difference. Result has 98 places, 75 transitions, 1054 flow [2024-11-22 21:31:02,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1054, PETRI_PLACES=98, PETRI_TRANSITIONS=75} [2024-11-22 21:31:02,519 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 49 predicate places. [2024-11-22 21:31:02,520 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 1054 flow [2024-11-22 21:31:02,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:02,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:02,520 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] [2024-11-22 21:31:02,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:31:02,520 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:02,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash -791735071, now seen corresponding path program 2 times [2024-11-22 21:31:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266061924] [2024-11-22 21:31:02,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:31:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:02,541 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:31:02,541 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:31:02,640 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-22 21:31:02,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266061924] [2024-11-22 21:31:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266061924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:31:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089516898] [2024-11-22 21:31:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:02,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:31:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:31:02,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:31:02,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:31:02,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 1054 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-22 21:31:02,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:02,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:31:02,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:03,550 INFO L124 PetriNetUnfolderBase]: 4677/7598 cut-off events. [2024-11-22 21:31:03,550 INFO L125 PetriNetUnfolderBase]: For 212287/213703 co-relation queries the response was YES. [2024-11-22 21:31:03,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50530 conditions, 7598 events. 4677/7598 cut-off events. For 212287/213703 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 49698 event pairs, 796 based on Foata normal form. 1079/8458 useless extension candidates. Maximal degree in co-relation 50494. Up to 4250 conditions per place. [2024-11-22 21:31:03,597 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 80 selfloop transitions, 5 changer transitions 9/113 dead transitions. [2024-11-22 21:31:03,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 113 transitions, 1975 flow [2024-11-22 21:31:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:31:03,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:31:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-22 21:31:03,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-22 21:31:03,598 INFO L175 Difference]: Start difference. First operand has 98 places, 75 transitions, 1054 flow. Second operand 4 states and 108 transitions. [2024-11-22 21:31:03,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 113 transitions, 1975 flow [2024-11-22 21:31:03,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 1864 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-11-22 21:31:03,655 INFO L231 Difference]: Finished difference. Result has 94 places, 69 transitions, 893 flow [2024-11-22 21:31:03,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=893, PETRI_PLACES=94, PETRI_TRANSITIONS=69} [2024-11-22 21:31:03,656 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 45 predicate places. [2024-11-22 21:31:03,656 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 69 transitions, 893 flow [2024-11-22 21:31:03,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-22 21:31:03,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:03,656 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-22 21:31:03,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:31:03,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:03,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash -140433251, now seen corresponding path program 1 times [2024-11-22 21:31:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:03,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110536717] [2024-11-22 21:31:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:03,764 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-22 21:31:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110536717] [2024-11-22 21:31:03,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110536717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:03,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:03,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:31:03,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066568162] [2024-11-22 21:31:03,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:03,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:31:03,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:31:03,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:31:03,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:31:03,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 69 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:03,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:03,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:31:03,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:04,356 INFO L124 PetriNetUnfolderBase]: 3300/5419 cut-off events. [2024-11-22 21:31:04,356 INFO L125 PetriNetUnfolderBase]: For 152332/153391 co-relation queries the response was YES. [2024-11-22 21:31:04,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35632 conditions, 5419 events. 3300/5419 cut-off events. For 152332/153391 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33484 event pairs, 436 based on Foata normal form. 885/6116 useless extension candidates. Maximal degree in co-relation 35598. Up to 1697 conditions per place. [2024-11-22 21:31:04,387 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 8 changer transitions 10/116 dead transitions. [2024-11-22 21:31:04,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 116 transitions, 1862 flow [2024-11-22 21:31:04,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:31:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:31:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-22 21:31:04,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-22 21:31:04,388 INFO L175 Difference]: Start difference. First operand has 94 places, 69 transitions, 893 flow. Second operand 5 states and 137 transitions. [2024-11-22 21:31:04,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 116 transitions, 1862 flow [2024-11-22 21:31:04,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 1789 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:04,427 INFO L231 Difference]: Finished difference. Result has 96 places, 68 transitions, 805 flow [2024-11-22 21:31:04,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=805, PETRI_PLACES=96, PETRI_TRANSITIONS=68} [2024-11-22 21:31:04,428 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-11-22 21:31:04,428 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 68 transitions, 805 flow [2024-11-22 21:31:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:04,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:04,428 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-22 21:31:04,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 21:31:04,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1228726522, now seen corresponding path program 1 times [2024-11-22 21:31:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:04,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132025376] [2024-11-22 21:31:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:04,573 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-22 21:31:04,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:04,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132025376] [2024-11-22 21:31:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132025376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144548002] [2024-11-22 21:31:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:04,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:04,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:31:04,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 68 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-22 21:31:04,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:04,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:31:04,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:05,138 INFO L124 PetriNetUnfolderBase]: 2372/3873 cut-off events. [2024-11-22 21:31:05,138 INFO L125 PetriNetUnfolderBase]: For 110188/111047 co-relation queries the response was YES. [2024-11-22 21:31:05,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26212 conditions, 3873 events. 2372/3873 cut-off events. For 110188/111047 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23330 event pairs, 340 based on Foata normal form. 598/4293 useless extension candidates. Maximal degree in co-relation 26177. Up to 1382 conditions per place. [2024-11-22 21:31:05,161 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 56 selfloop transitions, 11 changer transitions 26/106 dead transitions. [2024-11-22 21:31:05,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 106 transitions, 1522 flow [2024-11-22 21:31:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:31:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:31:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-11-22 21:31:05,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-22 21:31:05,163 INFO L175 Difference]: Start difference. First operand has 96 places, 68 transitions, 805 flow. Second operand 6 states and 150 transitions. [2024-11-22 21:31:05,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 106 transitions, 1522 flow [2024-11-22 21:31:05,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 1176 flow, removed 160 selfloop flow, removed 7 redundant places. [2024-11-22 21:31:05,239 INFO L231 Difference]: Finished difference. Result has 96 places, 51 transitions, 451 flow [2024-11-22 21:31:05,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=96, PETRI_TRANSITIONS=51} [2024-11-22 21:31:05,240 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-11-22 21:31:05,240 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 51 transitions, 451 flow [2024-11-22 21:31:05,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-22 21:31:05,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:05,241 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-22 21:31:05,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 21:31:05,241 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1331707633, now seen corresponding path program 1 times [2024-11-22 21:31:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493627558] [2024-11-22 21:31:05,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:06,109 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-22 21:31:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493627558] [2024-11-22 21:31:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493627558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:06,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:06,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:31:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80863722] [2024-11-22 21:31:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:31:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:06,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:31:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:31:06,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:31:06,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 51 transitions, 451 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-22 21:31:06,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:06,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:31:06,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:06,394 INFO L124 PetriNetUnfolderBase]: 568/1168 cut-off events. [2024-11-22 21:31:06,394 INFO L125 PetriNetUnfolderBase]: For 13482/13679 co-relation queries the response was YES. [2024-11-22 21:31:06,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5566 conditions, 1168 events. 568/1168 cut-off events. For 13482/13679 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6701 event pairs, 153 based on Foata normal form. 22/1086 useless extension candidates. Maximal degree in co-relation 5534. Up to 522 conditions per place. [2024-11-22 21:31:06,405 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 33 selfloop transitions, 13 changer transitions 11/79 dead transitions. [2024-11-22 21:31:06,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 79 transitions, 699 flow [2024-11-22 21:31:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:31:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:31:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-11-22 21:31:06,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5369318181818182 [2024-11-22 21:31:06,407 INFO L175 Difference]: Start difference. First operand has 96 places, 51 transitions, 451 flow. Second operand 8 states and 189 transitions. [2024-11-22 21:31:06,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 79 transitions, 699 flow [2024-11-22 21:31:06,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 474 flow, removed 68 selfloop flow, removed 29 redundant places. [2024-11-22 21:31:06,416 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 326 flow [2024-11-22 21:31:06,416 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2024-11-22 21:31:06,416 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-11-22 21:31:06,416 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 326 flow [2024-11-22 21:31:06,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-22 21:31:06,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:06,417 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-22 21:31:06,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 21:31:06,417 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:06,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1937860551, now seen corresponding path program 2 times [2024-11-22 21:31:06,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:06,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810020849] [2024-11-22 21:31:06,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:31:06,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:06,468 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:31:06,468 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:31:07,358 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-22 21:31:07,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:07,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810020849] [2024-11-22 21:31:07,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810020849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:07,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:07,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 21:31:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473755241] [2024-11-22 21:31:07,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:07,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:31:07,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:07,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:31:07,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:31:07,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:31:07,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 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-22 21:31:07,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:07,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:31:07,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:07,658 INFO L124 PetriNetUnfolderBase]: 668/1396 cut-off events. [2024-11-22 21:31:07,658 INFO L125 PetriNetUnfolderBase]: For 2718/2886 co-relation queries the response was YES. [2024-11-22 21:31:07,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 1396 events. 668/1396 cut-off events. For 2718/2886 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8643 event pairs, 219 based on Foata normal form. 25/1297 useless extension candidates. Maximal degree in co-relation 4321. Up to 538 conditions per place. [2024-11-22 21:31:07,664 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 5 changer transitions 19/76 dead transitions. [2024-11-22 21:31:07,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 508 flow [2024-11-22 21:31:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:31:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:31:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-22 21:31:07,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-11-22 21:31:07,665 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 326 flow. Second operand 7 states and 166 transitions. [2024-11-22 21:31:07,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 508 flow [2024-11-22 21:31:07,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 463 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-22 21:31:07,668 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 267 flow [2024-11-22 21:31:07,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2024-11-22 21:31:07,668 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-11-22 21:31:07,668 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 267 flow [2024-11-22 21:31:07,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 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-22 21:31:07,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:07,669 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-22 21:31:07,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 21:31:07,669 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:07,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 859623961, now seen corresponding path program 3 times [2024-11-22 21:31:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666493165] [2024-11-22 21:31:07,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:31:07,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:07,709 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:31:07,710 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:31:07,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:31:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:31:07,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:31:07,806 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:31:07,807 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-22 21:31:07,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-22 21:31:07,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-22 21:31:07,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-22 21:31:07,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-22 21:31:07,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-22 21:31:07,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-22 21:31:07,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 21:31:07,812 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:07,890 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:31:07,890 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:31:07,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:31:07 BasicIcfg [2024-11-22 21:31:07,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:31:07,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:31:07,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:31:07,895 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:31:07,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:48" (3/4) ... [2024-11-22 21:31:07,896 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:31:07,897 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:31:07,897 INFO L158 Benchmark]: Toolchain (without parser) took 20602.83ms. Allocated memory was 176.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 105.6MB in the beginning and 706.8MB in the end (delta: -601.2MB). Peak memory consumption was 609.8MB. Max. memory is 16.1GB. [2024-11-22 21:31:07,898 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory was 135.0MB in the beginning and 134.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:31:07,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.47ms. Allocated memory is still 176.2MB. Free memory was 105.5MB in the beginning and 133.0MB in the end (delta: -27.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-22 21:31:07,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.64ms. Allocated memory is still 176.2MB. Free memory was 133.0MB in the beginning and 130.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:31:07,898 INFO L158 Benchmark]: Boogie Preprocessor took 60.90ms. Allocated memory is still 176.2MB. Free memory was 130.5MB in the beginning and 126.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:31:07,898 INFO L158 Benchmark]: RCFGBuilder took 751.32ms. Allocated memory is still 176.2MB. Free memory was 126.7MB in the beginning and 72.2MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-22 21:31:07,899 INFO L158 Benchmark]: TraceAbstraction took 19180.97ms. Allocated memory was 176.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 71.8MB in the beginning and 706.8MB in the end (delta: -635.0MB). Peak memory consumption was 576.1MB. Max. memory is 16.1GB. [2024-11-22 21:31:07,899 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 1.4GB. Free memory is still 706.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:31:07,900 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.11ms. Allocated memory is still 176.2MB. Free memory was 135.0MB in the beginning and 134.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.47ms. Allocated memory is still 176.2MB. Free memory was 105.5MB in the beginning and 133.0MB in the end (delta: -27.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.64ms. Allocated memory is still 176.2MB. Free memory was 133.0MB in the beginning and 130.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.90ms. Allocated memory is still 176.2MB. Free memory was 130.5MB in the beginning and 126.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 751.32ms. Allocated memory is still 176.2MB. Free memory was 126.7MB in the beginning and 72.2MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19180.97ms. Allocated memory was 176.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 71.8MB in the beginning and 706.8MB in the end (delta: -635.0MB). Peak memory consumption was 576.1MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 1.4GB. Free memory is still 706.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, t2026=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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, 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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: 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: 821]: 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: 19.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1002 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 967 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2778 IncrementalHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 63 mSDtfsCounter, 2778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1449occurred in iteration=12, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 3115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-22 21:31:07,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:31:09,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:31:09,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:31:09,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:31:09,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:31:10,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:31:10,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:31:10,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:31:10,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:31:10,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:31:10,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:31:10,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:31:10,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:31:10,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:31:10,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:31:10,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:31:10,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:31:10,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:31:10,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:31:10,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:31:10,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:31:10,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:31:10,012 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:31:10,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:31:10,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:31:10,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:31:10,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:31:10,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:31:10,014 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:31:10,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:31:10,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:31:10,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:31:10,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:31:10,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:31:10,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:31:10,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:31:10,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:31:10,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:31:10,017 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:31:10,017 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:31:10,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:31:10,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:31:10,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:31:10,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:31:10,018 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-11-22 21:31:10,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:31:10,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:31:10,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:31:10,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:31:10,316 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:31:10,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-22 21:31:11,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:31:11,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:31:11,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-22 21:31:11,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9d87c11/3c832416d2d34997861982ccf80500e0/FLAG0b9fc1f1a [2024-11-22 21:31:12,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9d87c11/3c832416d2d34997861982ccf80500e0 [2024-11-22 21:31:12,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:31:12,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:31:12,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:31:12,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:31:12,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:31:12,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711fd474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12, skipping insertion in model container [2024-11-22 21:31:12,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:31:12,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:31:12,571 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:31:12,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:31:12,678 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:31:12,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12 WrapperNode [2024-11-22 21:31:12,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:31:12,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:31:12,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:31:12,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:31:12,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,757 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-22 21:31:12,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:31:12,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:31:12,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:31:12,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:31:12,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,799 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-22 21:31:12,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:31:12,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:31:12,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:31:12,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:31:12,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (1/1) ... [2024-11-22 21:31:12,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:31:12,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:31:12,856 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-22 21:31:12,859 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-22 21:31:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:31:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:31:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:31:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:31:12,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:31:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:31:12,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:31:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:31:12,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:31:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:31:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:31:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:31:12,906 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:31:13,035 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:31:13,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:31:13,241 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:31:13,241 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:31:13,409 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:31:13,410 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:31:13,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:13 BoogieIcfgContainer [2024-11-22 21:31:13,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:31:13,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:31:13,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:31:13,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:31:13,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:31:12" (1/3) ... [2024-11-22 21:31:13,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d63e330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:31:13, skipping insertion in model container [2024-11-22 21:31:13,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:12" (2/3) ... [2024-11-22 21:31:13,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d63e330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:31:13, skipping insertion in model container [2024-11-22 21:31:13,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:13" (3/3) ... [2024-11-22 21:31:13,416 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-22 21:31:13,428 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:31:13,429 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:31:13,429 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:31:13,476 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:31:13,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-22 21:31:13,517 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-22 21:31:13,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:13,519 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 77 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-22 21:31:13,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-22 21:31:13,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-22 21:31:13,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:31:13,532 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;@7302d8c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:31:13,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 21:31:13,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:31:13,535 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:31:13,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:13,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:13,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:31:13,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:13,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash 12000028, now seen corresponding path program 1 times [2024-11-22 21:31:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375376256] [2024-11-22 21:31:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:13,549 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-22 21:31:13,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:13,552 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-22 21:31:13,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 (2)] Waiting until timeout for monitored process [2024-11-22 21:31:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:13,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:31:13,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:13,641 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-22 21:31:13,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:13,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375376256] [2024-11-22 21:31:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375376256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:31:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157305399] [2024-11-22 21:31:13,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:13,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:31:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:31:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:31:13,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-22 21:31:13,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:13,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:13,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-22 21:31:13,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:13,977 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-22 21:31:13,977 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:31:13,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8197 event pairs, 104 based on Foata normal form. 72/1336 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-22 21:31:13,993 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-22 21:31:13,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-22 21:31:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:31:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:31:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-22 21:31:14,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-22 21:31:14,006 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-22 21:31:14,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-22 21:31:14,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:31:14,012 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-22 21:31:14,013 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-22 21:31:14,017 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-22 21:31:14,018 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-22 21:31:14,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:14,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:14,019 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:14,038 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 (2)] Ended with exit code 0 [2024-11-22 21:31:14,233 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-22 21:31:14,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:14,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 657277449, now seen corresponding path program 1 times [2024-11-22 21:31:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472944582] [2024-11-22 21:31:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:14,237 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-22 21:31:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:14,239 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-22 21:31:14,240 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-22 21:31:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:14,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:31:14,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:14,354 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-22 21:31:14,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:14,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:14,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472944582] [2024-11-22 21:31:14,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472944582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:14,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:14,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:31:14,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698226578] [2024-11-22 21:31:14,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:14,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:31:14,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:14,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:31:14,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:31:14,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:31:14,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:14,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:14,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:31:14,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:14,649 INFO L124 PetriNetUnfolderBase]: 1511/2579 cut-off events. [2024-11-22 21:31:14,649 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-11-22 21:31:14,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 2579 events. 1511/2579 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16039 event pairs, 149 based on Foata normal form. 80/2619 useless extension candidates. Maximal degree in co-relation 5045. Up to 1513 conditions per place. [2024-11-22 21:31:14,662 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-11-22 21:31:14,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 230 flow [2024-11-22 21:31:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:31:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:31:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-22 21:31:14,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-11-22 21:31:14,664 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 109 transitions. [2024-11-22 21:31:14,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 230 flow [2024-11-22 21:31:14,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:31:14,666 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-11-22 21:31:14,666 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-22 21:31:14,666 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-22 21:31:14,667 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-11-22 21:31:14,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:14,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:14,667 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-22 21:31:14,670 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 (3)] Ended with exit code 0 [2024-11-22 21:31:14,867 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-22 21:31:14,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:14,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1631804628, now seen corresponding path program 1 times [2024-11-22 21:31:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:14,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453271549] [2024-11-22 21:31:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:14,870 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-22 21:31:14,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:14,871 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-22 21:31:14,872 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-22 21:31:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:14,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:31:14,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:14,980 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-22 21:31:14,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:14,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453271549] [2024-11-22 21:31:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453271549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:31:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969899569] [2024-11-22 21:31:14,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:14,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:31:14,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:14,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:31:14,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:31:14,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:31:14,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:14,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:14,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:31:14,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:15,185 INFO L124 PetriNetUnfolderBase]: 947/1651 cut-off events. [2024-11-22 21:31:15,185 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-11-22 21:31:15,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 1651 events. 947/1651 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9054 event pairs, 75 based on Foata normal form. 68/1686 useless extension candidates. Maximal degree in co-relation 3683. Up to 729 conditions per place. [2024-11-22 21:31:15,213 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-11-22 21:31:15,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 319 flow [2024-11-22 21:31:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:31:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:31:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-22 21:31:15,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-22 21:31:15,214 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 137 transitions. [2024-11-22 21:31:15,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 319 flow [2024-11-22 21:31:15,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:31:15,217 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-11-22 21:31:15,217 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-22 21:31:15,217 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-22 21:31:15,217 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-11-22 21:31:15,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:15,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:15,218 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-22 21:31:15,223 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 (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:31:15,418 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-22 21:31:15,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1019807158, now seen corresponding path program 1 times [2024-11-22 21:31:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283168471] [2024-11-22 21:31:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:15,420 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-22 21:31:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:15,422 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-22 21:31:15,423 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-22 21:31:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:15,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:31:15,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:15,549 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-22 21:31:15,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:15,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:15,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283168471] [2024-11-22 21:31:15,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283168471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:15,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:15,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:15,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080653148] [2024-11-22 21:31:15,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:15,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:15,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:15,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:15,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:15,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:31:15,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-22 21:31:15,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:15,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:31:15,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:15,748 INFO L124 PetriNetUnfolderBase]: 503/867 cut-off events. [2024-11-22 21:31:15,748 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-11-22 21:31:15,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 867 events. 503/867 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3846 event pairs, 61 based on Foata normal form. 36/872 useless extension candidates. Maximal degree in co-relation 2211. Up to 268 conditions per place. [2024-11-22 21:31:15,752 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-22 21:31:15,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 330 flow [2024-11-22 21:31:15,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:31:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:31:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-22 21:31:15,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-11-22 21:31:15,753 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 149 transitions. [2024-11-22 21:31:15,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 330 flow [2024-11-22 21:31:15,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:15,757 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-11-22 21:31:15,757 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-22 21:31:15,758 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-22 21:31:15,758 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-11-22 21:31:15,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-22 21:31:15,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:15,758 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-22 21:31:15,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 21:31:15,958 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-22 21:31:15,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:15,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1249129250, now seen corresponding path program 1 times [2024-11-22 21:31:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480322017] [2024-11-22 21:31:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:15,960 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-22 21:31:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:15,963 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-22 21:31:15,964 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-22 21:31:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:16,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:31:16,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:16,071 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-22 21:31:16,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:16,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480322017] [2024-11-22 21:31:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480322017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:31:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164352317] [2024-11-22 21:31:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:16,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:31:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:31:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:31:16,076 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-22 21:31:16,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-22 21:31:16,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:16,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-22 21:31:16,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:16,187 INFO L124 PetriNetUnfolderBase]: 261/547 cut-off events. [2024-11-22 21:31:16,187 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2024-11-22 21:31:16,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 547 events. 261/547 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2599 event pairs, 251 based on Foata normal form. 8/502 useless extension candidates. Maximal degree in co-relation 1167. Up to 426 conditions per place. [2024-11-22 21:31:16,190 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-22 21:31:16,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 204 flow [2024-11-22 21:31:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:31:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:31:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-22 21:31:16,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-22 21:31:16,192 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 75 transitions. [2024-11-22 21:31:16,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 204 flow [2024-11-22 21:31:16,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-22 21:31:16,193 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-11-22 21:31:16,193 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-22 21:31:16,194 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-22 21:31:16,196 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-11-22 21:31:16,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-22 21:31:16,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:16,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:16,205 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 (6)] Forceful destruction successful, exit code 0 [2024-11-22 21:31:16,396 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-22 21:31:16,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:16,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash 387532929, now seen corresponding path program 1 times [2024-11-22 21:31:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239303233] [2024-11-22 21:31:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:16,398 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-22 21:31:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:16,399 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-22 21:31:16,401 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-22 21:31:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:16,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 21:31:16,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:16,860 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-22 21:31:16,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:16,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:16,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239303233] [2024-11-22 21:31:16,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239303233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:16,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:16,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 21:31:16,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300615503] [2024-11-22 21:31:16,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:16,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 21:31:16,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:16,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 21:31:16,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 21:31:16,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-22 21:31:16,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 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-22 21:31:16,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:16,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-22 21:31:16,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:17,107 INFO L124 PetriNetUnfolderBase]: 453/877 cut-off events. [2024-11-22 21:31:17,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:17,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 877 events. 453/877 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4476 event pairs, 166 based on Foata normal form. 8/830 useless extension candidates. Maximal degree in co-relation 1716. Up to 373 conditions per place. [2024-11-22 21:31:17,111 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 31 selfloop transitions, 6 changer transitions 10/67 dead transitions. [2024-11-22 21:31:17,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 260 flow [2024-11-22 21:31:17,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:31:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:31:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-11-22 21:31:17,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-11-22 21:31:17,112 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 7 states and 174 transitions. [2024-11-22 21:31:17,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 260 flow [2024-11-22 21:31:17,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:31:17,114 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 143 flow [2024-11-22 21:31:17,114 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-22 21:31:17,114 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-22 21:31:17,115 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 143 flow [2024-11-22 21:31:17,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 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-22 21:31:17,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:17,115 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-22 21:31:17,119 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-22 21:31:17,315 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-22 21:31:17,316 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:17,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2067315325, now seen corresponding path program 2 times [2024-11-22 21:31:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:17,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927141338] [2024-11-22 21:31:17,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:31:17,318 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-22 21:31:17,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:17,320 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-22 21:31:17,321 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-22 21:31:17,395 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:31:17,396 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:31:17,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:31:17,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:17,517 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-22 21:31:17,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:17,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927141338] [2024-11-22 21:31:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927141338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:17,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799193881] [2024-11-22 21:31:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:17,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:17,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:17,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:17,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:31:17,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 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-22 21:31:17,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:17,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:31:17,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:17,737 INFO L124 PetriNetUnfolderBase]: 936/1756 cut-off events. [2024-11-22 21:31:17,738 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2024-11-22 21:31:17,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 1756 events. 936/1756 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10257 event pairs, 187 based on Foata normal form. 8/1693 useless extension candidates. Maximal degree in co-relation 4004. Up to 662 conditions per place. [2024-11-22 21:31:17,744 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 32 selfloop transitions, 3 changer transitions 18/73 dead transitions. [2024-11-22 21:31:17,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 339 flow [2024-11-22 21:31:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:31:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:31:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-22 21:31:17,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2024-11-22 21:31:17,745 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 143 flow. Second operand 6 states and 151 transitions. [2024-11-22 21:31:17,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 339 flow [2024-11-22 21:31:17,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 323 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:17,747 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 149 flow [2024-11-22 21:31:17,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-11-22 21:31:17,748 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-22 21:31:17,748 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 149 flow [2024-11-22 21:31:17,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 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-22 21:31:17,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:17,748 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-22 21:31:17,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 21:31:17,952 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-22 21:31:17,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:17,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1581723799, now seen corresponding path program 3 times [2024-11-22 21:31:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338567459] [2024-11-22 21:31:17,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:31:17,953 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-22 21:31:17,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:17,956 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-22 21:31:17,957 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-22 21:31:18,019 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:31:18,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:31:18,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 21:31:18,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:18,393 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-22 21:31:18,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:18,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338567459] [2024-11-22 21:31:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338567459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:18,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:18,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 21:31:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741158399] [2024-11-22 21:31:18,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:18,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 21:31:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:18,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 21:31:18,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 21:31:18,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-22 21:31:18,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 149 flow. Second operand has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 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-22 21:31:18,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:18,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-22 21:31:18,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:18,657 INFO L124 PetriNetUnfolderBase]: 532/1043 cut-off events. [2024-11-22 21:31:18,658 INFO L125 PetriNetUnfolderBase]: For 233/241 co-relation queries the response was YES. [2024-11-22 21:31:18,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2337 conditions, 1043 events. 532/1043 cut-off events. For 233/241 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5500 event pairs, 203 based on Foata normal form. 10/991 useless extension candidates. Maximal degree in co-relation 2323. Up to 354 conditions per place. [2024-11-22 21:31:18,662 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 6 changer transitions 11/68 dead transitions. [2024-11-22 21:31:18,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 309 flow [2024-11-22 21:31:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:31:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:31:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-11-22 21:31:18,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-11-22 21:31:18,663 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 149 flow. Second operand 7 states and 174 transitions. [2024-11-22 21:31:18,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 309 flow [2024-11-22 21:31:18,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 293 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-22 21:31:18,665 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 162 flow [2024-11-22 21:31:18,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2024-11-22 21:31:18,666 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2024-11-22 21:31:18,666 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 162 flow [2024-11-22 21:31:18,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 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-22 21:31:18,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:18,666 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-22 21:31:18,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 21:31:18,867 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-22 21:31:18,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1340377927, now seen corresponding path program 4 times [2024-11-22 21:31:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247987364] [2024-11-22 21:31:18,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:31:18,869 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-22 21:31:18,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:18,876 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-22 21:31:18,879 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-22 21:31:18,936 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:31:18,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:31:18,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:31:18,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:31:19,014 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-22 21:31:19,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:31:19,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:31:19,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247987364] [2024-11-22 21:31:19,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247987364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:19,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:19,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773055715] [2024-11-22 21:31:19,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:19,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:31:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:31:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:31:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:31:19,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:31:19,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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-22 21:31:19,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:19,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:31:19,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:19,219 INFO L124 PetriNetUnfolderBase]: 970/1860 cut-off events. [2024-11-22 21:31:19,219 INFO L125 PetriNetUnfolderBase]: For 552/572 co-relation queries the response was YES. [2024-11-22 21:31:19,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4227 conditions, 1860 events. 970/1860 cut-off events. For 552/572 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11394 event pairs, 521 based on Foata normal form. 11/1721 useless extension candidates. Maximal degree in co-relation 4213. Up to 810 conditions per place. [2024-11-22 21:31:19,226 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 24 selfloop transitions, 2 changer transitions 22/67 dead transitions. [2024-11-22 21:31:19,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 322 flow [2024-11-22 21:31:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:31:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:31:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-11-22 21:31:19,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5863636363636363 [2024-11-22 21:31:19,227 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 162 flow. Second operand 5 states and 129 transitions. [2024-11-22 21:31:19,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 322 flow [2024-11-22 21:31:19,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 310 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:19,230 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 138 flow [2024-11-22 21:31:19,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-11-22 21:31:19,230 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-11-22 21:31:19,231 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 138 flow [2024-11-22 21:31:19,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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-22 21:31:19,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:19,231 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-22 21:31:19,242 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-22 21:31:19,434 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-22 21:31:19,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -988236785, now seen corresponding path program 5 times [2024-11-22 21:31:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:31:19,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985931988] [2024-11-22 21:31:19,435 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:31:19,435 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-22 21:31:19,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:31:19,438 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-22 21:31:19,439 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-22 21:31:19,538 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:31:19,538 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:31:19,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:31:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:31:19,618 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:31:19,618 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:31:19,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-22 21:31:19,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-22 21:31:19,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-22 21:31:19,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-22 21:31:19,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-22 21:31:19,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-22 21:31:19,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-22 21:31:19,625 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-22 21:31:19,821 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-22 21:31:19,821 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-22 21:31:19,873 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:31:19,873 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:31:19,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:31:19 BasicIcfg [2024-11-22 21:31:19,881 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:31:19,881 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:31:19,881 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:31:19,881 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:31:19,882 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:13" (3/4) ... [2024-11-22 21:31:19,883 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:31:19,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:31:19,892 INFO L158 Benchmark]: Toolchain (without parser) took 7684.04ms. Allocated memory was 100.7MB in the beginning and 262.1MB in the end (delta: 161.5MB). Free memory was 76.6MB in the beginning and 119.9MB in the end (delta: -43.2MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2024-11-22 21:31:19,892 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 100.7MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:31:19,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.84ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 78.6MB in the end (delta: -2.3MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-22 21:31:19,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.73ms. Allocated memory is still 100.7MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:31:19,893 INFO L158 Benchmark]: Boogie Preprocessor took 60.79ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 72.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:31:19,893 INFO L158 Benchmark]: RCFGBuilder took 585.85ms. Allocated memory was 100.7MB in the beginning and 148.9MB in the end (delta: 48.2MB). Free memory was 72.4MB in the beginning and 79.9MB in the end (delta: -7.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2024-11-22 21:31:19,893 INFO L158 Benchmark]: TraceAbstraction took 6469.21ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 79.1MB in the beginning and 120.9MB in the end (delta: -41.8MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2024-11-22 21:31:19,893 INFO L158 Benchmark]: Witness Printer took 9.84ms. Allocated memory is still 262.1MB. Free memory was 120.9MB in the beginning and 119.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:31:19,895 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.79ms. Allocated memory is still 100.7MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.84ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 78.6MB in the end (delta: -2.3MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.73ms. Allocated memory is still 100.7MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.79ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 72.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 585.85ms. Allocated memory was 100.7MB in the beginning and 148.9MB in the end (delta: 48.2MB). Free memory was 72.4MB in the beginning and 79.9MB in the end (delta: -7.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6469.21ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 79.1MB in the beginning and 120.9MB in the end (delta: -41.8MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * Witness Printer took 9.84ms. Allocated memory is still 262.1MB. Free memory was 120.9MB in the beginning and 119.9MB 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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=0, t2026=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025=0, t2026=1, t2027=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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, 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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=0, t2026=1, t2027=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=0, t2026=1, t2027=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=0, t2026=1, t2027=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 819]: 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: 6.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1099 IncrementalHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 4 mSDtfsCounter, 1099 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 1217 SizeOfPredicates, 14 NumberOfNonLiveVariables, 984 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:31:19,923 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