./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:53:48,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:53:48,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:53:48,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:53:48,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:53:48,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:53:48,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:53:48,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:53:48,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:53:48,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:53:48,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:53:48,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:53:48,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:53:48,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:53:48,115 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:53:48,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:53:48,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:53:48,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:53:48,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:53:48,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:53:48,122 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:53:48,122 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:53:48,123 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:53:48,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:53:48,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:53:48,124 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:53:48,124 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:53:48,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:53:48,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:53:48,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:53:48,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:53:48,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:53:48,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:53:48,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:53:48,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:53:48,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:53:48,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:53:48,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:53:48,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:53:48,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:53:48,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:53:48,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:53:48,128 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-clean/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-clean/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 -> 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 [2024-10-11 19:53:48,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:53:48,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:53:48,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:53:48,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:53:48,396 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:53:48,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2024-10-11 19:53:49,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:53:50,057 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:53:50,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2024-10-11 19:53:50,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6cc296ce5/9614bff4dc894fc48518d84340a3a2e3/FLAGd3f8e729e [2024-10-11 19:53:50,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6cc296ce5/9614bff4dc894fc48518d84340a3a2e3 [2024-10-11 19:53:50,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:53:50,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:53:50,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:53:50,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:53:50,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:53:50,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c67bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50, skipping insertion in model container [2024-10-11 19:53:50,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:53:50,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:53:50,331 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:53:50,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:53:50,380 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:53:50,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50 WrapperNode [2024-10-11 19:53:50,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:53:50,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:53:50,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:53:50,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:53:50,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,433 INFO L138 Inliner]: procedures = 21, calls = 96, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 254 [2024-10-11 19:53:50,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:53:50,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:53:50,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:53:50,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:53:50,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,481 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-10-11 19:53:50,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:53:50,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:53:50,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:53:50,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:53:50,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (1/1) ... [2024-10-11 19:53:50,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:53:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:53:50,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:53:50,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:53:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:53:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 19:53:50,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 19:53:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 19:53:50,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 19:53:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 19:53:50,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 19:53:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:53:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:53:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:53:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:53:50,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:53:50,610 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:53:50,730 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:53:50,733 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:53:51,054 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:53:51,054 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:53:51,351 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:53:51,351 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:53:51,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:53:51 BoogieIcfgContainer [2024-10-11 19:53:51,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:53:51,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:53:51,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:53:51,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:53:51,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:53:50" (1/3) ... [2024-10-11 19:53:51,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b912d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:53:51, skipping insertion in model container [2024-10-11 19:53:51,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:53:50" (2/3) ... [2024-10-11 19:53:51,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b912d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:53:51, skipping insertion in model container [2024-10-11 19:53:51,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:53:51" (3/3) ... [2024-10-11 19:53:51,363 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2024-10-11 19:53:51,379 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:53:51,380 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 19:53:51,380 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:53:51,440 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 19:53:51,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 60 transitions, 141 flow [2024-10-11 19:53:51,545 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2024-10-11 19:53:51,549 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 19:53:51,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 0/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-10-11 19:53:51,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 60 transitions, 141 flow [2024-10-11 19:53:51,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 130 flow [2024-10-11 19:53:51,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:53:51,571 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;@746592d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:53:51,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 19:53:51,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:53:51,590 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2024-10-11 19:53:51,591 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 19:53:51,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:53:51,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:53:51,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:53:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:53:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1618045045, now seen corresponding path program 1 times [2024-10-11 19:53:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:53:51,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587569735] [2024-10-11 19:53:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:53:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:53:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:53:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:53:52,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:53:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587569735] [2024-10-11 19:53:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587569735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:53:52,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:53:52,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:53:52,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493159590] [2024-10-11 19:53:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:53:52,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:53:52,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:53:52,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:53:52,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:53:52,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2024-10-11 19:53:52,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 130 flow. Second operand has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 0 states have call successors, (0), 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-10-11 19:53:52,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:53:52,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2024-10-11 19:53:52,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:53:53,751 INFO L124 PetriNetUnfolderBase]: 4441/7447 cut-off events. [2024-10-11 19:53:53,752 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-10-11 19:53:53,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14555 conditions, 7447 events. 4441/7447 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 50319 event pairs, 1599 based on Foata normal form. 6/7364 useless extension candidates. Maximal degree in co-relation 13435. Up to 2233 conditions per place. [2024-10-11 19:53:53,818 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 135 selfloop transitions, 15 changer transitions 18/187 dead transitions. [2024-10-11 19:53:53,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 187 transitions, 782 flow [2024-10-11 19:53:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:53:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:53:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 427 transitions. [2024-10-11 19:53:53,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.646969696969697 [2024-10-11 19:53:53,838 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 130 flow. Second operand 11 states and 427 transitions. [2024-10-11 19:53:53,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 187 transitions, 782 flow [2024-10-11 19:53:53,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 187 transitions, 734 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 19:53:53,867 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 206 flow [2024-10-11 19:53:53,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=206, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2024-10-11 19:53:53,874 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2024-10-11 19:53:53,874 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 206 flow [2024-10-11 19:53:53,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 0 states have call successors, (0), 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-10-11 19:53:53,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:53:53,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:53:53,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:53:53,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:53:53,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:53:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1373225363, now seen corresponding path program 2 times [2024-10-11 19:53:53,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:53:53,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731620704] [2024-10-11 19:53:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:53:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:53:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:53:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:53:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:53:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731620704] [2024-10-11 19:53:54,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731620704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:53:54,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:53:54,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:53:54,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090135556] [2024-10-11 19:53:54,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:53:54,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:53:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:53:54,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:53:54,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:53:54,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-10-11 19:53:54,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 206 flow. Second operand has 8 states, 8 states have (on average 26.625) internal successors, (213), 8 states have internal predecessors, (213), 0 states have call successors, (0), 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-10-11 19:53:54,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:53:54,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-10-11 19:53:54,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:53:55,953 INFO L124 PetriNetUnfolderBase]: 6540/10846 cut-off events. [2024-10-11 19:53:55,953 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-10-11 19:53:55,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21747 conditions, 10846 events. 6540/10846 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 73844 event pairs, 2248 based on Foata normal form. 122/10702 useless extension candidates. Maximal degree in co-relation 21720. Up to 8293 conditions per place. [2024-10-11 19:53:56,035 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 99 selfloop transitions, 21 changer transitions 0/154 dead transitions. [2024-10-11 19:53:56,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 154 transitions, 620 flow [2024-10-11 19:53:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:53:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:53:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 297 transitions. [2024-10-11 19:53:56,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.61875 [2024-10-11 19:53:56,038 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 206 flow. Second operand 8 states and 297 transitions. [2024-10-11 19:53:56,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 154 transitions, 620 flow [2024-10-11 19:53:56,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 154 transitions, 618 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:53:56,051 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 330 flow [2024-10-11 19:53:56,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2024-10-11 19:53:56,052 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 14 predicate places. [2024-10-11 19:53:56,053 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 330 flow [2024-10-11 19:53:56,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.625) internal successors, (213), 8 states have internal predecessors, (213), 0 states have call successors, (0), 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-10-11 19:53:56,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:53:56,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:53:56,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:53:56,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:53:56,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:53:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash 607216483, now seen corresponding path program 3 times [2024-10-11 19:53:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:53:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944351499] [2024-10-11 19:53:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:53:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:53:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:53:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:53:56,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:53:56,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944351499] [2024-10-11 19:53:56,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944351499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:53:56,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:53:56,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:53:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979897088] [2024-10-11 19:53:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:53:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:53:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:53:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:53:56,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:53:56,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-11 19:53:56,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:53:56,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:53:56,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-11 19:53:56,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:53:56,889 INFO L124 PetriNetUnfolderBase]: 3715/7293 cut-off events. [2024-10-11 19:53:56,889 INFO L125 PetriNetUnfolderBase]: For 1174/1207 co-relation queries the response was YES. [2024-10-11 19:53:56,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15505 conditions, 7293 events. 3715/7293 cut-off events. For 1174/1207 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 56496 event pairs, 2476 based on Foata normal form. 121/7111 useless extension candidates. Maximal degree in co-relation 12316. Up to 4345 conditions per place. [2024-10-11 19:53:56,936 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 58 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-10-11 19:53:56,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 504 flow [2024-10-11 19:53:56,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:53:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:53:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-10-11 19:53:56,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-10-11 19:53:56,938 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 330 flow. Second operand 3 states and 128 transitions. [2024-10-11 19:53:56,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 504 flow [2024-10-11 19:53:56,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:53:56,948 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 340 flow [2024-10-11 19:53:56,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=83, PETRI_TRANSITIONS=91} [2024-10-11 19:53:56,949 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-10-11 19:53:56,949 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 340 flow [2024-10-11 19:53:56,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:53:56,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:53:56,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:53:56,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:53:56,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:53:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:53:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1819799741, now seen corresponding path program 4 times [2024-10-11 19:53:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:53:56,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115975971] [2024-10-11 19:53:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:53:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:53:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:53:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:53:57,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:53:57,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115975971] [2024-10-11 19:53:57,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115975971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:53:57,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:53:57,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:53:57,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023593496] [2024-10-11 19:53:57,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:53:57,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:53:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:53:57,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:53:57,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:53:57,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-11 19:53:57,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 91 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:53:57,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:53:57,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-11 19:53:57,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:53:57,798 INFO L124 PetriNetUnfolderBase]: 3611/7230 cut-off events. [2024-10-11 19:53:57,799 INFO L125 PetriNetUnfolderBase]: For 1524/1582 co-relation queries the response was YES. [2024-10-11 19:53:57,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15955 conditions, 7230 events. 3611/7230 cut-off events. For 1524/1582 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 57341 event pairs, 2624 based on Foata normal form. 102/7017 useless extension candidates. Maximal degree in co-relation 12615. Up to 4482 conditions per place. [2024-10-11 19:53:57,864 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 58 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-10-11 19:53:57,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 109 transitions, 523 flow [2024-10-11 19:53:57,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:53:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:53:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-10-11 19:53:57,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2024-10-11 19:53:57,866 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 340 flow. Second operand 3 states and 127 transitions. [2024-10-11 19:53:57,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 109 transitions, 523 flow [2024-10-11 19:53:57,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:53:57,878 INFO L231 Difference]: Finished difference. Result has 84 places, 91 transitions, 346 flow [2024-10-11 19:53:57,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=84, PETRI_TRANSITIONS=91} [2024-10-11 19:53:57,880 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places. [2024-10-11 19:53:57,880 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 346 flow [2024-10-11 19:53:57,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:53:57,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:53:57,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:53:57,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:53:57,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:53:57,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:53:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1160101649, now seen corresponding path program 5 times [2024-10-11 19:53:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:53:57,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193024842] [2024-10-11 19:53:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:53:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:53:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:53:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:53:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:53:58,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193024842] [2024-10-11 19:53:58,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193024842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:53:58,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:53:58,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:53:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816337025] [2024-10-11 19:53:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:53:58,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:53:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:53:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:53:58,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:53:58,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2024-10-11 19:53:58,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 346 flow. Second operand has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 0 states have call successors, (0), 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-10-11 19:53:58,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:53:58,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2024-10-11 19:53:58,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:53:59,753 INFO L124 PetriNetUnfolderBase]: 7144/12461 cut-off events. [2024-10-11 19:53:59,753 INFO L125 PetriNetUnfolderBase]: For 3536/3617 co-relation queries the response was YES. [2024-10-11 19:53:59,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29498 conditions, 12461 events. 7144/12461 cut-off events. For 3536/3617 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 94199 event pairs, 2320 based on Foata normal form. 22/12227 useless extension candidates. Maximal degree in co-relation 19386. Up to 3074 conditions per place. [2024-10-11 19:53:59,870 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 184 selfloop transitions, 26 changer transitions 18/257 dead transitions. [2024-10-11 19:53:59,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 257 transitions, 1326 flow [2024-10-11 19:53:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:53:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:53:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 436 transitions. [2024-10-11 19:53:59,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2024-10-11 19:53:59,873 INFO L175 Difference]: Start difference. First operand has 84 places, 91 transitions, 346 flow. Second operand 11 states and 436 transitions. [2024-10-11 19:53:59,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 257 transitions, 1326 flow [2024-10-11 19:53:59,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 257 transitions, 1322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:53:59,890 INFO L231 Difference]: Finished difference. Result has 98 places, 112 transitions, 549 flow [2024-10-11 19:53:59,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=549, PETRI_PLACES=98, PETRI_TRANSITIONS=112} [2024-10-11 19:53:59,891 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2024-10-11 19:53:59,891 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 112 transitions, 549 flow [2024-10-11 19:53:59,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 0 states have call successors, (0), 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-10-11 19:53:59,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:53:59,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:53:59,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:53:59,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:53:59,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:53:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash -596923145, now seen corresponding path program 6 times [2024-10-11 19:53:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:53:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647235710] [2024-10-11 19:53:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:53:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:53:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:54:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:54:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:54:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647235710] [2024-10-11 19:54:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647235710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:54:00,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:54:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:54:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407506181] [2024-10-11 19:54:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:54:00,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:54:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:54:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:54:00,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:54:00,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-11 19:54:00,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 112 transitions, 549 flow. Second operand has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 0 states have call successors, (0), 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-10-11 19:54:00,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:54:00,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-11 19:54:00,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:54:04,235 INFO L124 PetriNetUnfolderBase]: 16703/28810 cut-off events. [2024-10-11 19:54:04,235 INFO L125 PetriNetUnfolderBase]: For 9582/9721 co-relation queries the response was YES. [2024-10-11 19:54:04,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69718 conditions, 28810 events. 16703/28810 cut-off events. For 9582/9721 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 231106 event pairs, 2387 based on Foata normal form. 122/28304 useless extension candidates. Maximal degree in co-relation 69586. Up to 9282 conditions per place. [2024-10-11 19:54:04,441 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 218 selfloop transitions, 73 changer transitions 0/344 dead transitions. [2024-10-11 19:54:04,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 344 transitions, 1811 flow [2024-10-11 19:54:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 19:54:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-11 19:54:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 602 transitions. [2024-10-11 19:54:04,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5901960784313726 [2024-10-11 19:54:04,444 INFO L175 Difference]: Start difference. First operand has 98 places, 112 transitions, 549 flow. Second operand 17 states and 602 transitions. [2024-10-11 19:54:04,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 344 transitions, 1811 flow [2024-10-11 19:54:04,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 344 transitions, 1803 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-10-11 19:54:04,572 INFO L231 Difference]: Finished difference. Result has 121 places, 197 transitions, 1116 flow [2024-10-11 19:54:04,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1116, PETRI_PLACES=121, PETRI_TRANSITIONS=197} [2024-10-11 19:54:04,575 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2024-10-11 19:54:04,575 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 197 transitions, 1116 flow [2024-10-11 19:54:04,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 0 states have call successors, (0), 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-10-11 19:54:04,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:54:04,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:54:04,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:54:04,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:54:04,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:54:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2061454239, now seen corresponding path program 7 times [2024-10-11 19:54:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:54:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69051380] [2024-10-11 19:54:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:54:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:54:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:54:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:54:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:54:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69051380] [2024-10-11 19:54:04,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69051380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:54:04,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:54:04,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:54:04,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082360221] [2024-10-11 19:54:04,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:54:04,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:54:04,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:54:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:54:04,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:54:04,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-11 19:54:04,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 197 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:54:04,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:54:04,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-11 19:54:04,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:54:06,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L162-->L165: Formula: (= v_~n3~0_7 0) InVars {} OutVars{~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][107], [30#L79true, 189#true, 155#(= ~n3~0 0), Black: 136#(and (= ~i1~0 0) (= ~i~0 1)), 15#L165true, Black: 140#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 126#(= ~i~0 0), Black: 144#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 75#(= ~i~0 0), Black: 85#(and (= ~i3~0 0) (= ~i~0 1)), Black: 89#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 29#L122true, 73#true, 100#true, Black: 104#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 102#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 34#L190-4true, Black: 103#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 109#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 170#(and (or (and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)) (< ~n1~0 0)) (or (< 0 ~n1~0) (< ~n1~0 ~n2~0))), Black: 156#(and (<= 0 ~n2~0) (= ~n3~0 0)), Black: 172#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (not (= ~n1~0 0)) (<= (+ ~n1~0 1) ~n3~0)), Black: 162#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 164#(and (or (< 0 ~n1~0) (< ~n1~0 ~n2~0)) (or (< ~n2~0 ~n3~0) (not (= ~n1~0 0))) (<= (+ ~n1~0 1) ~n3~0)), Black: 118#(= ~e2~0 1), Black: 160#(or (and (or (< 0 ~n1~0) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0))) (<= (+ ~n1~0 1) ~n3~0)) (and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n1~0 1) 0))), Black: 168#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0)), Black: 159#(or (and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n1~0 1) 0)) (and (<= ~n1~0 ~n3~0) (or (< 0 ~n1~0) (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0))))), Black: 176#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), Black: 122#(= ~e3~0 1), 127#(= ~i1~0 0)]) [2024-10-11 19:54:06,579 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is not cut-off event [2024-10-11 19:54:06,579 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2024-10-11 19:54:06,579 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2024-10-11 19:54:06,579 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2024-10-11 19:54:06,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L162-->L165: Formula: (= v_~n3~0_7 0) InVars {} OutVars{~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][107], [30#L79true, 189#true, 155#(= ~n3~0 0), Black: 136#(and (= ~i1~0 0) (= ~i~0 1)), 15#L165true, Black: 140#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 126#(= ~i~0 0), Black: 144#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 75#(= ~i~0 0), Black: 85#(and (= ~i3~0 0) (= ~i~0 1)), Black: 89#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 29#L122true, 73#true, 100#true, Black: 104#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 102#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 103#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 170#(and (or (and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n3~0)) (< ~n1~0 0)) (or (< 0 ~n1~0) (< ~n1~0 ~n2~0))), Black: 109#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 0 ~n2~0) (= ~n3~0 0)), Black: 172#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (not (= ~n1~0 0)) (<= (+ ~n1~0 1) ~n3~0)), Black: 162#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 118#(= ~e2~0 1), Black: 164#(and (or (< 0 ~n1~0) (< ~n1~0 ~n2~0)) (or (< ~n2~0 ~n3~0) (not (= ~n1~0 0))) (<= (+ ~n1~0 1) ~n3~0)), Black: 160#(or (and (or (< 0 ~n1~0) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n2~0))) (<= (+ ~n1~0 1) ~n3~0)) (and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n1~0 1) 0))), 12#L191true, Black: 168#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= (+ ~n1~0 1) ~n3~0)), Black: 159#(or (and (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n1~0 1) 0)) (and (<= ~n1~0 ~n3~0) (or (< 0 ~n1~0) (and (= ~n2~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0))))), Black: 122#(= ~e3~0 1), Black: 176#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 ~n3~0)), 127#(= ~i1~0 0)]) [2024-10-11 19:54:06,600 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is not cut-off event [2024-10-11 19:54:06,600 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-10-11 19:54:06,600 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-10-11 19:54:06,600 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-10-11 19:54:06,693 INFO L124 PetriNetUnfolderBase]: 11072/21446 cut-off events. [2024-10-11 19:54:06,693 INFO L125 PetriNetUnfolderBase]: For 19305/19587 co-relation queries the response was YES. [2024-10-11 19:54:06,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59292 conditions, 21446 events. 11072/21446 cut-off events. For 19305/19587 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 191285 event pairs, 6986 based on Foata normal form. 264/20342 useless extension candidates. Maximal degree in co-relation 55696. Up to 12761 conditions per place. [2024-10-11 19:54:06,902 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 101 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2024-10-11 19:54:06,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 230 transitions, 1506 flow [2024-10-11 19:54:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:54:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:54:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-10-11 19:54:06,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-10-11 19:54:06,904 INFO L175 Difference]: Start difference. First operand has 121 places, 197 transitions, 1116 flow. Second operand 3 states and 129 transitions. [2024-10-11 19:54:06,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 230 transitions, 1506 flow [2024-10-11 19:54:07,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 230 transitions, 1472 flow, removed 17 selfloop flow, removed 0 redundant places. [2024-10-11 19:54:07,350 INFO L231 Difference]: Finished difference. Result has 124 places, 192 transitions, 1060 flow [2024-10-11 19:54:07,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=124, PETRI_TRANSITIONS=192} [2024-10-11 19:54:07,351 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 58 predicate places. [2024-10-11 19:54:07,351 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 192 transitions, 1060 flow [2024-10-11 19:54:07,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:54:07,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:54:07,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:54:07,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:54:07,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:54:07,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:54:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -470694231, now seen corresponding path program 8 times [2024-10-11 19:54:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:54:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666046766] [2024-10-11 19:54:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:54:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:54:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:54:07,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-10-11 19:54:07,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:54:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666046766] [2024-10-11 19:54:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666046766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:54:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:54:07,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:54:07,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274202644] [2024-10-11 19:54:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:54:07,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:54:07,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:54:07,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:54:07,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:54:07,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-11 19:54:07,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 192 transitions, 1060 flow. Second operand has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 0 states have call successors, (0), 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-10-11 19:54:07,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:54:07,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-11 19:54:07,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:54:13,616 INFO L124 PetriNetUnfolderBase]: 31239/54844 cut-off events. [2024-10-11 19:54:13,616 INFO L125 PetriNetUnfolderBase]: For 68067/70024 co-relation queries the response was YES. [2024-10-11 19:54:14,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166403 conditions, 54844 events. 31239/54844 cut-off events. For 68067/70024 co-relation queries the response was YES. Maximal size of possible extension queue 1797. Compared 492575 event pairs, 7302 based on Foata normal form. 712/54329 useless extension candidates. Maximal degree in co-relation 154255. Up to 20339 conditions per place. [2024-10-11 19:54:14,531 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 365 selfloop transitions, 200 changer transitions 0/618 dead transitions. [2024-10-11 19:54:14,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 618 transitions, 4272 flow [2024-10-11 19:54:14,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 19:54:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-11 19:54:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 696 transitions. [2024-10-11 19:54:14,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-10-11 19:54:14,535 INFO L175 Difference]: Start difference. First operand has 124 places, 192 transitions, 1060 flow. Second operand 18 states and 696 transitions. [2024-10-11 19:54:14,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 618 transitions, 4272 flow [2024-10-11 19:54:15,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 618 transitions, 4268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:54:15,438 INFO L231 Difference]: Finished difference. Result has 152 places, 372 transitions, 2940 flow [2024-10-11 19:54:15,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2940, PETRI_PLACES=152, PETRI_TRANSITIONS=372} [2024-10-11 19:54:15,440 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 86 predicate places. [2024-10-11 19:54:15,440 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 372 transitions, 2940 flow [2024-10-11 19:54:15,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 0 states have call successors, (0), 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-10-11 19:54:15,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:54:15,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:54:15,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:54:15,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:54:15,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:54:15,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1425316383, now seen corresponding path program 9 times [2024-10-11 19:54:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:54:15,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586668046] [2024-10-11 19:54:15,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:54:15,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:54:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:54:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:54:15,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:54:15,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586668046] [2024-10-11 19:54:15,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586668046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:54:15,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:54:15,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:54:15,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060553442] [2024-10-11 19:54:15,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:54:15,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:54:15,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:54:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:54:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:54:15,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2024-10-11 19:54:15,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 372 transitions, 2940 flow. Second operand has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 0 states have call successors, (0), 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-10-11 19:54:15,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:54:15,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2024-10-11 19:54:15,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:54:25,035 INFO L124 PetriNetUnfolderBase]: 42457/69509 cut-off events. [2024-10-11 19:54:25,036 INFO L125 PetriNetUnfolderBase]: For 243844/246848 co-relation queries the response was YES. [2024-10-11 19:54:25,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260036 conditions, 69509 events. 42457/69509 cut-off events. For 243844/246848 co-relation queries the response was YES. Maximal size of possible extension queue 1903. Compared 591647 event pairs, 13491 based on Foata normal form. 527/68049 useless extension candidates. Maximal degree in co-relation 244860. Up to 17615 conditions per place. [2024-10-11 19:54:25,843 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 363 selfloop transitions, 31 changer transitions 9/616 dead transitions. [2024-10-11 19:54:25,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 616 transitions, 5562 flow [2024-10-11 19:54:25,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:54:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:54:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 432 transitions. [2024-10-11 19:54:25,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-10-11 19:54:25,845 INFO L175 Difference]: Start difference. First operand has 152 places, 372 transitions, 2940 flow. Second operand 11 states and 432 transitions. [2024-10-11 19:54:25,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 616 transitions, 5562 flow [2024-10-11 19:54:28,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 616 transitions, 5420 flow, removed 71 selfloop flow, removed 0 redundant places. [2024-10-11 19:54:28,668 INFO L231 Difference]: Finished difference. Result has 166 places, 379 transitions, 2992 flow [2024-10-11 19:54:28,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2848, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2992, PETRI_PLACES=166, PETRI_TRANSITIONS=379} [2024-10-11 19:54:28,669 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 100 predicate places. [2024-10-11 19:54:28,669 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 379 transitions, 2992 flow [2024-10-11 19:54:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 0 states have call successors, (0), 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-10-11 19:54:28,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:54:28,669 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 19:54:28,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:54:28,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:54:28,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:54:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash 741970829, now seen corresponding path program 10 times [2024-10-11 19:54:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:54:28,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288026956] [2024-10-11 19:54:28,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:54:28,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:54:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:54:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:54:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:54:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288026956] [2024-10-11 19:54:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288026956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:54:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:54:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:54:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80211481] [2024-10-11 19:54:29,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:54:29,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:54:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:54:29,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:54:29,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:54:29,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-11 19:54:29,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 379 transitions, 2992 flow. Second operand has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 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-10-11 19:54:29,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:54:29,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-11 19:54:29,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:54:38,381 INFO L124 PetriNetUnfolderBase]: 41503/72379 cut-off events. [2024-10-11 19:54:38,381 INFO L125 PetriNetUnfolderBase]: For 316572/322045 co-relation queries the response was YES. [2024-10-11 19:54:39,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282217 conditions, 72379 events. 41503/72379 cut-off events. For 316572/322045 co-relation queries the response was YES. Maximal size of possible extension queue 2029. Compared 667167 event pairs, 11633 based on Foata normal form. 1273/71817 useless extension candidates. Maximal degree in co-relation 278975. Up to 35586 conditions per place. [2024-10-11 19:54:39,384 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 412 selfloop transitions, 191 changer transitions 1/664 dead transitions. [2024-10-11 19:54:39,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 664 transitions, 6390 flow [2024-10-11 19:54:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:54:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:54:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 464 transitions. [2024-10-11 19:54:39,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.703030303030303 [2024-10-11 19:54:39,386 INFO L175 Difference]: Start difference. First operand has 166 places, 379 transitions, 2992 flow. Second operand 11 states and 464 transitions. [2024-10-11 19:54:39,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 664 transitions, 6390 flow [2024-10-11 19:54:42,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 664 transitions, 6321 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-10-11 19:54:42,488 INFO L231 Difference]: Finished difference. Result has 182 places, 462 transitions, 4617 flow [2024-10-11 19:54:42,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2608, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4617, PETRI_PLACES=182, PETRI_TRANSITIONS=462} [2024-10-11 19:54:42,489 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 116 predicate places. [2024-10-11 19:54:42,490 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 462 transitions, 4617 flow [2024-10-11 19:54:42,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 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-10-11 19:54:42,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:54:42,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:54:42,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:54:42,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 19:54:42,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:54:42,490 INFO L85 PathProgramCache]: Analyzing trace with hash -459164119, now seen corresponding path program 11 times [2024-10-11 19:54:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:54:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395254472] [2024-10-11 19:54:42,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:54:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:54:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:54:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:54:42,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:54:42,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395254472] [2024-10-11 19:54:42,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395254472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:54:42,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:54:42,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:54:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320479085] [2024-10-11 19:54:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:54:42,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:54:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:54:42,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:54:42,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:54:42,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-10-11 19:54:42,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 462 transitions, 4617 flow. Second operand has 8 states, 8 states have (on average 25.625) internal successors, (205), 8 states have internal predecessors, (205), 0 states have call successors, (0), 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-10-11 19:54:42,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:54:42,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-10-11 19:54:42,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand