./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:02:55,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:02:55,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:02:55,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:02:55,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:02:55,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:02:55,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:02:55,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:02:55,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:02:55,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:02:55,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:02:55,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:02:55,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:02:55,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:02:55,239 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:02:55,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:02:55,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:02:55,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:02:55,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:02:55,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:02:55,241 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:02:55,243 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:02:55,244 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:02:55,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:02:55,244 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:02:55,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:02:55,245 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:02:55,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:02:55,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:02:55,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:02:55,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:02:55,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:02:55,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:02:55,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:02:55,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:02:55,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:02:55,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:02:55,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:02:55,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:02:55,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:02:55,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:02:55,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:02:55,250 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-10 18:02:55,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:02:55,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:02:55,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:02:55,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:02:55,559 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:02:55,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 18:02:57,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:02:57,283 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:02:57,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 18:02:57,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a0a45b6/57a22544d7414d6abfa4780971e5e153/FLAG0ebf573ab [2024-11-10 18:02:57,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a0a45b6/57a22544d7414d6abfa4780971e5e153 [2024-11-10 18:02:57,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:02:57,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:02:57,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:02:57,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:02:57,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:02:57,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:57,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce849ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57, skipping insertion in model container [2024-11-10 18:02:57,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:57,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:02:57,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:02:57,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:02:57,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:02:57,904 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:02:57,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57 WrapperNode [2024-11-10 18:02:57,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:02:57,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:02:57,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:02:57,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:02:57,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:57,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:57,967 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-10 18:02:57,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:02:57,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:02:57,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:02:57,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:02:57,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:57,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:57,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:58,003 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-10 18:02:58,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:58,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:58,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:58,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:58,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:58,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:58,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:02:58,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:02:58,031 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:02:58,031 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:02:58,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (1/1) ... [2024-11-10 18:02:58,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:02:58,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:02:58,068 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-10 18:02:58,071 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-10 18:02:58,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:02:58,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:02:58,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 18:02:58,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 18:02:58,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 18:02:58,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 18:02:58,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 18:02:58,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 18:02:58,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:02:58,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:02:58,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:02:58,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:02:58,124 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:02:58,257 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:02:58,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:02:58,679 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:02:58,680 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:02:58,975 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:02:58,976 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:02:58,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:02:58 BoogieIcfgContainer [2024-11-10 18:02:58,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:02:58,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:02:58,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:02:58,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:02:58,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:02:57" (1/3) ... [2024-11-10 18:02:58,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a3387f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:02:58, skipping insertion in model container [2024-11-10 18:02:58,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:57" (2/3) ... [2024-11-10 18:02:58,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a3387f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:02:58, skipping insertion in model container [2024-11-10 18:02:58,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:02:58" (3/3) ... [2024-11-10 18:02:58,987 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 18:02:59,004 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:02:59,006 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 18:02:59,006 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:02:59,071 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:02:59,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-10 18:02:59,133 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-10 18:02:59,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:02:59,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-10 18:02:59,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-10 18:02:59,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-10 18:02:59,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:02:59,160 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f9b9618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:02:59,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 18:02:59,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:02:59,168 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-10 18:02:59,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:02:59,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:59,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:02:59,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:02:59,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:59,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1111843393, now seen corresponding path program 1 times [2024-11-10 18:02:59,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:02:59,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505672376] [2024-11-10 18:02:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:02:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:59,669 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-10 18:02:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:02:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505672376] [2024-11-10 18:02:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505672376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:02:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280508988] [2024-11-10 18:02:59,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:59,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:02:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:02:59,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:02:59,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:02:59,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 18:02:59,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-10 18:02:59,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:59,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 18:02:59,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:01,393 INFO L124 PetriNetUnfolderBase]: 7377/10637 cut-off events. [2024-11-10 18:03:01,393 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-10 18:03:01,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21186 conditions, 10637 events. 7377/10637 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 58867 event pairs, 972 based on Foata normal form. 588/11210 useless extension candidates. Maximal degree in co-relation 21175. Up to 8856 conditions per place. [2024-11-10 18:03:01,468 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-11-10 18:03:01,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 235 flow [2024-11-10 18:03:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:03:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:03:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-10 18:03:01,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2024-11-10 18:03:01,482 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 88 transitions. [2024-11-10 18:03:01,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 235 flow [2024-11-10 18:03:01,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:03:01,490 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-10 18:03:01,493 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-10 18:03:01,498 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-10 18:03:01,499 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-10 18:03:01,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-10 18:03:01,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:01,500 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:03:01,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:03:01,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:01,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1895795460, now seen corresponding path program 1 times [2024-11-10 18:03:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:01,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123427709] [2024-11-10 18:03:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:01,586 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-10 18:03:01,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123427709] [2024-11-10 18:03:01,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123427709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:01,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:01,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:03:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720707090] [2024-11-10 18:03:01,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:01,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:03:01,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:03:01,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:03:01,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:01,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:01,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:01,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:01,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:03,063 INFO L124 PetriNetUnfolderBase]: 6628/10231 cut-off events. [2024-11-10 18:03:03,063 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-11-10 18:03:03,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20177 conditions, 10231 events. 6628/10231 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 62277 event pairs, 6628 based on Foata normal form. 294/10461 useless extension candidates. Maximal degree in co-relation 20167. Up to 9387 conditions per place. [2024-11-10 18:03:03,118 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-10 18:03:03,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2024-11-10 18:03:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:03:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:03:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-10 18:03:03,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2024-11-10 18:03:03,123 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2024-11-10 18:03:03,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2024-11-10 18:03:03,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:03:03,129 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-11-10 18:03:03,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-10 18:03:03,131 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-10 18:03:03,131 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-11-10 18:03:03,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:03,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:03,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:03:03,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:03:03,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:03,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1895796018, now seen corresponding path program 1 times [2024-11-10 18:03:03,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:03,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270691548] [2024-11-10 18:03:03,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:03,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:03,698 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-10 18:03:03,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:03,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270691548] [2024-11-10 18:03:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270691548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:03,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:03,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:03:03,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266441238] [2024-11-10 18:03:03,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:03,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:03:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:03,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:03:03,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:03:03,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:03,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-10 18:03:03,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:03,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:03,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:05,560 INFO L124 PetriNetUnfolderBase]: 8171/11991 cut-off events. [2024-11-10 18:03:05,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:03:05,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23753 conditions, 11991 events. 8171/11991 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 69505 event pairs, 1814 based on Foata normal form. 0/11780 useless extension candidates. Maximal degree in co-relation 23747. Up to 4975 conditions per place. [2024-11-10 18:03:05,606 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 55 selfloop transitions, 8 changer transitions 110/178 dead transitions. [2024-11-10 18:03:05,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 178 transitions, 712 flow [2024-11-10 18:03:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:03:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 18:03:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 284 transitions. [2024-11-10 18:03:05,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5144927536231884 [2024-11-10 18:03:05,614 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 12 states and 284 transitions. [2024-11-10 18:03:05,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 178 transitions, 712 flow [2024-11-10 18:03:05,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 178 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:03:05,620 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 179 flow [2024-11-10 18:03:05,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=179, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2024-11-10 18:03:05,622 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2024-11-10 18:03:05,622 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 179 flow [2024-11-10 18:03:05,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-10 18:03:05,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:05,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:03:05,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:03:05,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash -345841122, now seen corresponding path program 1 times [2024-11-10 18:03:05,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:05,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229521955] [2024-11-10 18:03:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:03:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229521955] [2024-11-10 18:03:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229521955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:06,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:06,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:03:06,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41908923] [2024-11-10 18:03:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:06,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:03:06,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:06,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:03:06,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:03:06,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:06,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:06,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:06,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:06,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:08,054 INFO L124 PetriNetUnfolderBase]: 6323/9409 cut-off events. [2024-11-10 18:03:08,055 INFO L125 PetriNetUnfolderBase]: For 17478/17478 co-relation queries the response was YES. [2024-11-10 18:03:08,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29674 conditions, 9409 events. 6323/9409 cut-off events. For 17478/17478 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 52741 event pairs, 1414 based on Foata normal form. 195/9601 useless extension candidates. Maximal degree in co-relation 29656. Up to 6901 conditions per place. [2024-11-10 18:03:08,105 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 55 selfloop transitions, 17 changer transitions 64/141 dead transitions. [2024-11-10 18:03:08,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 897 flow [2024-11-10 18:03:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:03:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:03:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-11-10 18:03:08,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48478260869565215 [2024-11-10 18:03:08,107 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 179 flow. Second operand 10 states and 223 transitions. [2024-11-10 18:03:08,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 897 flow [2024-11-10 18:03:08,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 141 transitions, 819 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-11-10 18:03:08,186 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 295 flow [2024-11-10 18:03:08,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2024-11-10 18:03:08,188 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2024-11-10 18:03:08,188 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 295 flow [2024-11-10 18:03:08,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:08,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:08,190 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-10 18:03:08,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:03:08,190 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:08,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash -255368559, now seen corresponding path program 1 times [2024-11-10 18:03:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516023870] [2024-11-10 18:03:08,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:09,402 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-10 18:03:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516023870] [2024-11-10 18:03:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516023870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:09,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:09,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:03:09,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390465070] [2024-11-10 18:03:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:09,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:03:09,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:03:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:03:09,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:09,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 295 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:09,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:09,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:09,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:10,710 INFO L124 PetriNetUnfolderBase]: 6095/9087 cut-off events. [2024-11-10 18:03:10,711 INFO L125 PetriNetUnfolderBase]: For 19164/19164 co-relation queries the response was YES. [2024-11-10 18:03:10,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30876 conditions, 9087 events. 6095/9087 cut-off events. For 19164/19164 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 48565 event pairs, 780 based on Foata normal form. 166/9240 useless extension candidates. Maximal degree in co-relation 30853. Up to 6775 conditions per place. [2024-11-10 18:03:10,765 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 69 selfloop transitions, 6 changer transitions 51/131 dead transitions. [2024-11-10 18:03:10,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 131 transitions, 918 flow [2024-11-10 18:03:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:03:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:03:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-11-10 18:03:10,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48641304347826086 [2024-11-10 18:03:10,767 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 295 flow. Second operand 8 states and 179 transitions. [2024-11-10 18:03:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 131 transitions, 918 flow [2024-11-10 18:03:10,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 131 transitions, 886 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-10 18:03:10,865 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 330 flow [2024-11-10 18:03:10,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2024-11-10 18:03:10,867 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2024-11-10 18:03:10,868 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 330 flow [2024-11-10 18:03:10,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:10,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:10,869 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-10 18:03:10,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:03:10,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:10,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1283940737, now seen corresponding path program 1 times [2024-11-10 18:03:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:10,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67472422] [2024-11-10 18:03:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:11,157 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-10 18:03:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67472422] [2024-11-10 18:03:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67472422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:03:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669694592] [2024-11-10 18:03:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:11,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:03:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:11,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:03:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:03:11,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:11,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-10 18:03:11,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:11,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:11,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:12,378 INFO L124 PetriNetUnfolderBase]: 8583/12636 cut-off events. [2024-11-10 18:03:12,378 INFO L125 PetriNetUnfolderBase]: For 25707/25716 co-relation queries the response was YES. [2024-11-10 18:03:12,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43252 conditions, 12636 events. 8583/12636 cut-off events. For 25707/25716 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 70642 event pairs, 3558 based on Foata normal form. 208/12833 useless extension candidates. Maximal degree in co-relation 43229. Up to 5900 conditions per place. [2024-11-10 18:03:12,568 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 61 selfloop transitions, 6 changer transitions 51/123 dead transitions. [2024-11-10 18:03:12,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 123 transitions, 887 flow [2024-11-10 18:03:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:03:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:03:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-11-10 18:03:12,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5124223602484472 [2024-11-10 18:03:12,571 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 330 flow. Second operand 7 states and 165 transitions. [2024-11-10 18:03:12,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 123 transitions, 887 flow [2024-11-10 18:03:12,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 860 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-10 18:03:12,706 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 329 flow [2024-11-10 18:03:12,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-11-10 18:03:12,708 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2024-11-10 18:03:12,709 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 329 flow [2024-11-10 18:03:12,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-10 18:03:12,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:12,710 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-10 18:03:12,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:03:12,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:12,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1225593935, now seen corresponding path program 1 times [2024-11-10 18:03:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:12,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360651552] [2024-11-10 18:03:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:13,866 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-10 18:03:13,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360651552] [2024-11-10 18:03:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360651552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:13,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:13,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:03:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028242494] [2024-11-10 18:03:13,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:03:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:13,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:03:13,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:03:13,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:13,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:13,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:13,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:13,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:15,372 INFO L124 PetriNetUnfolderBase]: 7778/11814 cut-off events. [2024-11-10 18:03:15,372 INFO L125 PetriNetUnfolderBase]: For 28289/28289 co-relation queries the response was YES. [2024-11-10 18:03:15,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40474 conditions, 11814 events. 7778/11814 cut-off events. For 28289/28289 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 67958 event pairs, 1301 based on Foata normal form. 246/12056 useless extension candidates. Maximal degree in co-relation 40450. Up to 8582 conditions per place. [2024-11-10 18:03:15,443 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 101 selfloop transitions, 20 changer transitions 57/183 dead transitions. [2024-11-10 18:03:15,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 183 transitions, 1479 flow [2024-11-10 18:03:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:03:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 18:03:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 240 transitions. [2024-11-10 18:03:15,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4743083003952569 [2024-11-10 18:03:15,445 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 329 flow. Second operand 11 states and 240 transitions. [2024-11-10 18:03:15,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 183 transitions, 1479 flow [2024-11-10 18:03:15,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 183 transitions, 1446 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-10 18:03:15,530 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 591 flow [2024-11-10 18:03:15,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=591, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-11-10 18:03:15,531 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2024-11-10 18:03:15,532 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 591 flow [2024-11-10 18:03:15,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:15,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:15,532 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-10 18:03:15,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:03:15,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:15,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1067042449, now seen corresponding path program 2 times [2024-11-10 18:03:15,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:15,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827633110] [2024-11-10 18:03:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:15,762 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-10 18:03:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827633110] [2024-11-10 18:03:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827633110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:15,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:03:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220921451] [2024-11-10 18:03:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:03:15,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:15,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:03:15,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:03:15,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 18:03:15,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 591 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:15,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:15,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 18:03:15,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:16,633 INFO L124 PetriNetUnfolderBase]: 5838/9052 cut-off events. [2024-11-10 18:03:16,633 INFO L125 PetriNetUnfolderBase]: For 34904/34913 co-relation queries the response was YES. [2024-11-10 18:03:16,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34490 conditions, 9052 events. 5838/9052 cut-off events. For 34904/34913 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 52766 event pairs, 877 based on Foata normal form. 441/9484 useless extension candidates. Maximal degree in co-relation 34460. Up to 4507 conditions per place. [2024-11-10 18:03:16,688 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 118 selfloop transitions, 5 changer transitions 11/139 dead transitions. [2024-11-10 18:03:16,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 139 transitions, 1457 flow [2024-11-10 18:03:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:03:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:03:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-10 18:03:16,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2024-11-10 18:03:16,691 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 591 flow. Second operand 4 states and 109 transitions. [2024-11-10 18:03:16,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 139 transitions, 1457 flow [2024-11-10 18:03:16,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 1437 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-11-10 18:03:16,736 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 598 flow [2024-11-10 18:03:16,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=598, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2024-11-10 18:03:16,737 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2024-11-10 18:03:16,737 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 598 flow [2024-11-10 18:03:16,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:16,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:16,738 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-10 18:03:16,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:03:16,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:16,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1481677808, now seen corresponding path program 1 times [2024-11-10 18:03:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765034281] [2024-11-10 18:03:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:16,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:17,995 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-10 18:03:17,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:17,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765034281] [2024-11-10 18:03:17,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765034281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:17,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:03:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464646516] [2024-11-10 18:03:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:03:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:03:17,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:03:18,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:18,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 598 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:18,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:18,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:18,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:19,614 INFO L124 PetriNetUnfolderBase]: 6605/10192 cut-off events. [2024-11-10 18:03:19,614 INFO L125 PetriNetUnfolderBase]: For 36530/36533 co-relation queries the response was YES. [2024-11-10 18:03:19,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41650 conditions, 10192 events. 6605/10192 cut-off events. For 36530/36533 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 58654 event pairs, 1592 based on Foata normal form. 160/10344 useless extension candidates. Maximal degree in co-relation 41618. Up to 6620 conditions per place. [2024-11-10 18:03:19,657 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 100 selfloop transitions, 35 changer transitions 74/214 dead transitions. [2024-11-10 18:03:19,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 214 transitions, 2019 flow [2024-11-10 18:03:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:03:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:03:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions. [2024-11-10 18:03:19,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-11-10 18:03:19,659 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 598 flow. Second operand 10 states and 240 transitions. [2024-11-10 18:03:19,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 214 transitions, 2019 flow [2024-11-10 18:03:19,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 214 transitions, 1987 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-10 18:03:19,699 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 914 flow [2024-11-10 18:03:19,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=914, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-11-10 18:03:19,700 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 43 predicate places. [2024-11-10 18:03:19,701 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 914 flow [2024-11-10 18:03:19,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:19,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:19,702 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-10 18:03:19,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:03:19,702 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:19,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1160732618, now seen corresponding path program 2 times [2024-11-10 18:03:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:19,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347591779] [2024-11-10 18:03:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:19,951 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-10 18:03:19,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:19,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347591779] [2024-11-10 18:03:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347591779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:03:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449590153] [2024-11-10 18:03:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:19,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:03:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:19,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:03:19,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:03:19,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 18:03:19,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 914 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:19,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:19,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 18:03:19,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:20,803 INFO L124 PetriNetUnfolderBase]: 4155/6490 cut-off events. [2024-11-10 18:03:20,804 INFO L125 PetriNetUnfolderBase]: For 44443/44452 co-relation queries the response was YES. [2024-11-10 18:03:20,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28954 conditions, 6490 events. 4155/6490 cut-off events. For 44443/44452 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 35744 event pairs, 585 based on Foata normal form. 370/6851 useless extension candidates. Maximal degree in co-relation 28914. Up to 2417 conditions per place. [2024-11-10 18:03:20,852 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 133 selfloop transitions, 8 changer transitions 23/169 dead transitions. [2024-11-10 18:03:20,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 169 transitions, 2107 flow [2024-11-10 18:03:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:03:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:03:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-10 18:03:20,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6043478260869565 [2024-11-10 18:03:20,854 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 914 flow. Second operand 5 states and 139 transitions. [2024-11-10 18:03:20,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 169 transitions, 2107 flow [2024-11-10 18:03:20,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 169 transitions, 1989 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-11-10 18:03:20,928 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 825 flow [2024-11-10 18:03:20,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=825, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2024-11-10 18:03:20,930 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2024-11-10 18:03:20,930 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 825 flow [2024-11-10 18:03:20,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:20,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:20,931 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] [2024-11-10 18:03:20,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:03:20,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:20,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2046693618, now seen corresponding path program 1 times [2024-11-10 18:03:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342246486] [2024-11-10 18:03:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:21,226 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-10 18:03:21,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:21,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342246486] [2024-11-10 18:03:21,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342246486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:21,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:03:21,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830939037] [2024-11-10 18:03:21,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:21,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:03:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:21,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:03:21,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:03:21,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 18:03:21,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 825 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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-10 18:03:21,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:21,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 18:03:21,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:21,896 INFO L124 PetriNetUnfolderBase]: 2728/4229 cut-off events. [2024-11-10 18:03:21,897 INFO L125 PetriNetUnfolderBase]: For 27746/27755 co-relation queries the response was YES. [2024-11-10 18:03:21,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19477 conditions, 4229 events. 2728/4229 cut-off events. For 27746/27755 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 21840 event pairs, 458 based on Foata normal form. 124/4344 useless extension candidates. Maximal degree in co-relation 19438. Up to 1668 conditions per place. [2024-11-10 18:03:21,913 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 95 selfloop transitions, 11 changer transitions 40/151 dead transitions. [2024-11-10 18:03:21,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 151 transitions, 1751 flow [2024-11-10 18:03:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:03:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:03:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-11-10 18:03:21,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5036231884057971 [2024-11-10 18:03:21,914 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 825 flow. Second operand 6 states and 139 transitions. [2024-11-10 18:03:21,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 151 transitions, 1751 flow [2024-11-10 18:03:21,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 151 transitions, 1590 flow, removed 55 selfloop flow, removed 9 redundant places. [2024-11-10 18:03:21,971 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 612 flow [2024-11-10 18:03:21,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=612, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2024-11-10 18:03:21,972 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2024-11-10 18:03:21,972 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 612 flow [2024-11-10 18:03:21,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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-10 18:03:21,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:21,972 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, 1, 1] [2024-11-10 18:03:21,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:03:21,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:21,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:21,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2087312072, now seen corresponding path program 1 times [2024-11-10 18:03:21,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:21,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175382578] [2024-11-10 18:03:21,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:21,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:22,810 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-10 18:03:22,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:22,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175382578] [2024-11-10 18:03:22,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175382578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:22,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:22,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:03:22,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309783125] [2024-11-10 18:03:22,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:22,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:03:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:22,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:03:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:03:22,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:22,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 612 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:22,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:22,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:22,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:23,645 INFO L124 PetriNetUnfolderBase]: 2227/3456 cut-off events. [2024-11-10 18:03:23,645 INFO L125 PetriNetUnfolderBase]: For 17592/17595 co-relation queries the response was YES. [2024-11-10 18:03:23,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14865 conditions, 3456 events. 2227/3456 cut-off events. For 17592/17595 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16785 event pairs, 202 based on Foata normal form. 8/3462 useless extension candidates. Maximal degree in co-relation 14830. Up to 1189 conditions per place. [2024-11-10 18:03:23,662 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 88 selfloop transitions, 33 changer transitions 58/184 dead transitions. [2024-11-10 18:03:23,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 184 transitions, 1754 flow [2024-11-10 18:03:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:03:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 18:03:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2024-11-10 18:03:23,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4367588932806324 [2024-11-10 18:03:23,664 INFO L175 Difference]: Start difference. First operand has 89 places, 72 transitions, 612 flow. Second operand 11 states and 221 transitions. [2024-11-10 18:03:23,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 184 transitions, 1754 flow [2024-11-10 18:03:23,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 184 transitions, 1332 flow, removed 117 selfloop flow, removed 17 redundant places. [2024-11-10 18:03:23,694 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 706 flow [2024-11-10 18:03:23,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=706, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-11-10 18:03:23,695 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2024-11-10 18:03:23,695 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 706 flow [2024-11-10 18:03:23,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:23,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:23,695 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, 1, 1] [2024-11-10 18:03:23,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:03:23,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:23,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1248189216, now seen corresponding path program 2 times [2024-11-10 18:03:23,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:23,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861330954] [2024-11-10 18:03:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:26,550 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-10 18:03:26,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861330954] [2024-11-10 18:03:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861330954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:26,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:03:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751975048] [2024-11-10 18:03:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:26,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:03:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:03:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:03:26,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:26,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 706 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:26,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:26,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:26,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:27,329 INFO L124 PetriNetUnfolderBase]: 1668/2623 cut-off events. [2024-11-10 18:03:27,329 INFO L125 PetriNetUnfolderBase]: For 7158/7161 co-relation queries the response was YES. [2024-11-10 18:03:27,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9464 conditions, 2623 events. 1668/2623 cut-off events. For 7158/7161 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 12102 event pairs, 402 based on Foata normal form. 8/2629 useless extension candidates. Maximal degree in co-relation 9434. Up to 1084 conditions per place. [2024-11-10 18:03:27,348 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 80 selfloop transitions, 16 changer transitions 47/148 dead transitions. [2024-11-10 18:03:27,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 148 transitions, 1272 flow [2024-11-10 18:03:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:03:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:03:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-11-10 18:03:27,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3934782608695652 [2024-11-10 18:03:27,350 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 706 flow. Second operand 10 states and 181 transitions. [2024-11-10 18:03:27,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 148 transitions, 1272 flow [2024-11-10 18:03:27,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 148 transitions, 1197 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-11-10 18:03:27,363 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 664 flow [2024-11-10 18:03:27,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=664, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-11-10 18:03:27,364 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2024-11-10 18:03:27,364 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 664 flow [2024-11-10 18:03:27,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:27,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:27,365 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, 1, 1] [2024-11-10 18:03:27,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:03:27,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:27,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1339608422, now seen corresponding path program 3 times [2024-11-10 18:03:27,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:27,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799035882] [2024-11-10 18:03:27,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:29,245 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-10 18:03:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799035882] [2024-11-10 18:03:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799035882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:03:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400622159] [2024-11-10 18:03:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:29,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:03:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:29,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:03:29,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:03:29,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:29,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 664 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:29,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:29,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:29,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:30,224 INFO L124 PetriNetUnfolderBase]: 1568/2441 cut-off events. [2024-11-10 18:03:30,224 INFO L125 PetriNetUnfolderBase]: For 6586/6589 co-relation queries the response was YES. [2024-11-10 18:03:30,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8865 conditions, 2441 events. 1568/2441 cut-off events. For 6586/6589 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11116 event pairs, 273 based on Foata normal form. 10/2449 useless extension candidates. Maximal degree in co-relation 8836. Up to 1159 conditions per place. [2024-11-10 18:03:30,241 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 103 selfloop transitions, 42 changer transitions 25/175 dead transitions. [2024-11-10 18:03:30,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 175 transitions, 1507 flow [2024-11-10 18:03:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 18:03:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 18:03:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 248 transitions. [2024-11-10 18:03:30,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38509316770186336 [2024-11-10 18:03:30,244 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 664 flow. Second operand 14 states and 248 transitions. [2024-11-10 18:03:30,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 175 transitions, 1507 flow [2024-11-10 18:03:30,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 175 transitions, 1434 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-11-10 18:03:30,255 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 939 flow [2024-11-10 18:03:30,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=939, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2024-11-10 18:03:30,256 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2024-11-10 18:03:30,256 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 939 flow [2024-11-10 18:03:30,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:30,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:30,256 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, 1, 1] [2024-11-10 18:03:30,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 18:03:30,257 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:30,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -616482526, now seen corresponding path program 4 times [2024-11-10 18:03:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045744504] [2024-11-10 18:03:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:31,655 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-10 18:03:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045744504] [2024-11-10 18:03:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045744504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:31,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:31,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:03:31,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416385482] [2024-11-10 18:03:31,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:31,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:03:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:03:31,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:03:31,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:31,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 939 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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-10 18:03:31,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:31,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:31,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:32,384 INFO L124 PetriNetUnfolderBase]: 1944/3017 cut-off events. [2024-11-10 18:03:32,384 INFO L125 PetriNetUnfolderBase]: For 11665/11668 co-relation queries the response was YES. [2024-11-10 18:03:32,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11942 conditions, 3017 events. 1944/3017 cut-off events. For 11665/11668 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14337 event pairs, 400 based on Foata normal form. 8/3023 useless extension candidates. Maximal degree in co-relation 11912. Up to 1255 conditions per place. [2024-11-10 18:03:32,406 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 87 selfloop transitions, 35 changer transitions 44/171 dead transitions. [2024-11-10 18:03:32,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 171 transitions, 1717 flow [2024-11-10 18:03:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:03:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 18:03:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-11-10 18:03:32,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39723320158102765 [2024-11-10 18:03:32,407 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 939 flow. Second operand 11 states and 201 transitions. [2024-11-10 18:03:32,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 171 transitions, 1717 flow [2024-11-10 18:03:32,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 171 transitions, 1591 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-11-10 18:03:32,432 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 976 flow [2024-11-10 18:03:32,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=976, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2024-11-10 18:03:32,433 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2024-11-10 18:03:32,433 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 976 flow [2024-11-10 18:03:32,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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-10 18:03:32,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:32,434 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, 1, 1] [2024-11-10 18:03:32,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:03:32,434 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash -295546882, now seen corresponding path program 5 times [2024-11-10 18:03:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253365877] [2024-11-10 18:03:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:33,170 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-10 18:03:33,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253365877] [2024-11-10 18:03:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253365877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:33,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:33,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:03:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27694394] [2024-11-10 18:03:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:33,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:03:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:03:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:03:33,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:33,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 976 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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-10 18:03:33,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:33,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:33,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:34,122 INFO L124 PetriNetUnfolderBase]: 2506/3860 cut-off events. [2024-11-10 18:03:34,122 INFO L125 PetriNetUnfolderBase]: For 16549/16549 co-relation queries the response was YES. [2024-11-10 18:03:34,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15457 conditions, 3860 events. 2506/3860 cut-off events. For 16549/16549 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19059 event pairs, 910 based on Foata normal form. 8/3867 useless extension candidates. Maximal degree in co-relation 15425. Up to 1827 conditions per place. [2024-11-10 18:03:34,153 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 101 selfloop transitions, 26 changer transitions 39/171 dead transitions. [2024-11-10 18:03:34,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 171 transitions, 1763 flow [2024-11-10 18:03:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:03:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:03:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-10 18:03:34,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4320652173913043 [2024-11-10 18:03:34,156 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 976 flow. Second operand 8 states and 159 transitions. [2024-11-10 18:03:34,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 171 transitions, 1763 flow [2024-11-10 18:03:34,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 171 transitions, 1686 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-10 18:03:34,185 INFO L231 Difference]: Finished difference. Result has 95 places, 96 transitions, 1011 flow [2024-11-10 18:03:34,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1011, PETRI_PLACES=95, PETRI_TRANSITIONS=96} [2024-11-10 18:03:34,186 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2024-11-10 18:03:34,186 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 96 transitions, 1011 flow [2024-11-10 18:03:34,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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-10 18:03:34,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:34,188 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, 1, 1] [2024-11-10 18:03:34,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 18:03:34,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:34,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1698258586, now seen corresponding path program 6 times [2024-11-10 18:03:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:34,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654287227] [2024-11-10 18:03:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:34,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:34,712 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-10 18:03:34,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:34,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654287227] [2024-11-10 18:03:34,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654287227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:34,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:34,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:03:34,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994270398] [2024-11-10 18:03:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:34,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:03:34,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:34,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:03:34,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:03:34,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:34,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 1011 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:34,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:34,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:34,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:35,310 INFO L124 PetriNetUnfolderBase]: 2310/3577 cut-off events. [2024-11-10 18:03:35,310 INFO L125 PetriNetUnfolderBase]: For 14045/14048 co-relation queries the response was YES. [2024-11-10 18:03:35,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14056 conditions, 3577 events. 2310/3577 cut-off events. For 14045/14048 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17574 event pairs, 530 based on Foata normal form. 8/3583 useless extension candidates. Maximal degree in co-relation 14024. Up to 1807 conditions per place. [2024-11-10 18:03:35,331 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 82 selfloop transitions, 30 changer transitions 22/139 dead transitions. [2024-11-10 18:03:35,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 139 transitions, 1481 flow [2024-11-10 18:03:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:03:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:03:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-11-10 18:03:35,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2024-11-10 18:03:35,332 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 1011 flow. Second operand 8 states and 148 transitions. [2024-11-10 18:03:35,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 139 transitions, 1481 flow [2024-11-10 18:03:35,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 139 transitions, 1438 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-11-10 18:03:35,350 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 1039 flow [2024-11-10 18:03:35,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1039, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-11-10 18:03:35,351 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2024-11-10 18:03:35,351 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 1039 flow [2024-11-10 18:03:35,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:35,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:35,352 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, 1, 1] [2024-11-10 18:03:35,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 18:03:35,352 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:35,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:35,352 INFO L85 PathProgramCache]: Analyzing trace with hash -436801472, now seen corresponding path program 7 times [2024-11-10 18:03:35,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:35,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158144636] [2024-11-10 18:03:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:35,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:36,979 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-10 18:03:36,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:36,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158144636] [2024-11-10 18:03:36,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158144636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:36,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:36,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:03:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107980492] [2024-11-10 18:03:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:36,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:03:36,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:03:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:03:36,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:36,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 1039 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:36,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:36,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:36,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:37,802 INFO L124 PetriNetUnfolderBase]: 2491/3867 cut-off events. [2024-11-10 18:03:37,802 INFO L125 PetriNetUnfolderBase]: For 15756/15756 co-relation queries the response was YES. [2024-11-10 18:03:37,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15382 conditions, 3867 events. 2491/3867 cut-off events. For 15756/15756 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19229 event pairs, 376 based on Foata normal form. 8/3874 useless extension candidates. Maximal degree in co-relation 15349. Up to 2051 conditions per place. [2024-11-10 18:03:37,827 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 98 selfloop transitions, 39 changer transitions 38/180 dead transitions. [2024-11-10 18:03:37,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 180 transitions, 1800 flow [2024-11-10 18:03:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:03:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 18:03:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 217 transitions. [2024-11-10 18:03:37,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39311594202898553 [2024-11-10 18:03:37,829 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 1039 flow. Second operand 12 states and 217 transitions. [2024-11-10 18:03:37,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 180 transitions, 1800 flow [2024-11-10 18:03:37,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 180 transitions, 1687 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-11-10 18:03:37,850 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 1120 flow [2024-11-10 18:03:37,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1120, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-10 18:03:37,851 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2024-11-10 18:03:37,852 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 1120 flow [2024-11-10 18:03:37,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:37,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:37,852 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, 1, 1] [2024-11-10 18:03:37,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 18:03:37,853 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:37,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash -390634378, now seen corresponding path program 8 times [2024-11-10 18:03:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:37,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75551277] [2024-11-10 18:03:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:37,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:40,365 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-10 18:03:40,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:40,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75551277] [2024-11-10 18:03:40,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75551277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:40,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:40,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 18:03:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927873058] [2024-11-10 18:03:40,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:40,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:03:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:40,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:03:40,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:03:40,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:40,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 1120 flow. Second operand has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 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-10 18:03:40,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:40,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:40,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:41,290 INFO L124 PetriNetUnfolderBase]: 2372/3674 cut-off events. [2024-11-10 18:03:41,291 INFO L125 PetriNetUnfolderBase]: For 18462/18462 co-relation queries the response was YES. [2024-11-10 18:03:41,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15629 conditions, 3674 events. 2372/3674 cut-off events. For 18462/18462 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 18148 event pairs, 344 based on Foata normal form. 8/3681 useless extension candidates. Maximal degree in co-relation 15595. Up to 2133 conditions per place. [2024-11-10 18:03:41,323 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 80 selfloop transitions, 57 changer transitions 29/171 dead transitions. [2024-11-10 18:03:41,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 171 transitions, 1874 flow [2024-11-10 18:03:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:03:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 18:03:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2024-11-10 18:03:41,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3713768115942029 [2024-11-10 18:03:41,325 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 1120 flow. Second operand 12 states and 205 transitions. [2024-11-10 18:03:41,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 171 transitions, 1874 flow [2024-11-10 18:03:41,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 171 transitions, 1811 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-11-10 18:03:41,355 INFO L231 Difference]: Finished difference. Result has 111 places, 102 transitions, 1313 flow [2024-11-10 18:03:41,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1313, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2024-11-10 18:03:41,355 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2024-11-10 18:03:41,355 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 1313 flow [2024-11-10 18:03:41,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 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-10 18:03:41,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:41,356 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, 1, 1] [2024-11-10 18:03:41,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 18:03:41,356 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:41,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1905582634, now seen corresponding path program 9 times [2024-11-10 18:03:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:41,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032212539] [2024-11-10 18:03:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:42,757 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-10 18:03:42,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:42,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032212539] [2024-11-10 18:03:42,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032212539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:42,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:42,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:03:42,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344249325] [2024-11-10 18:03:42,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:03:42,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:42,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:03:42,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:03:42,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:42,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 1313 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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-10 18:03:42,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:42,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:42,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:43,604 INFO L124 PetriNetUnfolderBase]: 2518/3918 cut-off events. [2024-11-10 18:03:43,605 INFO L125 PetriNetUnfolderBase]: For 24124/24124 co-relation queries the response was YES. [2024-11-10 18:03:43,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17007 conditions, 3918 events. 2518/3918 cut-off events. For 24124/24124 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19693 event pairs, 534 based on Foata normal form. 8/3925 useless extension candidates. Maximal degree in co-relation 16971. Up to 2921 conditions per place. [2024-11-10 18:03:43,629 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 95 selfloop transitions, 32 changer transitions 41/173 dead transitions. [2024-11-10 18:03:43,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 173 transitions, 1999 flow [2024-11-10 18:03:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:03:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 18:03:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 226 transitions. [2024-11-10 18:03:43,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3779264214046823 [2024-11-10 18:03:43,631 INFO L175 Difference]: Start difference. First operand has 111 places, 102 transitions, 1313 flow. Second operand 13 states and 226 transitions. [2024-11-10 18:03:43,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 173 transitions, 1999 flow [2024-11-10 18:03:43,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 173 transitions, 1829 flow, removed 41 selfloop flow, removed 12 redundant places. [2024-11-10 18:03:43,666 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 1228 flow [2024-11-10 18:03:43,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1228, PETRI_PLACES=111, PETRI_TRANSITIONS=99} [2024-11-10 18:03:43,667 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2024-11-10 18:03:43,667 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 1228 flow [2024-11-10 18:03:43,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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-10 18:03:43,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:03:43,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 18:03:43,667 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:43,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash -66692218, now seen corresponding path program 10 times [2024-11-10 18:03:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112295315] [2024-11-10 18:03:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:44,728 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-10 18:03:44,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:44,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112295315] [2024-11-10 18:03:44,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112295315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:44,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:44,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:03:44,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891065820] [2024-11-10 18:03:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:44,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:03:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:44,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:03:44,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:03:44,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:44,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 99 transitions, 1228 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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-10 18:03:44,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:44,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:44,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:45,473 INFO L124 PetriNetUnfolderBase]: 2511/3902 cut-off events. [2024-11-10 18:03:45,473 INFO L125 PetriNetUnfolderBase]: For 19828/19828 co-relation queries the response was YES. [2024-11-10 18:03:45,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16318 conditions, 3902 events. 2511/3902 cut-off events. For 19828/19828 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19628 event pairs, 371 based on Foata normal form. 8/3908 useless extension candidates. Maximal degree in co-relation 16282. Up to 2127 conditions per place. [2024-11-10 18:03:45,497 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 83 selfloop transitions, 19 changer transitions 41/148 dead transitions. [2024-11-10 18:03:45,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 148 transitions, 1710 flow [2024-11-10 18:03:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:03:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:03:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-11-10 18:03:45,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2024-11-10 18:03:45,499 INFO L175 Difference]: Start difference. First operand has 111 places, 99 transitions, 1228 flow. Second operand 8 states and 148 transitions. [2024-11-10 18:03:45,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 148 transitions, 1710 flow [2024-11-10 18:03:45,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 148 transitions, 1617 flow, removed 23 selfloop flow, removed 11 redundant places. [2024-11-10 18:03:45,529 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 1045 flow [2024-11-10 18:03:45,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1045, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2024-11-10 18:03:45,530 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 56 predicate places. [2024-11-10 18:03:45,530 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 1045 flow [2024-11-10 18:03:45,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 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-10 18:03:45,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:45,530 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, 1, 1] [2024-11-10 18:03:45,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 18:03:45,531 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash -5554294, now seen corresponding path program 11 times [2024-11-10 18:03:45,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:45,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34027639] [2024-11-10 18:03:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:45,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:46,129 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-10 18:03:46,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:46,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34027639] [2024-11-10 18:03:46,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34027639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:46,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:46,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:03:46,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786983431] [2024-11-10 18:03:46,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:46,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:03:46,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:46,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:03:46,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:03:46,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:46,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 1045 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:46,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:46,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:46,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:46,688 INFO L124 PetriNetUnfolderBase]: 2213/3468 cut-off events. [2024-11-10 18:03:46,689 INFO L125 PetriNetUnfolderBase]: For 16206/16206 co-relation queries the response was YES. [2024-11-10 18:03:46,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13996 conditions, 3468 events. 2213/3468 cut-off events. For 16206/16206 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17171 event pairs, 423 based on Foata normal form. 8/3474 useless extension candidates. Maximal degree in co-relation 13962. Up to 1676 conditions per place. [2024-11-10 18:03:46,709 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 77 selfloop transitions, 18 changer transitions 45/145 dead transitions. [2024-11-10 18:03:46,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 145 transitions, 1566 flow [2024-11-10 18:03:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:03:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:03:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-11-10 18:03:46,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2024-11-10 18:03:46,711 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 1045 flow. Second operand 9 states and 166 transitions. [2024-11-10 18:03:46,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 145 transitions, 1566 flow [2024-11-10 18:03:46,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 145 transitions, 1459 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-11-10 18:03:46,730 INFO L231 Difference]: Finished difference. Result has 105 places, 65 transitions, 608 flow [2024-11-10 18:03:46,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=608, PETRI_PLACES=105, PETRI_TRANSITIONS=65} [2024-11-10 18:03:46,731 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2024-11-10 18:03:46,731 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 65 transitions, 608 flow [2024-11-10 18:03:46,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:46,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:46,731 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, 1, 1] [2024-11-10 18:03:46,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 18:03:46,732 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:46,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:46,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1855623298, now seen corresponding path program 12 times [2024-11-10 18:03:46,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:46,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640881763] [2024-11-10 18:03:46,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:46,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:48,256 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-10 18:03:48,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:48,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640881763] [2024-11-10 18:03:48,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640881763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:48,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:48,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:03:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773143259] [2024-11-10 18:03:48,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:48,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:03:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:48,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:03:48,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:03:48,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:48,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 65 transitions, 608 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:48,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:48,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:48,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:49,168 INFO L124 PetriNetUnfolderBase]: 1529/2429 cut-off events. [2024-11-10 18:03:49,169 INFO L125 PetriNetUnfolderBase]: For 8730/8730 co-relation queries the response was YES. [2024-11-10 18:03:49,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8961 conditions, 2429 events. 1529/2429 cut-off events. For 8730/8730 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11240 event pairs, 286 based on Foata normal form. 8/2436 useless extension candidates. Maximal degree in co-relation 8939. Up to 1289 conditions per place. [2024-11-10 18:03:49,182 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 66 selfloop transitions, 10 changer transitions 77/158 dead transitions. [2024-11-10 18:03:49,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 158 transitions, 1304 flow [2024-11-10 18:03:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 18:03:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-10 18:03:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 253 transitions. [2024-11-10 18:03:49,183 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-11-10 18:03:49,183 INFO L175 Difference]: Start difference. First operand has 105 places, 65 transitions, 608 flow. Second operand 15 states and 253 transitions. [2024-11-10 18:03:49,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 158 transitions, 1304 flow [2024-11-10 18:03:49,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 158 transitions, 1182 flow, removed 27 selfloop flow, removed 15 redundant places. [2024-11-10 18:03:49,194 INFO L231 Difference]: Finished difference. Result has 101 places, 56 transitions, 418 flow [2024-11-10 18:03:49,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=82, 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=15, PETRI_FLOW=418, PETRI_PLACES=101, PETRI_TRANSITIONS=56} [2024-11-10 18:03:49,195 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 50 predicate places. [2024-11-10 18:03:49,195 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 56 transitions, 418 flow [2024-11-10 18:03:49,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:49,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:49,195 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, 1, 1] [2024-11-10 18:03:49,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 18:03:49,195 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:49,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash -471181142, now seen corresponding path program 13 times [2024-11-10 18:03:49,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:49,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299622390] [2024-11-10 18:03:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:49,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:50,373 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-10 18:03:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299622390] [2024-11-10 18:03:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299622390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:03:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580897753] [2024-11-10 18:03:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:50,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:03:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:50,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:03:50,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:03:50,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:50,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 56 transitions, 418 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:50,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:50,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:50,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:50,969 INFO L124 PetriNetUnfolderBase]: 1123/1799 cut-off events. [2024-11-10 18:03:50,970 INFO L125 PetriNetUnfolderBase]: For 4138/4138 co-relation queries the response was YES. [2024-11-10 18:03:50,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6200 conditions, 1799 events. 1123/1799 cut-off events. For 4138/4138 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7706 event pairs, 140 based on Foata normal form. 8/1806 useless extension candidates. Maximal degree in co-relation 6179. Up to 1210 conditions per place. [2024-11-10 18:03:50,978 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 52 selfloop transitions, 6 changer transitions 36/99 dead transitions. [2024-11-10 18:03:50,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 749 flow [2024-11-10 18:03:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:03:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:03:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-11-10 18:03:50,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3521739130434783 [2024-11-10 18:03:50,980 INFO L175 Difference]: Start difference. First operand has 101 places, 56 transitions, 418 flow. Second operand 10 states and 162 transitions. [2024-11-10 18:03:50,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 749 flow [2024-11-10 18:03:50,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 636 flow, removed 32 selfloop flow, removed 18 redundant places. [2024-11-10 18:03:50,991 INFO L231 Difference]: Finished difference. Result has 87 places, 49 transitions, 268 flow [2024-11-10 18:03:50,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=268, PETRI_PLACES=87, PETRI_TRANSITIONS=49} [2024-11-10 18:03:50,992 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2024-11-10 18:03:50,992 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 49 transitions, 268 flow [2024-11-10 18:03:50,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:50,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:50,992 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, 1, 1] [2024-11-10 18:03:50,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 18:03:50,993 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:50,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash -578108068, now seen corresponding path program 14 times [2024-11-10 18:03:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:50,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970611782] [2024-11-10 18:03:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:52,101 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-10 18:03:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:52,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970611782] [2024-11-10 18:03:52,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970611782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:52,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:52,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:03:52,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620949224] [2024-11-10 18:03:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:52,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:03:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:03:52,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:03:52,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:52,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 49 transitions, 268 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:52,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:52,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:52,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:52,772 INFO L124 PetriNetUnfolderBase]: 1090/1740 cut-off events. [2024-11-10 18:03:52,773 INFO L125 PetriNetUnfolderBase]: For 2018/2018 co-relation queries the response was YES. [2024-11-10 18:03:52,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5122 conditions, 1740 events. 1090/1740 cut-off events. For 2018/2018 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7444 event pairs, 156 based on Foata normal form. 8/1747 useless extension candidates. Maximal degree in co-relation 5108. Up to 1115 conditions per place. [2024-11-10 18:03:52,784 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 53 selfloop transitions, 7 changer transitions 29/94 dead transitions. [2024-11-10 18:03:52,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 94 transitions, 586 flow [2024-11-10 18:03:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:03:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:03:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-11-10 18:03:52,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35434782608695653 [2024-11-10 18:03:52,786 INFO L175 Difference]: Start difference. First operand has 87 places, 49 transitions, 268 flow. Second operand 10 states and 163 transitions. [2024-11-10 18:03:52,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 94 transitions, 586 flow [2024-11-10 18:03:52,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 94 transitions, 519 flow, removed 15 selfloop flow, removed 17 redundant places. [2024-11-10 18:03:52,792 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 216 flow [2024-11-10 18:03:52,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2024-11-10 18:03:52,794 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2024-11-10 18:03:52,794 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 216 flow [2024-11-10 18:03:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:52,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:52,794 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, 1, 1] [2024-11-10 18:03:52,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 18:03:52,795 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:52,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1357914252, now seen corresponding path program 15 times [2024-11-10 18:03:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870554705] [2024-11-10 18:03:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:53,975 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-10 18:03:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:03:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870554705] [2024-11-10 18:03:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870554705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:53,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:53,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:03:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404186057] [2024-11-10 18:03:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:53,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:03:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:03:53,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:03:53,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:03:53,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 18:03:53,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 47 transitions, 216 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:53,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:53,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 18:03:53,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:54,579 INFO L124 PetriNetUnfolderBase]: 1130/1844 cut-off events. [2024-11-10 18:03:54,580 INFO L125 PetriNetUnfolderBase]: For 1054/1054 co-relation queries the response was YES. [2024-11-10 18:03:54,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 1844 events. 1130/1844 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8164 event pairs, 246 based on Foata normal form. 8/1851 useless extension candidates. Maximal degree in co-relation 4972. Up to 713 conditions per place. [2024-11-10 18:03:54,592 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 84 selfloop transitions, 9 changer transitions 28/126 dead transitions. [2024-11-10 18:03:54,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 720 flow [2024-11-10 18:03:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:03:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 18:03:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2024-11-10 18:03:54,593 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-11-10 18:03:54,593 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 216 flow. Second operand 12 states and 207 transitions. [2024-11-10 18:03:54,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 720 flow [2024-11-10 18:03:54,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 126 transitions, 664 flow, removed 11 selfloop flow, removed 12 redundant places. [2024-11-10 18:03:54,597 INFO L231 Difference]: Finished difference. Result has 77 places, 49 transitions, 223 flow [2024-11-10 18:03:54,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=223, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2024-11-10 18:03:54,599 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2024-11-10 18:03:54,599 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 223 flow [2024-11-10 18:03:54,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-10 18:03:54,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:54,599 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, 1, 1] [2024-11-10 18:03:54,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 18:03:54,600 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:03:54,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1506129858, now seen corresponding path program 16 times [2024-11-10 18:03:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:03:54,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102601010] [2024-11-10 18:03:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:03:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:03:54,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:03:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:03:54,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:03:54,815 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:03:54,817 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 18:03:54,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 18:03:54,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 18:03:54,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 18:03:54,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 18:03:54,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 18:03:54,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 18:03:54,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 18:03:54,822 INFO L407 BasicCegarLoop]: Path program histogram: [16, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:03:54,926 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:03:54,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:03:54,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:03:54 BasicIcfg [2024-11-10 18:03:54,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:03:54,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:03:54,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:03:54,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:03:54,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:02:58" (3/4) ... [2024-11-10 18:03:54,937 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:03:54,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:03:54,939 INFO L158 Benchmark]: Toolchain (without parser) took 57615.51ms. Allocated memory was 184.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 126.3MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 288.9MB. Max. memory is 16.1GB. [2024-11-10 18:03:54,939 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 184.5MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:03:54,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.17ms. Allocated memory is still 184.5MB. Free memory was 126.3MB in the beginning and 97.0MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 18:03:54,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.55ms. Allocated memory is still 184.5MB. Free memory was 97.0MB in the beginning and 94.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:03:54,940 INFO L158 Benchmark]: Boogie Preprocessor took 58.59ms. Allocated memory is still 184.5MB. Free memory was 93.8MB in the beginning and 89.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:03:54,940 INFO L158 Benchmark]: IcfgBuilder took 946.44ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 89.1MB in the beginning and 166.7MB in the end (delta: -77.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-11-10 18:03:54,941 INFO L158 Benchmark]: TraceAbstraction took 55953.94ms. Allocated memory was 264.2MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 165.6MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 245.4MB. Max. memory is 16.1GB. [2024-11-10 18:03:54,941 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 3.1GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:03:54,942 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.22ms. Allocated memory is still 184.5MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.17ms. Allocated memory is still 184.5MB. Free memory was 126.3MB in the beginning and 97.0MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.55ms. Allocated memory is still 184.5MB. Free memory was 97.0MB in the beginning and 94.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.59ms. Allocated memory is still 184.5MB. Free memory was 93.8MB in the beginning and 89.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 946.44ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 89.1MB in the beginning and 166.7MB in the end (delta: -77.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * TraceAbstraction took 55953.94ms. Allocated memory was 264.2MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 165.6MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 245.4MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 3.1GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-1, t2538=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-1, t2538=0, t2539=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-1, t2538=0, t2539=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-1, t2538=0, t2539=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-1, t2538=0, t2539=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 __assert_fail ("0", "safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 852]: 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: 850]: 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, 72 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: 55.7s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2194 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2189 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7723 IncrementalHoareTripleChecker+Invalid, 8058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 335 mSolverCounterUnsat, 9 mSDtfsCounter, 7723 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1313occurred in iteration=19, InterpolantAutomatonStates: 242, 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, 1.3s SatisfiabilityAnalysisTime, 25.2s InterpolantComputationTime, 736 NumberOfCodeBlocks, 736 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 678 ConstructedInterpolants, 0 QuantifiedInterpolants, 7563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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-10 18:03:54,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:03:57,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:03:57,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:03:57,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:03:57,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:03:57,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:03:57,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:03:57,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:03:57,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:03:57,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:03:57,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:03:57,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:03:57,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:03:57,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:03:57,855 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:03:57,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:03:57,856 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:03:57,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:03:57,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:03:57,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:03:57,857 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:03:57,858 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:03:57,858 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:03:57,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:03:57,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:03:57,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:03:57,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:03:57,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:03:57,860 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:03:57,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:03:57,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:03:57,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:03:57,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:03:57,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:03:57,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:03:57,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:03:57,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:03:57,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:03:57,863 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:03:57,863 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:03:57,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:03:57,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:03:57,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:03:57,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:03:57,867 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-10 18:03:58,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:03:58,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:03:58,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:03:58,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:03:58,283 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:03:58,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 18:04:00,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:04:00,356 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:04:00,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 18:04:00,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326258f94/c0643e954ee34559bf72206ad008aee4/FLAGfce46d181 [2024-11-10 18:04:00,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326258f94/c0643e954ee34559bf72206ad008aee4 [2024-11-10 18:04:00,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:04:00,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:04:00,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:04:00,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:04:00,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:04:00,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:04:00" (1/1) ... [2024-11-10 18:04:00,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a08fd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:00, skipping insertion in model container [2024-11-10 18:04:00,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:04:00" (1/1) ... [2024-11-10 18:04:00,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:04:00,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:04:00,990 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:04:01,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:04:01,127 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:04:01,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01 WrapperNode [2024-11-10 18:04:01,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:04:01,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:04:01,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:04:01,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:04:01,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,209 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-10 18:04:01,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:04:01,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:04:01,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:04:01,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:04:01,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,261 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-10 18:04:01,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:04:01,305 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:04:01,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:04:01,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:04:01,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:01" (1/1) ... [2024-11-10 18:04:01,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:04:01,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:04:01,348 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-10 18:04:01,354 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-10 18:04:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:04:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:04:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:04:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 18:04:01,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 18:04:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 18:04:01,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 18:04:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 18:04:01,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 18:04:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:04:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:04:01,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:04:01,415 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.