./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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:50:46,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:50:46,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:50:46,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:50:46,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:50:46,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:50:46,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:50:46,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:50:46,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:50:46,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:50:46,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:50:46,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:50:46,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:50:46,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:50:46,344 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:50:46,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:50:46,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:50:46,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:50:46,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:50:46,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:50:46,345 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:50:46,347 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:50:46,348 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:50:46,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:50:46,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:50:46,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:50:46,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:50:46,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:50:46,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:50:46,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:50:46,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:50:46,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:50:46,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:50:46,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:50:46,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:50:46,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:50:46,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:50:46,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:50:46,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:50:46,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:50:46,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:50:46,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:50:46,352 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 [2024-10-14 19:50:46,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:50:46,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:50:46,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:50:46,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:50:46,637 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:50:46,638 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-14 19:50:48,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:50:48,258 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:50:48,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2024-10-14 19:50:48,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eff012fd/9d573f5b16824ecea8a7cf8e1cf03c98/FLAG4541941f0 [2024-10-14 19:50:48,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eff012fd/9d573f5b16824ecea8a7cf8e1cf03c98 [2024-10-14 19:50:48,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:50:48,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:50:48,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:50:48,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:50:48,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:50:48,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c0cfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48, skipping insertion in model container [2024-10-14 19:50:48,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:50:48,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:50:48,535 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:50:48,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:50:48,589 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:50:48,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48 WrapperNode [2024-10-14 19:50:48,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:50:48,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:50:48,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:50:48,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:50:48,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,640 INFO L138 Inliner]: procedures = 21, calls = 96, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 254 [2024-10-14 19:50:48,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:50:48,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:50:48,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:50:48,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:50:48,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,673 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-14 19:50:48,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:50:48,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:50:48,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:50:48,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:50:48,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (1/1) ... [2024-10-14 19:50:48,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:50:48,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:50:48,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:50:48,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:50:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:50:48,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 19:50:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 19:50:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 19:50:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 19:50:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 19:50:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 19:50:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:50:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:50:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:50:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:50:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:50:48,769 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:50:48,859 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:50:48,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:50:49,152 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:50:49,152 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:50:49,502 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:50:49,503 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:50:49,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:50:49 BoogieIcfgContainer [2024-10-14 19:50:49,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:50:49,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:50:49,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:50:49,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:50:49,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:50:48" (1/3) ... [2024-10-14 19:50:49,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d8245a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:50:49, skipping insertion in model container [2024-10-14 19:50:49,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:50:48" (2/3) ... [2024-10-14 19:50:49,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d8245a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:50:49, skipping insertion in model container [2024-10-14 19:50:49,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:50:49" (3/3) ... [2024-10-14 19:50:49,516 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2024-10-14 19:50:49,536 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:50:49,537 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 19:50:49,537 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:50:49,597 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 19:50:49,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 60 transitions, 141 flow [2024-10-14 19:50:49,675 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2024-10-14 19:50:49,675 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 19:50:49,679 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-14 19:50:49,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 60 transitions, 141 flow [2024-10-14 19:50:49,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 130 flow [2024-10-14 19:50:49,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:50:49,707 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;@c4ed142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:50:49,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-14 19:50:49,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:50:49,729 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2024-10-14 19:50:49,729 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 19:50:49,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:50:49,730 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-14 19:50:49,731 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-14 19:50:49,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:50:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1618045045, now seen corresponding path program 1 times [2024-10-14 19:50:49,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:50:49,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276565032] [2024-10-14 19:50:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:50:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:50:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:50:50,493 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-14 19:50:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:50:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276565032] [2024-10-14 19:50:50,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276565032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:50:50,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:50:50,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:50:50,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915024075] [2024-10-14 19:50:50,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:50:50,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:50:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:50:50,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:50:50,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:50:50,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2024-10-14 19:50:50,583 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-14 19:50:50,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:50:50,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2024-10-14 19:50:50,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:50:51,907 INFO L124 PetriNetUnfolderBase]: 4441/7447 cut-off events. [2024-10-14 19:50:51,908 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-10-14 19:50:51,930 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-14 19:50:52,023 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 135 selfloop transitions, 15 changer transitions 18/187 dead transitions. [2024-10-14 19:50:52,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 187 transitions, 782 flow [2024-10-14 19:50:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:50:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:50:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 427 transitions. [2024-10-14 19:50:52,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.646969696969697 [2024-10-14 19:50:52,041 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 130 flow. Second operand 11 states and 427 transitions. [2024-10-14 19:50:52,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 187 transitions, 782 flow [2024-10-14 19:50:52,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 187 transitions, 734 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 19:50:52,067 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 206 flow [2024-10-14 19:50:52,069 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-14 19:50:52,074 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2024-10-14 19:50:52,074 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 206 flow [2024-10-14 19:50:52,075 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-14 19:50:52,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:50:52,075 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-14 19:50:52,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:50:52,076 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-14 19:50:52,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:50:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1373225363, now seen corresponding path program 2 times [2024-10-14 19:50:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:50:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074620436] [2024-10-14 19:50:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:50:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:50:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:50:52,783 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-14 19:50:52,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:50:52,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074620436] [2024-10-14 19:50:52,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074620436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:50:52,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:50:52,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:50:52,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703924764] [2024-10-14 19:50:52,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:50:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:50:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:50:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:50:52,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:50:52,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-10-14 19:50:52,851 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-14 19:50:52,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:50:52,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-10-14 19:50:52,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:50:53,985 INFO L124 PetriNetUnfolderBase]: 6540/10846 cut-off events. [2024-10-14 19:50:53,986 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-10-14 19:50:54,007 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-14 19:50:54,049 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 99 selfloop transitions, 21 changer transitions 0/154 dead transitions. [2024-10-14 19:50:54,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 154 transitions, 620 flow [2024-10-14 19:50:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:50:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:50:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 297 transitions. [2024-10-14 19:50:54,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.61875 [2024-10-14 19:50:54,052 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 206 flow. Second operand 8 states and 297 transitions. [2024-10-14 19:50:54,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 154 transitions, 620 flow [2024-10-14 19:50:54,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 154 transitions, 618 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-14 19:50:54,064 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 330 flow [2024-10-14 19:50:54,065 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-14 19:50:54,066 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 14 predicate places. [2024-10-14 19:50:54,066 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 330 flow [2024-10-14 19:50:54,067 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-14 19:50:54,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:50:54,067 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-14 19:50:54,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:50:54,068 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-14 19:50:54,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:50:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 607216483, now seen corresponding path program 3 times [2024-10-14 19:50:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:50:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241993949] [2024-10-14 19:50:54,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:50:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:50:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:50:54,167 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-14 19:50:54,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:50:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241993949] [2024-10-14 19:50:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241993949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:50:54,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:50:54,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:50:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994470956] [2024-10-14 19:50:54,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:50:54,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:50:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:50:54,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:50:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:50:54,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-14 19:50:54,174 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-14 19:50:54,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:50:54,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-14 19:50:54,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:50:54,880 INFO L124 PetriNetUnfolderBase]: 3715/7293 cut-off events. [2024-10-14 19:50:54,880 INFO L125 PetriNetUnfolderBase]: For 1174/1207 co-relation queries the response was YES. [2024-10-14 19:50:54,907 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-14 19:50:54,940 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 58 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-10-14 19:50:54,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 504 flow [2024-10-14 19:50:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:50:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:50:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-10-14 19:50:54,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-10-14 19:50:54,943 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 330 flow. Second operand 3 states and 128 transitions. [2024-10-14 19:50:54,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 504 flow [2024-10-14 19:50:54,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:50:54,958 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 340 flow [2024-10-14 19:50:54,959 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-14 19:50:54,960 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-10-14 19:50:54,961 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 340 flow [2024-10-14 19:50:54,961 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-14 19:50:54,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:50:54,962 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-14 19:50:54,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:50:54,962 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-14 19:50:54,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:50:54,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1819799741, now seen corresponding path program 4 times [2024-10-14 19:50:54,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:50:54,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248481812] [2024-10-14 19:50:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:50:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:50:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:50:55,078 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-14 19:50:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:50:55,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248481812] [2024-10-14 19:50:55,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248481812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:50:55,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:50:55,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:50:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253799605] [2024-10-14 19:50:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:50:55,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:50:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:50:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:50:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:50:55,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-14 19:50:55,085 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-14 19:50:55,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:50:55,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-14 19:50:55,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:50:55,817 INFO L124 PetriNetUnfolderBase]: 3611/7230 cut-off events. [2024-10-14 19:50:55,817 INFO L125 PetriNetUnfolderBase]: For 1524/1582 co-relation queries the response was YES. [2024-10-14 19:50:55,835 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-14 19:50:55,857 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 58 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-10-14 19:50:55,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 109 transitions, 523 flow [2024-10-14 19:50:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:50:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:50:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-10-14 19:50:55,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2024-10-14 19:50:55,859 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 340 flow. Second operand 3 states and 127 transitions. [2024-10-14 19:50:55,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 109 transitions, 523 flow [2024-10-14 19:50:55,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:50:55,868 INFO L231 Difference]: Finished difference. Result has 84 places, 91 transitions, 346 flow [2024-10-14 19:50:55,868 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-14 19:50:55,869 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places. [2024-10-14 19:50:55,869 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 346 flow [2024-10-14 19:50:55,869 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-14 19:50:55,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:50:55,869 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 19:50:55,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:50:55,870 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-14 19:50:55,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:50:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1160101649, now seen corresponding path program 5 times [2024-10-14 19:50:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:50:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297355434] [2024-10-14 19:50:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:50:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:50:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:50:56,057 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-14 19:50:56,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:50:56,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297355434] [2024-10-14 19:50:56,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297355434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:50:56,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:50:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:50:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917597259] [2024-10-14 19:50:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:50:56,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:50:56,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:50:56,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:50:56,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:50:56,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2024-10-14 19:50:56,088 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-14 19:50:56,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:50:56,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2024-10-14 19:50:56,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:50:57,632 INFO L124 PetriNetUnfolderBase]: 7144/12461 cut-off events. [2024-10-14 19:50:57,632 INFO L125 PetriNetUnfolderBase]: For 3536/3617 co-relation queries the response was YES. [2024-10-14 19:50:57,699 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-14 19:50:57,747 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 184 selfloop transitions, 26 changer transitions 18/257 dead transitions. [2024-10-14 19:50:57,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 257 transitions, 1326 flow [2024-10-14 19:50:57,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:50:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:50:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 436 transitions. [2024-10-14 19:50:57,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2024-10-14 19:50:57,750 INFO L175 Difference]: Start difference. First operand has 84 places, 91 transitions, 346 flow. Second operand 11 states and 436 transitions. [2024-10-14 19:50:57,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 257 transitions, 1326 flow [2024-10-14 19:50:57,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 257 transitions, 1322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:50:57,768 INFO L231 Difference]: Finished difference. Result has 98 places, 112 transitions, 549 flow [2024-10-14 19:50:57,769 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-14 19:50:57,771 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2024-10-14 19:50:57,772 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 112 transitions, 549 flow [2024-10-14 19:50:57,773 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-14 19:50:57,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:50:57,774 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-14 19:50:57,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:50:57,774 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-14 19:50:57,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:50:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash -596923145, now seen corresponding path program 6 times [2024-10-14 19:50:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:50:57,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923928464] [2024-10-14 19:50:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:50:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:50:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:50:58,565 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-14 19:50:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:50:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923928464] [2024-10-14 19:50:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923928464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:50:58,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:50:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 19:50:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19372956] [2024-10-14 19:50:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:50:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:50:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:50:58,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:50:58,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:50:58,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-14 19:50:58,611 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-14 19:50:58,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:50:58,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-14 19:50:58,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:51:02,043 INFO L124 PetriNetUnfolderBase]: 16703/28810 cut-off events. [2024-10-14 19:51:02,044 INFO L125 PetriNetUnfolderBase]: For 9582/9721 co-relation queries the response was YES. [2024-10-14 19:51:02,156 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-14 19:51:02,264 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 218 selfloop transitions, 73 changer transitions 0/344 dead transitions. [2024-10-14 19:51:02,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 344 transitions, 1811 flow [2024-10-14 19:51:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 19:51:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-14 19:51:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 602 transitions. [2024-10-14 19:51:02,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5901960784313726 [2024-10-14 19:51:02,267 INFO L175 Difference]: Start difference. First operand has 98 places, 112 transitions, 549 flow. Second operand 17 states and 602 transitions. [2024-10-14 19:51:02,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 344 transitions, 1811 flow [2024-10-14 19:51:02,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 344 transitions, 1803 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-10-14 19:51:02,405 INFO L231 Difference]: Finished difference. Result has 121 places, 197 transitions, 1116 flow [2024-10-14 19:51:02,405 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-14 19:51:02,406 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2024-10-14 19:51:02,406 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 197 transitions, 1116 flow [2024-10-14 19:51:02,407 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-14 19:51:02,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:51:02,407 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-14 19:51:02,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:51:02,407 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-14 19:51:02,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:51:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2061454239, now seen corresponding path program 7 times [2024-10-14 19:51:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:51:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412279500] [2024-10-14 19:51:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:51:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:51:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:51:02,646 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-14 19:51:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:51:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412279500] [2024-10-14 19:51:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412279500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:51:02,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:51:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:51:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803016264] [2024-10-14 19:51:02,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:51:02,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:51:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:51:02,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:51:02,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:51:02,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-14 19:51:02,651 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-14 19:51:02,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:51:02,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-14 19:51:02,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:51:04,484 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-14 19:51:04,484 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is not cut-off event [2024-10-14 19:51:04,484 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2024-10-14 19:51:04,484 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2024-10-14 19:51:04,485 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2024-10-14 19:51:04,505 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-14 19:51:04,505 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is not cut-off event [2024-10-14 19:51:04,505 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-10-14 19:51:04,506 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-10-14 19:51:04,506 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-10-14 19:51:04,631 INFO L124 PetriNetUnfolderBase]: 11072/21446 cut-off events. [2024-10-14 19:51:04,632 INFO L125 PetriNetUnfolderBase]: For 19305/19587 co-relation queries the response was YES. [2024-10-14 19:51:04,704 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-14 19:51:04,778 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 101 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2024-10-14 19:51:04,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 230 transitions, 1506 flow [2024-10-14 19:51:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:51:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:51:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-10-14 19:51:04,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-10-14 19:51:04,780 INFO L175 Difference]: Start difference. First operand has 121 places, 197 transitions, 1116 flow. Second operand 3 states and 129 transitions. [2024-10-14 19:51:04,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 230 transitions, 1506 flow [2024-10-14 19:51:04,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 230 transitions, 1472 flow, removed 17 selfloop flow, removed 0 redundant places. [2024-10-14 19:51:05,002 INFO L231 Difference]: Finished difference. Result has 124 places, 192 transitions, 1060 flow [2024-10-14 19:51:05,002 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-14 19:51:05,003 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 58 predicate places. [2024-10-14 19:51:05,003 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 192 transitions, 1060 flow [2024-10-14 19:51:05,003 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-14 19:51:05,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:51:05,004 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-14 19:51:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:51:05,004 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-14 19:51:05,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:51:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash -470694231, now seen corresponding path program 8 times [2024-10-14 19:51:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:51:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338602057] [2024-10-14 19:51:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:51:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:51:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:51:05,450 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-14 19:51:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:51:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338602057] [2024-10-14 19:51:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338602057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:51:05,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:51:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 19:51:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002079914] [2024-10-14 19:51:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:51:05,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:51:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:51:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:51:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:51:05,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-14 19:51:05,503 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-14 19:51:05,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:51:05,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-14 19:51:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:51:11,077 INFO L124 PetriNetUnfolderBase]: 31239/54844 cut-off events. [2024-10-14 19:51:11,078 INFO L125 PetriNetUnfolderBase]: For 68067/70024 co-relation queries the response was YES. [2024-10-14 19:51:11,412 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-14 19:51:11,553 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 365 selfloop transitions, 200 changer transitions 0/618 dead transitions. [2024-10-14 19:51:11,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 618 transitions, 4272 flow [2024-10-14 19:51:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 19:51:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-14 19:51:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 696 transitions. [2024-10-14 19:51:11,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-10-14 19:51:11,556 INFO L175 Difference]: Start difference. First operand has 124 places, 192 transitions, 1060 flow. Second operand 18 states and 696 transitions. [2024-10-14 19:51:11,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 618 transitions, 4272 flow [2024-10-14 19:51:12,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 618 transitions, 4268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:51:12,496 INFO L231 Difference]: Finished difference. Result has 152 places, 372 transitions, 2940 flow [2024-10-14 19:51:12,496 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-14 19:51:12,497 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 86 predicate places. [2024-10-14 19:51:12,497 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 372 transitions, 2940 flow [2024-10-14 19:51:12,497 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-14 19:51:12,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:51:12,498 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-14 19:51:12,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:51:12,498 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-14 19:51:12,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:51:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1425316383, now seen corresponding path program 9 times [2024-10-14 19:51:12,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:51:12,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918005141] [2024-10-14 19:51:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:51:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:51:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:51:12,663 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-14 19:51:12,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:51:12,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918005141] [2024-10-14 19:51:12,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918005141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:51:12,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:51:12,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:51:12,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298636667] [2024-10-14 19:51:12,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:51:12,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:51:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:51:12,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:51:12,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:51:12,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2024-10-14 19:51:12,692 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-14 19:51:12,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:51:12,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2024-10-14 19:51:12,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:51:21,896 INFO L124 PetriNetUnfolderBase]: 42457/69509 cut-off events. [2024-10-14 19:51:21,896 INFO L125 PetriNetUnfolderBase]: For 243844/246848 co-relation queries the response was YES. [2024-10-14 19:51:22,529 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-14 19:51:22,737 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 363 selfloop transitions, 31 changer transitions 9/616 dead transitions. [2024-10-14 19:51:22,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 616 transitions, 5562 flow [2024-10-14 19:51:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:51:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:51:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 432 transitions. [2024-10-14 19:51:22,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-10-14 19:51:22,740 INFO L175 Difference]: Start difference. First operand has 152 places, 372 transitions, 2940 flow. Second operand 11 states and 432 transitions. [2024-10-14 19:51:22,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 616 transitions, 5562 flow [2024-10-14 19:51:25,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 616 transitions, 5420 flow, removed 71 selfloop flow, removed 0 redundant places. [2024-10-14 19:51:25,159 INFO L231 Difference]: Finished difference. Result has 166 places, 379 transitions, 2992 flow [2024-10-14 19:51:25,160 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-14 19:51:25,160 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 100 predicate places. [2024-10-14 19:51:25,161 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 379 transitions, 2992 flow [2024-10-14 19:51:25,161 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-14 19:51:25,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:51:25,161 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-14 19:51:25,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:51:25,162 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-14 19:51:25,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:51:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash 741970829, now seen corresponding path program 10 times [2024-10-14 19:51:25,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:51:25,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440790784] [2024-10-14 19:51:25,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:51:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:51:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:51:25,676 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-14 19:51:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:51:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440790784] [2024-10-14 19:51:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440790784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:51:25,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:51:25,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:51:25,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555893053] [2024-10-14 19:51:25,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:51:25,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:51:25,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:51:25,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:51:25,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:51:25,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-14 19:51:25,723 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-14 19:51:25,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:51:25,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-14 19:51:25,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:51:35,260 INFO L124 PetriNetUnfolderBase]: 41503/72379 cut-off events. [2024-10-14 19:51:35,260 INFO L125 PetriNetUnfolderBase]: For 316572/322045 co-relation queries the response was YES. [2024-10-14 19:51:36,280 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-14 19:51:36,497 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 412 selfloop transitions, 191 changer transitions 1/664 dead transitions. [2024-10-14 19:51:36,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 664 transitions, 6390 flow [2024-10-14 19:51:36,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:51:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:51:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 464 transitions. [2024-10-14 19:51:36,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.703030303030303 [2024-10-14 19:51:36,499 INFO L175 Difference]: Start difference. First operand has 166 places, 379 transitions, 2992 flow. Second operand 11 states and 464 transitions. [2024-10-14 19:51:36,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 664 transitions, 6390 flow [2024-10-14 19:51:39,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 664 transitions, 6321 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-10-14 19:51:39,033 INFO L231 Difference]: Finished difference. Result has 182 places, 462 transitions, 4617 flow [2024-10-14 19:51:39,034 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-14 19:51:39,034 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 116 predicate places. [2024-10-14 19:51:39,034 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 462 transitions, 4617 flow [2024-10-14 19:51:39,035 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-14 19:51:39,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:51:39,035 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-14 19:51:39,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 19:51:39,035 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-14 19:51:39,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:51:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash -459164119, now seen corresponding path program 11 times [2024-10-14 19:51:39,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:51:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764312850] [2024-10-14 19:51:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:51:39,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:51:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:51:39,360 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-14 19:51:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:51:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764312850] [2024-10-14 19:51:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764312850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:51:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:51:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:51:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073691988] [2024-10-14 19:51:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:51:39,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:51:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:51:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:51:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:51:39,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-10-14 19:51:39,400 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-14 19:51:39,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:51:39,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-10-14 19:51:39,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand