./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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 ../../../trunk/examples/svcomp/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.graphml --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 f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 02:05:58,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 02:05:58,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 02:05:58,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 02:05:58,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 02:05:58,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 02:05:58,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 02:05:58,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 02:05:58,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 02:05:58,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 02:05:58,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 02:05:58,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 02:05:58,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 02:05:58,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 02:05:58,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 02:05:58,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 02:05:58,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 02:05:58,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 02:05:58,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 02:05:58,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 02:05:58,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 02:05:58,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 02:05:58,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 02:05:58,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 02:05:58,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 02:05:58,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 02:05:58,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 02:05:58,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 02:05:58,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 02:05:58,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 02:05:58,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 02:05:58,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 02:05:58,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 02:05:58,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 02:05:58,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 02:05:58,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 02:05:58,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 02:05:58,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 02:05:58,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 02:05:58,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 02:05:58,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 02:05:58,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 02:05:58,975 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 02:05:58,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 02:05:58,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 02:05:58,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 02:05:58,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 02:05:58,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 02:05:58,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 02:05:58,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 02:05:58,978 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 02:05:58,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 02:05:58,979 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 02:05:58,979 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 02:05:58,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 02:05:58,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 02:05:58,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 02:05:58,979 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 02:05:58,979 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 02:05:58,979 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 02:05:58,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 02:05:58,980 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 02:05:58,980 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 02:05:58,980 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 02:05:58,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 02:05:58,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 02:05:58,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 02:05:58,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:05:58,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 02:05:58,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 02:05:58,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 02:05:58,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 02:05:58,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 02:05:58,981 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 02:05:58,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 02:05:58,982 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 02:05:58,982 INFO L138 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.graphml 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 -> f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 02:05:59,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 02:05:59,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 02:05:59,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 02:05:59,229 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 02:05:59,229 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 02:05:59,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-09-01 02:06:00,180 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 02:06:00,313 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 02:06:00,317 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-09-01 02:06:00,326 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2b3a61a/5b5bbc4a65ec4ac385c81a6180b9c2bd/FLAG807272a6c [2023-09-01 02:06:00,341 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2b3a61a/5b5bbc4a65ec4ac385c81a6180b9c2bd [2023-09-01 02:06:00,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 02:06:00,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 02:06:00,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 02:06:00,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 02:06:00,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 02:06:00,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4197e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00, skipping insertion in model container [2023-09-01 02:06:00,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 02:06:00,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 02:06:00,478 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2023-09-01 02:06:00,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:06:00,489 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 02:06:00,511 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2023-09-01 02:06:00,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:06:00,522 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 02:06:00,522 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 02:06:00,533 INFO L208 MainTranslator]: Completed translation [2023-09-01 02:06:00,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00 WrapperNode [2023-09-01 02:06:00,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 02:06:00,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 02:06:00,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 02:06:00,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 02:06:00,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,561 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 265 [2023-09-01 02:06:00,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 02:06:00,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 02:06:00,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 02:06:00,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 02:06:00,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,576 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 02:06:00,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 02:06:00,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 02:06:00,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 02:06:00,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (1/1) ... [2023-09-01 02:06:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:06:00,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:06:00,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 02:06:00,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 02:06:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 02:06:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 02:06:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 02:06:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 02:06:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 02:06:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 02:06:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 02:06:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 02:06:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 02:06:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 02:06:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 02:06:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 02:06:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 02:06:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 02:06:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 02:06:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 02:06:00,630 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 02:06:00,694 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 02:06:00,695 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 02:06:00,996 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 02:06:01,085 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 02:06:01,085 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 02:06:01,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:06:01 BoogieIcfgContainer [2023-09-01 02:06:01,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 02:06:01,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 02:06:01,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 02:06:01,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 02:06:01,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 02:06:00" (1/3) ... [2023-09-01 02:06:01,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e535a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:06:01, skipping insertion in model container [2023-09-01 02:06:01,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:06:00" (2/3) ... [2023-09-01 02:06:01,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e535a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:06:01, skipping insertion in model container [2023-09-01 02:06:01,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:06:01" (3/3) ... [2023-09-01 02:06:01,092 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-09-01 02:06:01,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 02:06:01,103 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-09-01 02:06:01,104 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 02:06:01,147 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-01 02:06:01,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 366 flow [2023-09-01 02:06:01,230 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-09-01 02:06:01,231 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:06:01,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 2/168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 158 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-09-01 02:06:01,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 366 flow [2023-09-01 02:06:01,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 164 transitions, 346 flow [2023-09-01 02:06:01,244 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 02:06:01,259 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 164 transitions, 346 flow [2023-09-01 02:06:01,264 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 164 transitions, 346 flow [2023-09-01 02:06:01,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 346 flow [2023-09-01 02:06:01,301 INFO L130 PetriNetUnfolder]: 2/164 cut-off events. [2023-09-01 02:06:01,301 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:06:01,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 164 events. 2/164 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 157 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-09-01 02:06:01,309 INFO L119 LiptonReduction]: Number of co-enabled transitions 2688 [2023-09-01 02:06:05,292 INFO L134 LiptonReduction]: Checked pairs total: 22362 [2023-09-01 02:06:05,292 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-09-01 02:06:05,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 02:06:05,305 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@70320e18, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 02:06:05,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-09-01 02:06:05,306 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 02:06:05,306 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 02:06:05,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:05,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 02:06:05,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:05,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:05,310 INFO L85 PathProgramCache]: Analyzing trace with hash 756, now seen corresponding path program 1 times [2023-09-01 02:06:05,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149305442] [2023-09-01 02:06:05,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:05,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:05,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:05,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149305442] [2023-09-01 02:06:05,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149305442] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:05,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:05,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 02:06:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527069946] [2023-09-01 02:06:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:05,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 02:06:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:05,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 02:06:05,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 02:06:05,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 297 [2023-09-01 02:06:05,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 142 flow. Second operand has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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) [2023-09-01 02:06:05,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:05,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 297 [2023-09-01 02:06:05,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:05,942 INFO L130 PetriNetUnfolder]: 3906/6589 cut-off events. [2023-09-01 02:06:05,942 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2023-09-01 02:06:05,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12494 conditions, 6589 events. 3906/6589 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 45651 event pairs, 3906 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 11254. Up to 5730 conditions per place. [2023-09-01 02:06:05,972 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 41 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-09-01 02:06:05,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 218 flow [2023-09-01 02:06:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 02:06:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 02:06:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 338 transitions. [2023-09-01 02:06:05,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.569023569023569 [2023-09-01 02:06:05,982 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 338 transitions. [2023-09-01 02:06:05,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 338 transitions. [2023-09-01 02:06:05,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:05,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 338 transitions. [2023-09-01 02:06:05,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.0) internal successors, (338), 2 states have internal predecessors, (338), 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) [2023-09-01 02:06:05,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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) [2023-09-01 02:06:05,990 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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) [2023-09-01 02:06:05,991 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 142 flow. Second operand 2 states and 338 transitions. [2023-09-01 02:06:05,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 218 flow [2023-09-01 02:06:05,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 206 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-09-01 02:06:05,998 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 124 flow [2023-09-01 02:06:05,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2023-09-01 02:06:06,001 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-09-01 02:06:06,001 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 124 flow [2023-09-01 02:06:06,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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) [2023-09-01 02:06:06,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:06,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 02:06:06,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 02:06:06,002 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:06,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 744639, now seen corresponding path program 1 times [2023-09-01 02:06:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:06,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351951083] [2023-09-01 02:06:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351951083] [2023-09-01 02:06:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351951083] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:06,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:06:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839112653] [2023-09-01 02:06:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:06,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:06:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:06,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:06:06,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:06:06,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-09-01 02:06:06,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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) [2023-09-01 02:06:06,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:06,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-09-01 02:06:06,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:06,780 INFO L130 PetriNetUnfolder]: 3816/6441 cut-off events. [2023-09-01 02:06:06,780 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-09-01 02:06:06,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12084 conditions, 6441 events. 3816/6441 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 44550 event pairs, 3816 based on Foata normal form. 0/5311 useless extension candidates. Maximal degree in co-relation 12081. Up to 5583 conditions per place. [2023-09-01 02:06:06,838 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 38 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-09-01 02:06:06,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 198 flow [2023-09-01 02:06:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-09-01 02:06:06,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072951739618407 [2023-09-01 02:06:06,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-09-01 02:06:06,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-09-01 02:06:06,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:06,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-09-01 02:06:06,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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) [2023-09-01 02:06:06,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:06,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:06,857 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 124 flow. Second operand 3 states and 452 transitions. [2023-09-01 02:06:06,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 198 flow [2023-09-01 02:06:06,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 02:06:06,859 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 122 flow [2023-09-01 02:06:06,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2023-09-01 02:06:06,860 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-09-01 02:06:06,860 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 122 flow [2023-09-01 02:06:06,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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) [2023-09-01 02:06:06,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:06,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 02:06:06,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 02:06:06,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:06,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash 744640, now seen corresponding path program 1 times [2023-09-01 02:06:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079567960] [2023-09-01 02:06:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:06,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:06,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079567960] [2023-09-01 02:06:06,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079567960] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:06,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:06,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:06:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683880389] [2023-09-01 02:06:06,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:06,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:06:06,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:06,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:06:06,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:06:06,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-09-01 02:06:06,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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) [2023-09-01 02:06:06,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:06,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-09-01 02:06:06,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:07,354 INFO L130 PetriNetUnfolder]: 3726/6293 cut-off events. [2023-09-01 02:06:07,354 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-09-01 02:06:07,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 6293 events. 3726/6293 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 43431 event pairs, 3726 based on Foata normal form. 0/5221 useless extension candidates. Maximal degree in co-relation 11788. Up to 5437 conditions per place. [2023-09-01 02:06:07,377 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 36 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-09-01 02:06:07,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 192 flow [2023-09-01 02:06:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-09-01 02:06:07,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218855218855218 [2023-09-01 02:06:07,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-09-01 02:06:07,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-09-01 02:06:07,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:07,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-09-01 02:06:07,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-09-01 02:06:07,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:07,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:07,382 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 122 flow. Second operand 3 states and 465 transitions. [2023-09-01 02:06:07,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 192 flow [2023-09-01 02:06:07,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:06:07,383 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 119 flow [2023-09-01 02:06:07,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-09-01 02:06:07,384 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-09-01 02:06:07,384 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 119 flow [2023-09-01 02:06:07,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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) [2023-09-01 02:06:07,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:07,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 02:06:07,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 02:06:07,385 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:07,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash 715619205, now seen corresponding path program 1 times [2023-09-01 02:06:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:07,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058593448] [2023-09-01 02:06:07,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:07,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:07,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058593448] [2023-09-01 02:06:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058593448] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:07,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:06:07,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880390370] [2023-09-01 02:06:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:07,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:06:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:06:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:06:07,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-09-01 02:06:07,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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) [2023-09-01 02:06:07,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:07,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-09-01 02:06:07,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:07,816 INFO L130 PetriNetUnfolder]: 3636/6125 cut-off events. [2023-09-01 02:06:07,817 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-09-01 02:06:07,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11479 conditions, 6125 events. 3636/6125 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 42220 event pairs, 3636 based on Foata normal form. 0/5120 useless extension candidates. Maximal degree in co-relation 11475. Up to 5291 conditions per place. [2023-09-01 02:06:07,839 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 34 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-09-01 02:06:07,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 185 flow [2023-09-01 02:06:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-09-01 02:06:07,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196408529741863 [2023-09-01 02:06:07,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-09-01 02:06:07,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-09-01 02:06:07,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:07,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-09-01 02:06:07,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2023-09-01 02:06:07,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:07,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:07,845 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 119 flow. Second operand 3 states and 463 transitions. [2023-09-01 02:06:07,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 185 flow [2023-09-01 02:06:07,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:06:07,846 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 116 flow [2023-09-01 02:06:07,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-09-01 02:06:07,847 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-09-01 02:06:07,847 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 116 flow [2023-09-01 02:06:07,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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) [2023-09-01 02:06:07,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:07,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 02:06:07,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 02:06:07,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:07,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash 715619204, now seen corresponding path program 1 times [2023-09-01 02:06:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:07,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303973255] [2023-09-01 02:06:07,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:07,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303973255] [2023-09-01 02:06:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303973255] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:07,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:07,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:06:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131666875] [2023-09-01 02:06:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:07,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:06:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:07,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:06:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:06:07,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-09-01 02:06:07,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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) [2023-09-01 02:06:07,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:07,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-09-01 02:06:07,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:08,305 INFO L130 PetriNetUnfolder]: 3546/5957 cut-off events. [2023-09-01 02:06:08,306 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-09-01 02:06:08,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11166 conditions, 5957 events. 3546/5957 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 40740 event pairs, 3546 based on Foata normal form. 0/5019 useless extension candidates. Maximal degree in co-relation 11162. Up to 5145 conditions per place. [2023-09-01 02:06:08,324 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 32 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-09-01 02:06:08,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 178 flow [2023-09-01 02:06:08,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-09-01 02:06:08,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500561167227834 [2023-09-01 02:06:08,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-09-01 02:06:08,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-09-01 02:06:08,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:08,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-09-01 02:06:08,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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) [2023-09-01 02:06:08,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:08,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:08,329 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 116 flow. Second operand 3 states and 446 transitions. [2023-09-01 02:06:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 178 flow [2023-09-01 02:06:08,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:06:08,330 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 113 flow [2023-09-01 02:06:08,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-09-01 02:06:08,331 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-09-01 02:06:08,331 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 113 flow [2023-09-01 02:06:08,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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) [2023-09-01 02:06:08,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:08,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:06:08,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 02:06:08,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:08,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:08,332 INFO L85 PathProgramCache]: Analyzing trace with hash 515305849, now seen corresponding path program 1 times [2023-09-01 02:06:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400207500] [2023-09-01 02:06:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:08,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:08,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400207500] [2023-09-01 02:06:08,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400207500] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:08,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:08,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 02:06:08,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490502667] [2023-09-01 02:06:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:08,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:06:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:06:08,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:06:08,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 297 [2023-09-01 02:06:08,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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) [2023-09-01 02:06:08,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:08,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 297 [2023-09-01 02:06:08,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:08,710 INFO L130 PetriNetUnfolder]: 2664/4554 cut-off events. [2023-09-01 02:06:08,711 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-09-01 02:06:08,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8539 conditions, 4554 events. 2664/4554 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 30375 event pairs, 2664 based on Foata normal form. 0/4018 useless extension candidates. Maximal degree in co-relation 8535. Up to 3920 conditions per place. [2023-09-01 02:06:08,730 INFO L137 encePairwiseOnDemand]: 295/297 looper letters, 31 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-09-01 02:06:08,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 175 flow [2023-09-01 02:06:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-09-01 02:06:08,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713804713804714 [2023-09-01 02:06:08,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-09-01 02:06:08,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-09-01 02:06:08,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:08,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-09-01 02:06:08,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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) [2023-09-01 02:06:08,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:08,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:08,735 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 113 flow. Second operand 3 states and 420 transitions. [2023-09-01 02:06:08,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 175 flow [2023-09-01 02:06:08,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 50 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:06:08,737 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-09-01 02:06:08,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-09-01 02:06:08,737 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-09-01 02:06:08,738 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-09-01 02:06:08,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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) [2023-09-01 02:06:08,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:08,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:06:08,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 02:06:08,739 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:08,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash 515305850, now seen corresponding path program 1 times [2023-09-01 02:06:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918115878] [2023-09-01 02:06:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:08,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:08,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918115878] [2023-09-01 02:06:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918115878] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:08,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:08,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:06:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12039735] [2023-09-01 02:06:08,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:08,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:06:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:06:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:06:08,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-09-01 02:06:08,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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) [2023-09-01 02:06:08,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:08,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-09-01 02:06:08,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:09,113 INFO L130 PetriNetUnfolder]: 1782/3151 cut-off events. [2023-09-01 02:06:09,113 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-09-01 02:06:09,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5912 conditions, 3151 events. 1782/3151 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 20223 event pairs, 1782 based on Foata normal form. 0/3017 useless extension candidates. Maximal degree in co-relation 5908. Up to 2695 conditions per place. [2023-09-01 02:06:09,125 INFO L137 encePairwiseOnDemand]: 295/297 looper letters, 30 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-09-01 02:06:09,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 49 transitions, 172 flow [2023-09-01 02:06:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-09-01 02:06:09,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140291806958474 [2023-09-01 02:06:09,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-09-01 02:06:09,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-09-01 02:06:09,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:09,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-09-01 02:06:09,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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) [2023-09-01 02:06:09,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:09,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:09,130 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 458 transitions. [2023-09-01 02:06:09,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 49 transitions, 172 flow [2023-09-01 02:06:09,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:06:09,131 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 111 flow [2023-09-01 02:06:09,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-09-01 02:06:09,132 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-09-01 02:06:09,132 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 111 flow [2023-09-01 02:06:09,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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) [2023-09-01 02:06:09,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:09,132 INFO L208 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] [2023-09-01 02:06:09,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 02:06:09,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:09,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1851685884, now seen corresponding path program 1 times [2023-09-01 02:06:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073298707] [2023-09-01 02:06:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073298707] [2023-09-01 02:06:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073298707] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:06:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498647562] [2023-09-01 02:06:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:09,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:06:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:06:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:06:09,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:06:09,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 111 flow. Second operand has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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) [2023-09-01 02:06:09,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:09,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:06:09,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:10,152 INFO L130 PetriNetUnfolder]: 4870/7530 cut-off events. [2023-09-01 02:06:10,152 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-09-01 02:06:10,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15125 conditions, 7530 events. 4870/7530 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 44660 event pairs, 1571 based on Foata normal form. 1/7463 useless extension candidates. Maximal degree in co-relation 15121. Up to 2087 conditions per place. [2023-09-01 02:06:10,177 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 157 selfloop transitions, 15 changer transitions 25/209 dead transitions. [2023-09-01 02:06:10,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 209 transitions, 851 flow [2023-09-01 02:06:10,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 02:06:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 02:06:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1661 transitions. [2023-09-01 02:06:10,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084175084175084 [2023-09-01 02:06:10,180 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1661 transitions. [2023-09-01 02:06:10,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1661 transitions. [2023-09-01 02:06:10,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:10,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1661 transitions. [2023-09-01 02:06:10,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 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) [2023-09-01 02:06:10,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:06:10,186 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:06:10,187 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 111 flow. Second operand 11 states and 1661 transitions. [2023-09-01 02:06:10,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 209 transitions, 851 flow [2023-09-01 02:06:10,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 209 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:06:10,189 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 202 flow [2023-09-01 02:06:10,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=202, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2023-09-01 02:06:10,190 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2023-09-01 02:06:10,190 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 202 flow [2023-09-01 02:06:10,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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) [2023-09-01 02:06:10,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:10,190 INFO L208 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] [2023-09-01 02:06:10,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 02:06:10,191 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:10,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash -954322370, now seen corresponding path program 2 times [2023-09-01 02:06:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735805337] [2023-09-01 02:06:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:10,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:10,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:10,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735805337] [2023-09-01 02:06:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735805337] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:06:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198061117] [2023-09-01 02:06:10,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:10,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:06:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:10,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:06:10,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:06:10,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:06:10,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-09-01 02:06:10,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:10,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:06:10,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:11,545 INFO L130 PetriNetUnfolder]: 4848/8600 cut-off events. [2023-09-01 02:06:11,545 INFO L131 PetriNetUnfolder]: For 223/225 co-relation queries the response was YES. [2023-09-01 02:06:11,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17256 conditions, 8600 events. 4848/8600 cut-off events. For 223/225 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 61600 event pairs, 423 based on Foata normal form. 104/8580 useless extension candidates. Maximal degree in co-relation 17248. Up to 4518 conditions per place. [2023-09-01 02:06:11,587 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 114 selfloop transitions, 18 changer transitions 0/161 dead transitions. [2023-09-01 02:06:11,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 161 transitions, 669 flow [2023-09-01 02:06:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:06:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:06:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1332 transitions. [2023-09-01 02:06:11,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2023-09-01 02:06:11,590 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1332 transitions. [2023-09-01 02:06:11,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1332 transitions. [2023-09-01 02:06:11,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:11,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1332 transitions. [2023-09-01 02:06:11,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 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) [2023-09-01 02:06:11,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:11,596 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:11,596 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 202 flow. Second operand 9 states and 1332 transitions. [2023-09-01 02:06:11,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 161 transitions, 669 flow [2023-09-01 02:06:11,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 161 transitions, 665 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-09-01 02:06:11,601 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 313 flow [2023-09-01 02:06:11,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=313, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2023-09-01 02:06:11,602 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2023-09-01 02:06:11,602 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 313 flow [2023-09-01 02:06:11,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-09-01 02:06:11,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:11,603 INFO L208 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] [2023-09-01 02:06:11,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 02:06:11,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:11,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash 40937618, now seen corresponding path program 3 times [2023-09-01 02:06:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:11,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588972352] [2023-09-01 02:06:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:11,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588972352] [2023-09-01 02:06:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588972352] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:11,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 02:06:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458496699] [2023-09-01 02:06:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:11,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:06:11,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:11,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:06:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:06:11,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-09-01 02:06:11,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-09-01 02:06:11,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:11,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-09-01 02:06:11,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:12,201 INFO L130 PetriNetUnfolder]: 3834/7344 cut-off events. [2023-09-01 02:06:12,201 INFO L131 PetriNetUnfolder]: For 3876/3990 co-relation queries the response was YES. [2023-09-01 02:06:12,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17192 conditions, 7344 events. 3834/7344 cut-off events. For 3876/3990 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 55082 event pairs, 2857 based on Foata normal form. 100/7154 useless extension candidates. Maximal degree in co-relation 17177. Up to 5237 conditions per place. [2023-09-01 02:06:12,237 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 56 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-09-01 02:06:12,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 96 transitions, 478 flow [2023-09-01 02:06:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-09-01 02:06:12,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-09-01 02:06:12,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-09-01 02:06:12,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-09-01 02:06:12,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:12,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-09-01 02:06:12,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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) [2023-09-01 02:06:12,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:12,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:12,241 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 313 flow. Second operand 3 states and 479 transitions. [2023-09-01 02:06:12,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 96 transitions, 478 flow [2023-09-01 02:06:12,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 96 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 02:06:12,251 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 323 flow [2023-09-01 02:06:12,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2023-09-01 02:06:12,251 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 17 predicate places. [2023-09-01 02:06:12,251 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 323 flow [2023-09-01 02:06:12,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-09-01 02:06:12,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:12,252 INFO L208 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] [2023-09-01 02:06:12,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 02:06:12,252 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:12,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:12,253 INFO L85 PathProgramCache]: Analyzing trace with hash 466293516, now seen corresponding path program 4 times [2023-09-01 02:06:12,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:12,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299571249] [2023-09-01 02:06:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:12,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:12,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:12,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299571249] [2023-09-01 02:06:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299571249] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:12,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:06:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166779596] [2023-09-01 02:06:12,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:12,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:06:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:06:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:06:12,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:06:12,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 323 flow. Second operand has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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) [2023-09-01 02:06:12,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:12,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:06:12,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:13,724 INFO L130 PetriNetUnfolder]: 7739/13885 cut-off events. [2023-09-01 02:06:13,724 INFO L131 PetriNetUnfolder]: For 7098/7250 co-relation queries the response was YES. [2023-09-01 02:06:13,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33915 conditions, 13885 events. 7739/13885 cut-off events. For 7098/7250 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 104688 event pairs, 2488 based on Foata normal form. 146/13830 useless extension candidates. Maximal degree in co-relation 33898. Up to 8163 conditions per place. [2023-09-01 02:06:13,783 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 140 selfloop transitions, 36 changer transitions 2/206 dead transitions. [2023-09-01 02:06:13,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 206 transitions, 1075 flow [2023-09-01 02:06:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:06:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:06:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1347 transitions. [2023-09-01 02:06:13,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5039281705948373 [2023-09-01 02:06:13,786 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1347 transitions. [2023-09-01 02:06:13,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1347 transitions. [2023-09-01 02:06:13,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:13,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1347 transitions. [2023-09-01 02:06:13,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.66666666666666) internal successors, (1347), 9 states have internal predecessors, (1347), 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) [2023-09-01 02:06:13,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:13,792 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:13,792 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 323 flow. Second operand 9 states and 1347 transitions. [2023-09-01 02:06:13,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 206 transitions, 1075 flow [2023-09-01 02:06:13,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 206 transitions, 1071 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 02:06:13,806 INFO L231 Difference]: Finished difference. Result has 102 places, 117 transitions, 632 flow [2023-09-01 02:06:13,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=632, PETRI_PLACES=102, PETRI_TRANSITIONS=117} [2023-09-01 02:06:13,807 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 30 predicate places. [2023-09-01 02:06:13,807 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 117 transitions, 632 flow [2023-09-01 02:06:13,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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) [2023-09-01 02:06:13,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:13,808 INFO L208 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] [2023-09-01 02:06:13,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 02:06:13,808 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:13,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1452945116, now seen corresponding path program 5 times [2023-09-01 02:06:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:13,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360753703] [2023-09-01 02:06:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:14,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360753703] [2023-09-01 02:06:14,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360753703] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:14,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:14,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:06:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225281735] [2023-09-01 02:06:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:14,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:06:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:06:14,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:06:14,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:06:14,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 117 transitions, 632 flow. Second operand has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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) [2023-09-01 02:06:14,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:14,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:06:14,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:14,623 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 174#L139true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,623 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 02:06:14,623 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 02:06:14,624 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 02:06:14,624 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 02:06:14,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,696 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-09-01 02:06:14,696 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 02:06:14,696 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 02:06:14,696 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 02:06:14,697 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 174#L139true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,698 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-09-01 02:06:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 02:06:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 02:06:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 02:06:14,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,698 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 153#L149true, 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,779 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,779 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,779 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,779 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,780 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,780 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,780 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,780 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,780 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,780 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 02:06:14,781 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,781 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,782 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,782 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,782 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 153#L149true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,806 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,806 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,806 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,806 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,848 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,848 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,848 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,848 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,848 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,849 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 153#L149true, 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,849 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,849 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,849 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,849 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,849 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,849 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 25#L146true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,849 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,850 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,850 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,850 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,850 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 02:06:14,874 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 153#L149true, 167#L192-1true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,874 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,874 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,874 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,874 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,874 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,874 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,874 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,875 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,875 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,917 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,917 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,918 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 153#L149true, 239#true, 167#L192-1true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,918 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,919 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,919 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,919 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 02:06:14,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,942 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,942 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,985 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,985 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,985 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,986 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 27#L152true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:14,986 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,986 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,986 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,986 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:14,986 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 02:06:15,003 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,003 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,003 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,004 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,004 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,004 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,004 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,004 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,004 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,004 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,052 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][97], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 290#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 57#L155true, 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,052 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,053 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,053 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,054 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,054 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,054 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), 156#L162true, Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,054 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,054 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,054 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,054 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,054 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 95#thread1EXITtrue, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), 135#L191-1true, Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,055 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,055 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,055 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,055 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 02:06:15,056 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,056 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,056 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,056 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,056 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,072 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,072 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,072 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,072 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,072 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), 156#L162true, Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,073 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,073 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,073 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,073 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,121 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][185], [Black: 258#(= ~e1~0 1), 292#(and (<= 1 ~i~0) (<= 1 ~i3~0) (<= ~i3~0 1) (= ~i1~0 0) (<= ~i~0 1)), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 149#L159true, Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,122 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,122 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,122 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,122 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,122 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,122 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), 156#L162true, Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,122 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,122 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,123 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,123 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,123 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,123 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 91#L191-2true, 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,123 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,123 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,123 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,123 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,123 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 02:06:15,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,124 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,124 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,124 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,125 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,138 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), 156#L162true, Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,139 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,139 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,139 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,139 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,178 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([567] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#t~post2#1][196], [Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 239#true, 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), 156#L162true, Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 39#L96true, 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 241#(= ~n3~0 0), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,179 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,179 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,179 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,179 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,179 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,179 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([668] L162-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~n3~0_53 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, ~n3~0=v_~n3~0_53, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, ~n3~0, thread3Thread1of1ForFork1_#res#1.base][198], [114#thread3EXITtrue, Black: 258#(= ~e1~0 1), 187#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 209#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 167#L192-1true, Black: 265#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 268#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (= ~n1~0 0)), 214#(= ~i1~0 0), Black: 269#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 266#(and (<= 1 ~n2~0) (= ~n1~0 0)), Black: 267#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (= ~n1~0 0)), Black: 263#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 264#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 261#true, 205#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 191#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 227#(and (<= ~i~0 2) (= ~i1~0 0) (<= ~i2~0 1) (<= 1 ~i2~0) (<= 2 ~i~0)), 117#L93true, Black: 213#(= ~i~0 0), Black: 223#(and (<= 1 ~i~0) (= ~i1~0 0) (<= ~i~0 1)), 182#true, 195#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 241#(= ~n3~0 0), 199#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 294#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (= ~i1~0 0) (<= 2 ~i~0)), Black: 247#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n3~0 0)), Black: 242#(and (<= 0 ~n1~0) (= ~n3~0 0)), Black: 244#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 245#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (= ~n3~0 0)), Black: 246#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (= ~n1~0 ~n3~0))]) [2023-09-01 02:06:15,179 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,179 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,180 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,180 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,180 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 02:06:15,629 INFO L130 PetriNetUnfolder]: 10885/17775 cut-off events. [2023-09-01 02:06:15,629 INFO L131 PetriNetUnfolder]: For 20796/21515 co-relation queries the response was YES. [2023-09-01 02:06:15,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53162 conditions, 17775 events. 10885/17775 cut-off events. For 20796/21515 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 124870 event pairs, 3956 based on Foata normal form. 294/17516 useless extension candidates. Maximal degree in co-relation 53138. Up to 4721 conditions per place. [2023-09-01 02:06:15,726 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 235 selfloop transitions, 21 changer transitions 34/323 dead transitions. [2023-09-01 02:06:15,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 323 transitions, 2158 flow [2023-09-01 02:06:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 02:06:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 02:06:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1657 transitions. [2023-09-01 02:06:15,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071931435567799 [2023-09-01 02:06:15,730 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1657 transitions. [2023-09-01 02:06:15,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1657 transitions. [2023-09-01 02:06:15,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:15,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1657 transitions. [2023-09-01 02:06:15,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 150.63636363636363) internal successors, (1657), 11 states have internal predecessors, (1657), 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) [2023-09-01 02:06:15,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:06:15,736 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:06:15,736 INFO L175 Difference]: Start difference. First operand has 102 places, 117 transitions, 632 flow. Second operand 11 states and 1657 transitions. [2023-09-01 02:06:15,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 323 transitions, 2158 flow [2023-09-01 02:06:15,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 323 transitions, 2112 flow, removed 23 selfloop flow, removed 0 redundant places. [2023-09-01 02:06:15,799 INFO L231 Difference]: Finished difference. Result has 117 places, 126 transitions, 730 flow [2023-09-01 02:06:15,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=730, PETRI_PLACES=117, PETRI_TRANSITIONS=126} [2023-09-01 02:06:15,800 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 45 predicate places. [2023-09-01 02:06:15,800 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 126 transitions, 730 flow [2023-09-01 02:06:15,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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) [2023-09-01 02:06:15,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:15,801 INFO L208 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] [2023-09-01 02:06:15,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 02:06:15,801 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:15,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash 790282874, now seen corresponding path program 6 times [2023-09-01 02:06:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679959615] [2023-09-01 02:06:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679959615] [2023-09-01 02:06:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679959615] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:15,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:15,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 02:06:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52341995] [2023-09-01 02:06:15,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:15,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:06:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:15,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:06:15,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:06:15,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-09-01 02:06:15,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 126 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-09-01 02:06:15,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:15,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-09-01 02:06:15,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:16,926 INFO L130 PetriNetUnfolder]: 6770/12920 cut-off events. [2023-09-01 02:06:16,926 INFO L131 PetriNetUnfolder]: For 17034/17651 co-relation queries the response was YES. [2023-09-01 02:06:16,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37662 conditions, 12920 events. 6770/12920 cut-off events. For 17034/17651 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 104058 event pairs, 4513 based on Foata normal form. 282/12558 useless extension candidates. Maximal degree in co-relation 37632. Up to 8836 conditions per place. [2023-09-01 02:06:16,991 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 96 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2023-09-01 02:06:16,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 160 transitions, 1113 flow [2023-09-01 02:06:16,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-09-01 02:06:16,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-09-01 02:06:16,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-09-01 02:06:16,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-09-01 02:06:16,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:16,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-09-01 02:06:16,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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) [2023-09-01 02:06:16,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:16,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:16,996 INFO L175 Difference]: Start difference. First operand has 117 places, 126 transitions, 730 flow. Second operand 3 states and 479 transitions. [2023-09-01 02:06:16,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 160 transitions, 1113 flow [2023-09-01 02:06:17,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 160 transitions, 1096 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-09-01 02:06:17,043 INFO L231 Difference]: Finished difference. Result has 113 places, 126 transitions, 723 flow [2023-09-01 02:06:17,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=113, PETRI_TRANSITIONS=126} [2023-09-01 02:06:17,044 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 41 predicate places. [2023-09-01 02:06:17,044 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 723 flow [2023-09-01 02:06:17,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-09-01 02:06:17,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:17,045 INFO L208 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] [2023-09-01 02:06:17,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 02:06:17,045 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:17,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash -158141900, now seen corresponding path program 7 times [2023-09-01 02:06:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755688232] [2023-09-01 02:06:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:17,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:17,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755688232] [2023-09-01 02:06:17,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755688232] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:17,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:17,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:06:17,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522998010] [2023-09-01 02:06:17,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:17,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:06:17,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:06:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:06:17,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:06:17,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 126 transitions, 723 flow. Second operand has 8 states, 8 states have (on average 136.625) internal successors, (1093), 8 states have internal predecessors, (1093), 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) [2023-09-01 02:06:17,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:17,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:06:17,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:19,079 INFO L130 PetriNetUnfolder]: 9578/17477 cut-off events. [2023-09-01 02:06:19,079 INFO L131 PetriNetUnfolder]: For 22147/22664 co-relation queries the response was YES. [2023-09-01 02:06:19,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52557 conditions, 17477 events. 9578/17477 cut-off events. For 22147/22664 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 138366 event pairs, 3733 based on Foata normal form. 272/17434 useless extension candidates. Maximal degree in co-relation 52528. Up to 9263 conditions per place. [2023-09-01 02:06:19,208 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 142 selfloop transitions, 45 changer transitions 0/224 dead transitions. [2023-09-01 02:06:19,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 224 transitions, 1499 flow [2023-09-01 02:06:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:06:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:06:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1205 transitions. [2023-09-01 02:06:19,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071548821548821 [2023-09-01 02:06:19,214 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1205 transitions. [2023-09-01 02:06:19,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1205 transitions. [2023-09-01 02:06:19,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:19,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1205 transitions. [2023-09-01 02:06:19,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.625) internal successors, (1205), 8 states have internal predecessors, (1205), 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) [2023-09-01 02:06:19,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:06:19,235 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:06:19,235 INFO L175 Difference]: Start difference. First operand has 113 places, 126 transitions, 723 flow. Second operand 8 states and 1205 transitions. [2023-09-01 02:06:19,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 224 transitions, 1499 flow [2023-09-01 02:06:19,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 224 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 02:06:19,321 INFO L231 Difference]: Finished difference. Result has 122 places, 140 transitions, 973 flow [2023-09-01 02:06:19,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=973, PETRI_PLACES=122, PETRI_TRANSITIONS=140} [2023-09-01 02:06:19,321 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 50 predicate places. [2023-09-01 02:06:19,321 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 140 transitions, 973 flow [2023-09-01 02:06:19,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 136.625) internal successors, (1093), 8 states have internal predecessors, (1093), 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) [2023-09-01 02:06:19,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:19,322 INFO L208 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] [2023-09-01 02:06:19,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 02:06:19,322 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:19,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:19,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1903921250, now seen corresponding path program 8 times [2023-09-01 02:06:19,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:19,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884907183] [2023-09-01 02:06:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:19,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:19,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884907183] [2023-09-01 02:06:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884907183] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:19,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:19,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 02:06:19,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235747099] [2023-09-01 02:06:19,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:19,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:06:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:19,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:06:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:06:19,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:06:19,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 140 transitions, 973 flow. Second operand has 7 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 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) [2023-09-01 02:06:19,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:19,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:06:19,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:21,210 INFO L130 PetriNetUnfolder]: 10061/18211 cut-off events. [2023-09-01 02:06:21,210 INFO L131 PetriNetUnfolder]: For 37976/38844 co-relation queries the response was YES. [2023-09-01 02:06:21,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59147 conditions, 18211 events. 10061/18211 cut-off events. For 37976/38844 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 145005 event pairs, 4915 based on Foata normal form. 332/18029 useless extension candidates. Maximal degree in co-relation 59114. Up to 13317 conditions per place. [2023-09-01 02:06:21,323 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 135 selfloop transitions, 31 changer transitions 0/206 dead transitions. [2023-09-01 02:06:21,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 206 transitions, 1607 flow [2023-09-01 02:06:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:06:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:06:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1045 transitions. [2023-09-01 02:06:21,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026455026455027 [2023-09-01 02:06:21,326 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1045 transitions. [2023-09-01 02:06:21,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1045 transitions. [2023-09-01 02:06:21,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:21,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1045 transitions. [2023-09-01 02:06:21,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.28571428571428) internal successors, (1045), 7 states have internal predecessors, (1045), 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) [2023-09-01 02:06:21,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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) [2023-09-01 02:06:21,330 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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) [2023-09-01 02:06:21,330 INFO L175 Difference]: Start difference. First operand has 122 places, 140 transitions, 973 flow. Second operand 7 states and 1045 transitions. [2023-09-01 02:06:21,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 206 transitions, 1607 flow [2023-09-01 02:06:21,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 206 transitions, 1547 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-09-01 02:06:21,437 INFO L231 Difference]: Finished difference. Result has 129 places, 153 transitions, 1164 flow [2023-09-01 02:06:21,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1164, PETRI_PLACES=129, PETRI_TRANSITIONS=153} [2023-09-01 02:06:21,437 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 57 predicate places. [2023-09-01 02:06:21,438 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 153 transitions, 1164 flow [2023-09-01 02:06:21,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 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) [2023-09-01 02:06:21,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:21,438 INFO L208 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] [2023-09-01 02:06:21,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 02:06:21,438 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:21,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2062195802, now seen corresponding path program 9 times [2023-09-01 02:06:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103775144] [2023-09-01 02:06:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:21,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103775144] [2023-09-01 02:06:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103775144] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:21,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:21,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 02:06:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696006824] [2023-09-01 02:06:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:21,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:06:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:21,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:06:21,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:06:21,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:06:21,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 153 transitions, 1164 flow. Second operand has 7 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 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) [2023-09-01 02:06:21,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:21,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:06:21,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:23,567 INFO L130 PetriNetUnfolder]: 11000/20023 cut-off events. [2023-09-01 02:06:23,568 INFO L131 PetriNetUnfolder]: For 49028/50172 co-relation queries the response was YES. [2023-09-01 02:06:23,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68035 conditions, 20023 events. 11000/20023 cut-off events. For 49028/50172 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 162034 event pairs, 5009 based on Foata normal form. 398/19882 useless extension candidates. Maximal degree in co-relation 67998. Up to 15179 conditions per place. [2023-09-01 02:06:23,677 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 155 selfloop transitions, 37 changer transitions 0/236 dead transitions. [2023-09-01 02:06:23,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 236 transitions, 2015 flow [2023-09-01 02:06:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:06:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:06:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1044 transitions. [2023-09-01 02:06:23,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021645021645021 [2023-09-01 02:06:23,680 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1044 transitions. [2023-09-01 02:06:23,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1044 transitions. [2023-09-01 02:06:23,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:23,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1044 transitions. [2023-09-01 02:06:23,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.14285714285714) internal successors, (1044), 7 states have internal predecessors, (1044), 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) [2023-09-01 02:06:23,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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) [2023-09-01 02:06:23,684 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 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) [2023-09-01 02:06:23,684 INFO L175 Difference]: Start difference. First operand has 129 places, 153 transitions, 1164 flow. Second operand 7 states and 1044 transitions. [2023-09-01 02:06:23,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 236 transitions, 2015 flow [2023-09-01 02:06:23,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1983 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-09-01 02:06:23,832 INFO L231 Difference]: Finished difference. Result has 140 places, 184 transitions, 1580 flow [2023-09-01 02:06:23,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1580, PETRI_PLACES=140, PETRI_TRANSITIONS=184} [2023-09-01 02:06:23,834 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 68 predicate places. [2023-09-01 02:06:23,834 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 184 transitions, 1580 flow [2023-09-01 02:06:23,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 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) [2023-09-01 02:06:23,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:23,834 INFO L208 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] [2023-09-01 02:06:23,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 02:06:23,835 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:23,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash 261740224, now seen corresponding path program 10 times [2023-09-01 02:06:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:23,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605989947] [2023-09-01 02:06:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:23,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605989947] [2023-09-01 02:06:23,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605989947] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:23,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:23,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 02:06:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853424334] [2023-09-01 02:06:23,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:23,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:06:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:23,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:06:23,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:06:23,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-09-01 02:06:23,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 184 transitions, 1580 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-09-01 02:06:23,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:23,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-09-01 02:06:23,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:25,500 INFO L130 PetriNetUnfolder]: 9682/18109 cut-off events. [2023-09-01 02:06:25,500 INFO L131 PetriNetUnfolder]: For 59966/61640 co-relation queries the response was YES. [2023-09-01 02:06:25,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64912 conditions, 18109 events. 9682/18109 cut-off events. For 59966/61640 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 150111 event pairs, 6551 based on Foata normal form. 596/17885 useless extension candidates. Maximal degree in co-relation 64869. Up to 12453 conditions per place. [2023-09-01 02:06:25,652 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 147 selfloop transitions, 2 changer transitions 1/228 dead transitions. [2023-09-01 02:06:25,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 228 transitions, 2242 flow [2023-09-01 02:06:25,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:06:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:06:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-09-01 02:06:25,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-09-01 02:06:25,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-09-01 02:06:25,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-09-01 02:06:25,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:25,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-09-01 02:06:25,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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) [2023-09-01 02:06:25,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:25,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 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) [2023-09-01 02:06:25,656 INFO L175 Difference]: Start difference. First operand has 140 places, 184 transitions, 1580 flow. Second operand 3 states and 479 transitions. [2023-09-01 02:06:25,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 228 transitions, 2242 flow [2023-09-01 02:06:25,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 228 transitions, 2168 flow, removed 37 selfloop flow, removed 0 redundant places. [2023-09-01 02:06:25,833 INFO L231 Difference]: Finished difference. Result has 143 places, 181 transitions, 1493 flow [2023-09-01 02:06:25,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1493, PETRI_PLACES=143, PETRI_TRANSITIONS=181} [2023-09-01 02:06:25,833 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 71 predicate places. [2023-09-01 02:06:25,834 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 181 transitions, 1493 flow [2023-09-01 02:06:25,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-09-01 02:06:25,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:25,834 INFO L208 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] [2023-09-01 02:06:25,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 02:06:25,834 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:25,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1778272718, now seen corresponding path program 11 times [2023-09-01 02:06:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:25,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987672181] [2023-09-01 02:06:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987672181] [2023-09-01 02:06:26,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987672181] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:26,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:26,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:06:26,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140114943] [2023-09-01 02:06:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:26,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:06:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:26,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:06:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:06:26,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:06:26,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 181 transitions, 1493 flow. Second operand has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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) [2023-09-01 02:06:26,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:26,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:06:26,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:28,368 INFO L130 PetriNetUnfolder]: 12990/24156 cut-off events. [2023-09-01 02:06:28,368 INFO L131 PetriNetUnfolder]: For 74618/76037 co-relation queries the response was YES. [2023-09-01 02:06:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87999 conditions, 24156 events. 12990/24156 cut-off events. For 74618/76037 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 207370 event pairs, 5219 based on Foata normal form. 266/23969 useless extension candidates. Maximal degree in co-relation 87954. Up to 14167 conditions per place. [2023-09-01 02:06:28,599 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 188 selfloop transitions, 58 changer transitions 11/308 dead transitions. [2023-09-01 02:06:28,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 308 transitions, 2759 flow [2023-09-01 02:06:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:06:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:06:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1342 transitions. [2023-09-01 02:06:28,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020576131687243 [2023-09-01 02:06:28,602 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1342 transitions. [2023-09-01 02:06:28,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1342 transitions. [2023-09-01 02:06:28,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:28,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1342 transitions. [2023-09-01 02:06:28,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.11111111111111) internal successors, (1342), 9 states have internal predecessors, (1342), 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) [2023-09-01 02:06:28,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:28,607 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:28,607 INFO L175 Difference]: Start difference. First operand has 143 places, 181 transitions, 1493 flow. Second operand 9 states and 1342 transitions. [2023-09-01 02:06:28,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 308 transitions, 2759 flow [2023-09-01 02:06:28,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 308 transitions, 2755 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 02:06:28,832 INFO L231 Difference]: Finished difference. Result has 155 places, 219 transitions, 2066 flow [2023-09-01 02:06:28,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2066, PETRI_PLACES=155, PETRI_TRANSITIONS=219} [2023-09-01 02:06:28,832 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 83 predicate places. [2023-09-01 02:06:28,832 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 219 transitions, 2066 flow [2023-09-01 02:06:28,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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) [2023-09-01 02:06:28,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:28,833 INFO L208 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] [2023-09-01 02:06:28,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 02:06:28,833 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:28,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -279244148, now seen corresponding path program 12 times [2023-09-01 02:06:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:28,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922552008] [2023-09-01 02:06:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922552008] [2023-09-01 02:06:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922552008] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:29,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:06:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792012394] [2023-09-01 02:06:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:29,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:06:29,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:29,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:06:29,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:06:29,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:06:29,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 219 transitions, 2066 flow. Second operand has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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) [2023-09-01 02:06:29,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:29,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:06:29,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:32,449 INFO L130 PetriNetUnfolder]: 15865/29258 cut-off events. [2023-09-01 02:06:32,449 INFO L131 PetriNetUnfolder]: For 117945/119327 co-relation queries the response was YES. [2023-09-01 02:06:32,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114912 conditions, 29258 events. 15865/29258 cut-off events. For 117945/119327 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 253832 event pairs, 6407 based on Foata normal form. 650/29482 useless extension candidates. Maximal degree in co-relation 114861. Up to 17612 conditions per place. [2023-09-01 02:06:32,870 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 240 selfloop transitions, 90 changer transitions 1/368 dead transitions. [2023-09-01 02:06:32,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 368 transitions, 3750 flow [2023-09-01 02:06:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 02:06:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 02:06:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1634 transitions. [2023-09-01 02:06:32,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5001530456075911 [2023-09-01 02:06:32,874 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1634 transitions. [2023-09-01 02:06:32,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1634 transitions. [2023-09-01 02:06:32,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:32,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1634 transitions. [2023-09-01 02:06:32,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 148.54545454545453) internal successors, (1634), 11 states have internal predecessors, (1634), 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) [2023-09-01 02:06:32,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:06:32,880 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:06:32,880 INFO L175 Difference]: Start difference. First operand has 155 places, 219 transitions, 2066 flow. Second operand 11 states and 1634 transitions. [2023-09-01 02:06:32,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 368 transitions, 3750 flow [2023-09-01 02:06:33,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 368 transitions, 3608 flow, removed 71 selfloop flow, removed 0 redundant places. [2023-09-01 02:06:33,219 INFO L231 Difference]: Finished difference. Result has 174 places, 263 transitions, 2830 flow [2023-09-01 02:06:33,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2830, PETRI_PLACES=174, PETRI_TRANSITIONS=263} [2023-09-01 02:06:33,219 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 102 predicate places. [2023-09-01 02:06:33,219 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 263 transitions, 2830 flow [2023-09-01 02:06:33,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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) [2023-09-01 02:06:33,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:33,220 INFO L208 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] [2023-09-01 02:06:33,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-09-01 02:06:33,220 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:33,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1227370186, now seen corresponding path program 13 times [2023-09-01 02:06:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390616831] [2023-09-01 02:06:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390616831] [2023-09-01 02:06:33,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390616831] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:33,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:33,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-01 02:06:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436201887] [2023-09-01 02:06:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:33,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:06:33,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:33,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:06:33,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:06:33,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-09-01 02:06:33,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 263 transitions, 2830 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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) [2023-09-01 02:06:33,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:33,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-09-01 02:06:33,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:37,263 INFO L130 PetriNetUnfolder]: 14729/27266 cut-off events. [2023-09-01 02:06:37,263 INFO L131 PetriNetUnfolder]: For 154713/157847 co-relation queries the response was YES. [2023-09-01 02:06:37,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116811 conditions, 27266 events. 14729/27266 cut-off events. For 154713/157847 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 237448 event pairs, 6975 based on Foata normal form. 424/26703 useless extension candidates. Maximal degree in co-relation 116750. Up to 21259 conditions per place. [2023-09-01 02:06:37,464 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 230 selfloop transitions, 37 changer transitions 22/363 dead transitions. [2023-09-01 02:06:37,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 363 transitions, 4060 flow [2023-09-01 02:06:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:06:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:06:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1353 transitions. [2023-09-01 02:06:37,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2023-09-01 02:06:37,465 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1353 transitions. [2023-09-01 02:06:37,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1353 transitions. [2023-09-01 02:06:37,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:37,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1353 transitions. [2023-09-01 02:06:37,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.33333333333334) internal successors, (1353), 9 states have internal predecessors, (1353), 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) [2023-09-01 02:06:37,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:37,470 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:37,470 INFO L175 Difference]: Start difference. First operand has 174 places, 263 transitions, 2830 flow. Second operand 9 states and 1353 transitions. [2023-09-01 02:06:37,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 363 transitions, 4060 flow [2023-09-01 02:06:38,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 363 transitions, 3838 flow, removed 111 selfloop flow, removed 0 redundant places. [2023-09-01 02:06:38,035 INFO L231 Difference]: Finished difference. Result has 187 places, 280 transitions, 2982 flow [2023-09-01 02:06:38,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2982, PETRI_PLACES=187, PETRI_TRANSITIONS=280} [2023-09-01 02:06:38,036 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 115 predicate places. [2023-09-01 02:06:38,036 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 280 transitions, 2982 flow [2023-09-01 02:06:38,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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) [2023-09-01 02:06:38,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:38,036 INFO L208 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] [2023-09-01 02:06:38,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-09-01 02:06:38,037 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:38,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash 889321604, now seen corresponding path program 14 times [2023-09-01 02:06:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:38,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602925455] [2023-09-01 02:06:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602925455] [2023-09-01 02:06:38,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602925455] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:38,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:06:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496655855] [2023-09-01 02:06:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:38,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:06:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:06:38,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:06:38,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-09-01 02:06:38,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 280 transitions, 2982 flow. Second operand has 9 states, 9 states have (on average 138.88888888888889) internal successors, (1250), 9 states have internal predecessors, (1250), 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) [2023-09-01 02:06:38,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:38,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-09-01 02:06:38,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:43,067 INFO L130 PetriNetUnfolder]: 18263/34098 cut-off events. [2023-09-01 02:06:43,068 INFO L131 PetriNetUnfolder]: For 206591/210256 co-relation queries the response was YES. [2023-09-01 02:06:43,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146060 conditions, 34098 events. 18263/34098 cut-off events. For 206591/210256 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 308201 event pairs, 7321 based on Foata normal form. 920/34133 useless extension candidates. Maximal degree in co-relation 145993. Up to 14419 conditions per place. [2023-09-01 02:06:43,357 INFO L137 encePairwiseOnDemand]: 288/297 looper letters, 249 selfloop transitions, 81 changer transitions 17/417 dead transitions. [2023-09-01 02:06:43,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 417 transitions, 4700 flow [2023-09-01 02:06:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:06:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:06:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1365 transitions. [2023-09-01 02:06:43,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510662177328844 [2023-09-01 02:06:43,359 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1365 transitions. [2023-09-01 02:06:43,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1365 transitions. [2023-09-01 02:06:43,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:43,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1365 transitions. [2023-09-01 02:06:43,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.66666666666666) internal successors, (1365), 9 states have internal predecessors, (1365), 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) [2023-09-01 02:06:43,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:43,363 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:06:43,363 INFO L175 Difference]: Start difference. First operand has 187 places, 280 transitions, 2982 flow. Second operand 9 states and 1365 transitions. [2023-09-01 02:06:43,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 417 transitions, 4700 flow [2023-09-01 02:06:44,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 417 transitions, 4667 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-09-01 02:06:44,056 INFO L231 Difference]: Finished difference. Result has 198 places, 300 transitions, 3490 flow [2023-09-01 02:06:44,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2949, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3490, PETRI_PLACES=198, PETRI_TRANSITIONS=300} [2023-09-01 02:06:44,056 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 126 predicate places. [2023-09-01 02:06:44,056 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 300 transitions, 3490 flow [2023-09-01 02:06:44,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 138.88888888888889) internal successors, (1250), 9 states have internal predecessors, (1250), 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) [2023-09-01 02:06:44,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:44,057 INFO L208 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] [2023-09-01 02:06:44,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-09-01 02:06:44,057 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:44,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:44,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1343915178, now seen corresponding path program 15 times [2023-09-01 02:06:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:44,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987392836] [2023-09-01 02:06:44,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:44,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:44,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:44,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987392836] [2023-09-01 02:06:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987392836] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:44,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:06:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910378889] [2023-09-01 02:06:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:44,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:06:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:06:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:06:44,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-09-01 02:06:44,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 300 transitions, 3490 flow. Second operand has 8 states, 8 states have (on average 139.375) internal successors, (1115), 8 states have internal predecessors, (1115), 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) [2023-09-01 02:06:44,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:44,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-09-01 02:06:44,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:49,435 INFO L130 PetriNetUnfolder]: 18820/34830 cut-off events. [2023-09-01 02:06:49,435 INFO L131 PetriNetUnfolder]: For 243816/247302 co-relation queries the response was YES. [2023-09-01 02:06:49,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155551 conditions, 34830 events. 18820/34830 cut-off events. For 243816/247302 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 312409 event pairs, 8708 based on Foata normal form. 558/34178 useless extension candidates. Maximal degree in co-relation 155478. Up to 24303 conditions per place. [2023-09-01 02:06:49,800 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 243 selfloop transitions, 50 changer transitions 16/390 dead transitions. [2023-09-01 02:06:49,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 390 transitions, 4729 flow [2023-09-01 02:06:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:06:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:06:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1209 transitions. [2023-09-01 02:06:49,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088383838383839 [2023-09-01 02:06:49,802 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1209 transitions. [2023-09-01 02:06:49,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1209 transitions. [2023-09-01 02:06:49,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:49,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1209 transitions. [2023-09-01 02:06:49,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 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) [2023-09-01 02:06:49,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:06:49,806 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:06:49,806 INFO L175 Difference]: Start difference. First operand has 198 places, 300 transitions, 3490 flow. Second operand 8 states and 1209 transitions. [2023-09-01 02:06:49,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 390 transitions, 4729 flow [2023-09-01 02:06:50,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 390 transitions, 4623 flow, removed 41 selfloop flow, removed 3 redundant places. [2023-09-01 02:06:50,825 INFO L231 Difference]: Finished difference. Result has 203 places, 308 transitions, 3693 flow [2023-09-01 02:06:50,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=3392, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3693, PETRI_PLACES=203, PETRI_TRANSITIONS=308} [2023-09-01 02:06:50,827 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 131 predicate places. [2023-09-01 02:06:50,827 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 308 transitions, 3693 flow [2023-09-01 02:06:50,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 139.375) internal successors, (1115), 8 states have internal predecessors, (1115), 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) [2023-09-01 02:06:50,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:50,828 INFO L208 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] [2023-09-01 02:06:50,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-09-01 02:06:50,828 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:50,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1577385606, now seen corresponding path program 16 times [2023-09-01 02:06:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:50,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611874644] [2023-09-01 02:06:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611874644] [2023-09-01 02:06:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611874644] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:51,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:51,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:06:51,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138602333] [2023-09-01 02:06:51,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:51,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:06:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:06:51,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:06:51,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:06:51,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 308 transitions, 3693 flow. Second operand has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 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) [2023-09-01 02:06:51,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:51,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:06:51,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:06:56,781 INFO L130 PetriNetUnfolder]: 21830/39533 cut-off events. [2023-09-01 02:06:56,781 INFO L131 PetriNetUnfolder]: For 288579/291719 co-relation queries the response was YES. [2023-09-01 02:06:57,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180160 conditions, 39533 events. 21830/39533 cut-off events. For 288579/291719 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 347922 event pairs, 8839 based on Foata normal form. 744/39042 useless extension candidates. Maximal degree in co-relation 180085. Up to 23400 conditions per place. [2023-09-01 02:06:57,213 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 310 selfloop transitions, 128 changer transitions 10/493 dead transitions. [2023-09-01 02:06:57,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 493 transitions, 6350 flow [2023-09-01 02:06:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:06:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:06:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1501 transitions. [2023-09-01 02:06:57,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053872053872054 [2023-09-01 02:06:57,215 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1501 transitions. [2023-09-01 02:06:57,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1501 transitions. [2023-09-01 02:06:57,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:06:57,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1501 transitions. [2023-09-01 02:06:57,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 150.1) internal successors, (1501), 10 states have internal predecessors, (1501), 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) [2023-09-01 02:06:57,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:06:57,219 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:06:57,219 INFO L175 Difference]: Start difference. First operand has 203 places, 308 transitions, 3693 flow. Second operand 10 states and 1501 transitions. [2023-09-01 02:06:57,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 493 transitions, 6350 flow [2023-09-01 02:06:58,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 493 transitions, 6234 flow, removed 30 selfloop flow, removed 3 redundant places. [2023-09-01 02:06:58,476 INFO L231 Difference]: Finished difference. Result has 217 places, 357 transitions, 4871 flow [2023-09-01 02:06:58,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=3620, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4871, PETRI_PLACES=217, PETRI_TRANSITIONS=357} [2023-09-01 02:06:58,477 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 145 predicate places. [2023-09-01 02:06:58,477 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 357 transitions, 4871 flow [2023-09-01 02:06:58,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 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) [2023-09-01 02:06:58,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:06:58,478 INFO L208 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] [2023-09-01 02:06:58,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-09-01 02:06:58,478 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:06:58,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:06:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1056183076, now seen corresponding path program 17 times [2023-09-01 02:06:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:06:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491310561] [2023-09-01 02:06:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:06:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:06:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:06:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:06:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:06:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491310561] [2023-09-01 02:06:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491310561] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:06:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:06:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-01 02:06:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863081208] [2023-09-01 02:06:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:06:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:06:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:06:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:06:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:06:58,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:06:58,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 357 transitions, 4871 flow. Second operand has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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) [2023-09-01 02:06:58,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:06:58,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:06:58,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:07:06,667 INFO L130 PetriNetUnfolder]: 24810/47361 cut-off events. [2023-09-01 02:07:06,667 INFO L131 PetriNetUnfolder]: For 418607/422204 co-relation queries the response was YES. [2023-09-01 02:07:07,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222676 conditions, 47361 events. 24810/47361 cut-off events. For 418607/422204 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 453102 event pairs, 9825 based on Foata normal form. 1122/47733 useless extension candidates. Maximal degree in co-relation 222593. Up to 26238 conditions per place. [2023-09-01 02:07:07,333 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 470 selfloop transitions, 156 changer transitions 4/667 dead transitions. [2023-09-01 02:07:07,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 667 transitions, 9147 flow [2023-09-01 02:07:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-09-01 02:07:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-09-01 02:07:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2929 transitions. [2023-09-01 02:07:07,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930976430976431 [2023-09-01 02:07:07,335 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2929 transitions. [2023-09-01 02:07:07,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2929 transitions. [2023-09-01 02:07:07,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:07:07,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2929 transitions. [2023-09-01 02:07:07,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 146.45) internal successors, (2929), 20 states have internal predecessors, (2929), 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) [2023-09-01 02:07:07,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 297.0) internal successors, (6237), 21 states have internal predecessors, (6237), 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) [2023-09-01 02:07:07,342 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 297.0) internal successors, (6237), 21 states have internal predecessors, (6237), 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) [2023-09-01 02:07:07,342 INFO L175 Difference]: Start difference. First operand has 217 places, 357 transitions, 4871 flow. Second operand 20 states and 2929 transitions. [2023-09-01 02:07:07,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 667 transitions, 9147 flow [2023-09-01 02:07:10,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 667 transitions, 8740 flow, removed 197 selfloop flow, removed 2 redundant places. [2023-09-01 02:07:10,476 INFO L231 Difference]: Finished difference. Result has 249 places, 443 transitions, 6586 flow [2023-09-01 02:07:10,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6586, PETRI_PLACES=249, PETRI_TRANSITIONS=443} [2023-09-01 02:07:10,477 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 177 predicate places. [2023-09-01 02:07:10,477 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 443 transitions, 6586 flow [2023-09-01 02:07:10,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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) [2023-09-01 02:07:10,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:07:10,477 INFO L208 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] [2023-09-01 02:07:10,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-09-01 02:07:10,477 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:07:10,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:07:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1567269094, now seen corresponding path program 18 times [2023-09-01 02:07:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:07:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721329664] [2023-09-01 02:07:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:07:10,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:07:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:07:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:07:10,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:07:10,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721329664] [2023-09-01 02:07:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721329664] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:07:10,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:07:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 02:07:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145526358] [2023-09-01 02:07:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:07:10,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:07:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:07:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:07:10,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:07:10,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-09-01 02:07:10,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 443 transitions, 6586 flow. Second operand has 7 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 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) [2023-09-01 02:07:10,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:07:10,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-09-01 02:07:10,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:07:18,478 INFO L130 PetriNetUnfolder]: 22748/42882 cut-off events. [2023-09-01 02:07:18,478 INFO L131 PetriNetUnfolder]: For 498031/500847 co-relation queries the response was YES. [2023-09-01 02:07:18,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219398 conditions, 42882 events. 22748/42882 cut-off events. For 498031/500847 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 398404 event pairs, 11263 based on Foata normal form. 542/42607 useless extension candidates. Maximal degree in co-relation 219301. Up to 32103 conditions per place. [2023-09-01 02:07:19,267 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 410 selfloop transitions, 59 changer transitions 4/510 dead transitions. [2023-09-01 02:07:19,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 510 transitions, 7984 flow [2023-09-01 02:07:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:07:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:07:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1196 transitions. [2023-09-01 02:07:19,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033670033670034 [2023-09-01 02:07:19,268 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1196 transitions. [2023-09-01 02:07:19,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1196 transitions. [2023-09-01 02:07:19,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:07:19,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1196 transitions. [2023-09-01 02:07:19,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.5) internal successors, (1196), 8 states have internal predecessors, (1196), 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) [2023-09-01 02:07:19,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:07:19,271 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:07:19,271 INFO L175 Difference]: Start difference. First operand has 249 places, 443 transitions, 6586 flow. Second operand 8 states and 1196 transitions. [2023-09-01 02:07:19,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 510 transitions, 7984 flow [2023-09-01 02:07:21,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 510 transitions, 7730 flow, removed 127 selfloop flow, removed 2 redundant places. [2023-09-01 02:07:21,968 INFO L231 Difference]: Finished difference. Result has 253 places, 430 transitions, 6279 flow [2023-09-01 02:07:21,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6007, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6279, PETRI_PLACES=253, PETRI_TRANSITIONS=430} [2023-09-01 02:07:21,969 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 181 predicate places. [2023-09-01 02:07:21,969 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 430 transitions, 6279 flow [2023-09-01 02:07:21,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 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) [2023-09-01 02:07:21,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:07:21,969 INFO L208 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] [2023-09-01 02:07:21,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-09-01 02:07:21,970 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:07:21,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:07:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1428394696, now seen corresponding path program 19 times [2023-09-01 02:07:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:07:21,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425585845] [2023-09-01 02:07:21,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:07:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:07:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:07:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:07:22,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:07:22,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425585845] [2023-09-01 02:07:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425585845] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:07:22,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:07:22,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:07:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554378358] [2023-09-01 02:07:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:07:22,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:07:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:07:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:07:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:07:22,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-09-01 02:07:22,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 430 transitions, 6279 flow. Second operand has 9 states, 9 states have (on average 137.88888888888889) internal successors, (1241), 9 states have internal predecessors, (1241), 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) [2023-09-01 02:07:22,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:07:22,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-09-01 02:07:22,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:07:30,318 INFO L130 PetriNetUnfolder]: 23517/43854 cut-off events. [2023-09-01 02:07:30,318 INFO L131 PetriNetUnfolder]: For 495832/499818 co-relation queries the response was YES. [2023-09-01 02:07:30,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224494 conditions, 43854 events. 23517/43854 cut-off events. For 495832/499818 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 408057 event pairs, 10444 based on Foata normal form. 458/43016 useless extension candidates. Maximal degree in co-relation 224396. Up to 33184 conditions per place. [2023-09-01 02:07:30,957 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 388 selfloop transitions, 52 changer transitions 23/528 dead transitions. [2023-09-01 02:07:30,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 528 transitions, 8113 flow [2023-09-01 02:07:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:07:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:07:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1346 transitions. [2023-09-01 02:07:30,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035540591096147 [2023-09-01 02:07:30,958 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1346 transitions. [2023-09-01 02:07:30,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1346 transitions. [2023-09-01 02:07:30,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:07:30,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1346 transitions. [2023-09-01 02:07:30,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.55555555555554) internal successors, (1346), 9 states have internal predecessors, (1346), 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) [2023-09-01 02:07:30,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:07:30,962 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:07:30,962 INFO L175 Difference]: Start difference. First operand has 253 places, 430 transitions, 6279 flow. Second operand 9 states and 1346 transitions. [2023-09-01 02:07:30,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 528 transitions, 8113 flow [2023-09-01 02:07:33,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 528 transitions, 8034 flow, removed 33 selfloop flow, removed 1 redundant places. [2023-09-01 02:07:33,493 INFO L231 Difference]: Finished difference. Result has 263 places, 429 transitions, 6364 flow [2023-09-01 02:07:33,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6216, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6364, PETRI_PLACES=263, PETRI_TRANSITIONS=429} [2023-09-01 02:07:33,493 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 191 predicate places. [2023-09-01 02:07:33,493 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 429 transitions, 6364 flow [2023-09-01 02:07:33,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.88888888888889) internal successors, (1241), 9 states have internal predecessors, (1241), 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) [2023-09-01 02:07:33,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:07:33,494 INFO L208 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] [2023-09-01 02:07:33,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-09-01 02:07:33,494 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:07:33,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:07:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash -572934070, now seen corresponding path program 20 times [2023-09-01 02:07:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:07:33,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788419129] [2023-09-01 02:07:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:07:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:07:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:07:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:07:33,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:07:33,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788419129] [2023-09-01 02:07:33,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788419129] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:07:33,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:07:33,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-01 02:07:33,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178956055] [2023-09-01 02:07:33,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:07:33,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:07:33,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:07:33,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:07:33,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:07:33,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:07:33,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 429 transitions, 6364 flow. Second operand has 10 states, 10 states have (on average 136.6) internal successors, (1366), 10 states have internal predecessors, (1366), 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) [2023-09-01 02:07:33,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:07:33,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:07:33,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:07:41,984 INFO L130 PetriNetUnfolder]: 23678/45028 cut-off events. [2023-09-01 02:07:41,985 INFO L131 PetriNetUnfolder]: For 527474/530750 co-relation queries the response was YES. [2023-09-01 02:07:42,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232766 conditions, 45028 events. 23678/45028 cut-off events. For 527474/530750 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 428562 event pairs, 12163 based on Foata normal form. 216/44312 useless extension candidates. Maximal degree in co-relation 232664. Up to 36611 conditions per place. [2023-09-01 02:07:42,864 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 377 selfloop transitions, 28 changer transitions 34/496 dead transitions. [2023-09-01 02:07:42,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 496 transitions, 7716 flow [2023-09-01 02:07:42,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:07:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:07:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1455 transitions. [2023-09-01 02:07:42,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2023-09-01 02:07:42,866 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1455 transitions. [2023-09-01 02:07:42,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1455 transitions. [2023-09-01 02:07:42,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:07:42,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1455 transitions. [2023-09-01 02:07:42,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 145.5) internal successors, (1455), 10 states have internal predecessors, (1455), 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) [2023-09-01 02:07:42,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:07:42,870 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:07:42,870 INFO L175 Difference]: Start difference. First operand has 263 places, 429 transitions, 6364 flow. Second operand 10 states and 1455 transitions. [2023-09-01 02:07:42,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 496 transitions, 7716 flow [2023-09-01 02:07:45,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 496 transitions, 7601 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-09-01 02:07:45,986 INFO L231 Difference]: Finished difference. Result has 271 places, 425 transitions, 6258 flow [2023-09-01 02:07:45,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6268, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6258, PETRI_PLACES=271, PETRI_TRANSITIONS=425} [2023-09-01 02:07:45,986 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 199 predicate places. [2023-09-01 02:07:45,986 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 425 transitions, 6258 flow [2023-09-01 02:07:45,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 136.6) internal successors, (1366), 10 states have internal predecessors, (1366), 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) [2023-09-01 02:07:45,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:07:45,987 INFO L208 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] [2023-09-01 02:07:45,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-09-01 02:07:45,987 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:07:45,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:07:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1815263710, now seen corresponding path program 21 times [2023-09-01 02:07:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:07:45,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462407781] [2023-09-01 02:07:45,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:07:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:07:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:07:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:07:46,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:07:46,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462407781] [2023-09-01 02:07:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462407781] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:07:46,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:07:46,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-01 02:07:46,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210752338] [2023-09-01 02:07:46,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:07:46,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:07:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:07:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:07:46,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:07:46,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-09-01 02:07:46,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 425 transitions, 6258 flow. Second operand has 10 states, 10 states have (on average 137.5) internal successors, (1375), 10 states have internal predecessors, (1375), 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) [2023-09-01 02:07:46,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:07:46,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-09-01 02:07:46,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:07:54,774 INFO L130 PetriNetUnfolder]: 23901/45508 cut-off events. [2023-09-01 02:07:54,774 INFO L131 PetriNetUnfolder]: For 549403/553377 co-relation queries the response was YES. [2023-09-01 02:07:55,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235076 conditions, 45508 events. 23901/45508 cut-off events. For 549403/553377 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 435981 event pairs, 12032 based on Foata normal form. 416/44877 useless extension candidates. Maximal degree in co-relation 234971. Up to 35081 conditions per place. [2023-09-01 02:07:55,493 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 385 selfloop transitions, 29 changer transitions 47/526 dead transitions. [2023-09-01 02:07:55,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 526 transitions, 8127 flow [2023-09-01 02:07:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:07:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:07:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2023-09-01 02:07:55,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043022820800599 [2023-09-01 02:07:55,495 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1348 transitions. [2023-09-01 02:07:55,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1348 transitions. [2023-09-01 02:07:55,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:07:55,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1348 transitions. [2023-09-01 02:07:55,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.77777777777777) internal successors, (1348), 9 states have internal predecessors, (1348), 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) [2023-09-01 02:07:55,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:07:55,497 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:07:55,497 INFO L175 Difference]: Start difference. First operand has 271 places, 425 transitions, 6258 flow. Second operand 9 states and 1348 transitions. [2023-09-01 02:07:55,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 526 transitions, 8127 flow [2023-09-01 02:07:58,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 526 transitions, 8050 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-09-01 02:07:58,363 INFO L231 Difference]: Finished difference. Result has 275 places, 427 transitions, 6376 flow [2023-09-01 02:07:58,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6191, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6376, PETRI_PLACES=275, PETRI_TRANSITIONS=427} [2023-09-01 02:07:58,364 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 203 predicate places. [2023-09-01 02:07:58,364 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 427 transitions, 6376 flow [2023-09-01 02:07:58,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 137.5) internal successors, (1375), 10 states have internal predecessors, (1375), 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) [2023-09-01 02:07:58,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:07:58,364 INFO L208 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] [2023-09-01 02:07:58,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-09-01 02:07:58,365 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:07:58,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:07:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash -358898564, now seen corresponding path program 22 times [2023-09-01 02:07:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:07:58,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184892983] [2023-09-01 02:07:58,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:07:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:07:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:07:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:07:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:07:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184892983] [2023-09-01 02:07:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184892983] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:07:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:07:58,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-09-01 02:07:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046590849] [2023-09-01 02:07:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:07:58,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 02:07:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:07:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 02:07:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-09-01 02:07:58,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-09-01 02:07:58,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 427 transitions, 6376 flow. Second operand has 11 states, 11 states have (on average 137.36363636363637) internal successors, (1511), 11 states have internal predecessors, (1511), 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) [2023-09-01 02:07:58,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:07:58,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-09-01 02:07:59,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:08:07,729 INFO L130 PetriNetUnfolder]: 23431/44326 cut-off events. [2023-09-01 02:08:07,730 INFO L131 PetriNetUnfolder]: For 590299/593892 co-relation queries the response was YES. [2023-09-01 02:08:08,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236053 conditions, 44326 events. 23431/44326 cut-off events. For 590299/593892 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 419979 event pairs, 10564 based on Foata normal form. 366/43634 useless extension candidates. Maximal degree in co-relation 235945. Up to 33232 conditions per place. [2023-09-01 02:08:08,497 INFO L137 encePairwiseOnDemand]: 285/297 looper letters, 374 selfloop transitions, 52 changer transitions 11/502 dead transitions. [2023-09-01 02:08:08,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 502 transitions, 7960 flow [2023-09-01 02:08:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:08:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:08:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1188 transitions. [2023-09-01 02:08:08,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-09-01 02:08:08,499 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1188 transitions. [2023-09-01 02:08:08,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1188 transitions. [2023-09-01 02:08:08,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:08:08,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1188 transitions. [2023-09-01 02:08:08,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 148.5) internal successors, (1188), 8 states have internal predecessors, (1188), 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) [2023-09-01 02:08:08,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:08:08,501 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:08:08,501 INFO L175 Difference]: Start difference. First operand has 275 places, 427 transitions, 6376 flow. Second operand 8 states and 1188 transitions. [2023-09-01 02:08:08,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 502 transitions, 7960 flow [2023-09-01 02:08:11,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 502 transitions, 7834 flow, removed 52 selfloop flow, removed 5 redundant places. [2023-09-01 02:08:11,360 INFO L231 Difference]: Finished difference. Result has 277 places, 429 transitions, 6497 flow [2023-09-01 02:08:11,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6266, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6497, PETRI_PLACES=277, PETRI_TRANSITIONS=429} [2023-09-01 02:08:11,361 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 205 predicate places. [2023-09-01 02:08:11,361 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 429 transitions, 6497 flow [2023-09-01 02:08:11,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 137.36363636363637) internal successors, (1511), 11 states have internal predecessors, (1511), 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) [2023-09-01 02:08:11,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:08:11,362 INFO L208 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] [2023-09-01 02:08:11,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-09-01 02:08:11,362 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:08:11,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:08:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2020796068, now seen corresponding path program 23 times [2023-09-01 02:08:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:08:11,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927540944] [2023-09-01 02:08:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:08:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:08:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:08:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:08:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:08:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927540944] [2023-09-01 02:08:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927540944] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:08:11,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:08:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:08:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424213228] [2023-09-01 02:08:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:08:11,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:08:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:08:11,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:08:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:08:11,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-09-01 02:08:11,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 429 transitions, 6497 flow. Second operand has 8 states, 8 states have (on average 139.25) internal successors, (1114), 8 states have internal predecessors, (1114), 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) [2023-09-01 02:08:11,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:08:11,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-09-01 02:08:11,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:08:19,859 INFO L130 PetriNetUnfolder]: 22776/43872 cut-off events. [2023-09-01 02:08:19,860 INFO L131 PetriNetUnfolder]: For 594094/598516 co-relation queries the response was YES. [2023-09-01 02:08:20,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232728 conditions, 43872 events. 22776/43872 cut-off events. For 594094/598516 co-relation queries the response was YES. Maximal size of possible extension queue 1356. Compared 424329 event pairs, 11745 based on Foata normal form. 592/43357 useless extension candidates. Maximal degree in co-relation 232619. Up to 34359 conditions per place. [2023-09-01 02:08:20,652 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 358 selfloop transitions, 26 changer transitions 10/481 dead transitions. [2023-09-01 02:08:20,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 481 transitions, 7638 flow [2023-09-01 02:08:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:08:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:08:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1183 transitions. [2023-09-01 02:08:20,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978956228956229 [2023-09-01 02:08:20,654 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1183 transitions. [2023-09-01 02:08:20,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1183 transitions. [2023-09-01 02:08:20,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:08:20,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1183 transitions. [2023-09-01 02:08:20,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 147.875) internal successors, (1183), 8 states have internal predecessors, (1183), 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) [2023-09-01 02:08:20,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:08:20,825 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:08:20,825 INFO L175 Difference]: Start difference. First operand has 277 places, 429 transitions, 6497 flow. Second operand 8 states and 1183 transitions. [2023-09-01 02:08:20,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 481 transitions, 7638 flow [2023-09-01 02:08:23,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 481 transitions, 7558 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-09-01 02:08:23,868 INFO L231 Difference]: Finished difference. Result has 281 places, 427 transitions, 6464 flow [2023-09-01 02:08:23,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6419, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6464, PETRI_PLACES=281, PETRI_TRANSITIONS=427} [2023-09-01 02:08:23,869 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 209 predicate places. [2023-09-01 02:08:23,869 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 427 transitions, 6464 flow [2023-09-01 02:08:23,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 139.25) internal successors, (1114), 8 states have internal predecessors, (1114), 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) [2023-09-01 02:08:23,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:08:23,869 INFO L208 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] [2023-09-01 02:08:23,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-09-01 02:08:23,870 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:08:23,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:08:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1389521552, now seen corresponding path program 24 times [2023-09-01 02:08:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:08:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123554150] [2023-09-01 02:08:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:08:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:08:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:08:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:08:24,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:08:24,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123554150] [2023-09-01 02:08:24,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123554150] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:08:24,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:08:24,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 02:08:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974809116] [2023-09-01 02:08:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:08:24,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 02:08:24,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:08:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 02:08:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-09-01 02:08:24,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:08:24,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 427 transitions, 6464 flow. Second operand has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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) [2023-09-01 02:08:24,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:08:24,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:08:24,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:08:33,243 INFO L130 PetriNetUnfolder]: 24808/45958 cut-off events. [2023-09-01 02:08:33,243 INFO L131 PetriNetUnfolder]: For 628389/632377 co-relation queries the response was YES. [2023-09-01 02:08:33,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247659 conditions, 45958 events. 24808/45958 cut-off events. For 628389/632377 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 427406 event pairs, 12192 based on Foata normal form. 444/45216 useless extension candidates. Maximal degree in co-relation 247549. Up to 37573 conditions per place. [2023-09-01 02:08:33,964 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 419 selfloop transitions, 76 changer transitions 47/587 dead transitions. [2023-09-01 02:08:33,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 587 transitions, 9371 flow [2023-09-01 02:08:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-01 02:08:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-09-01 02:08:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2190 transitions. [2023-09-01 02:08:33,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49158249158249157 [2023-09-01 02:08:33,966 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2190 transitions. [2023-09-01 02:08:33,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2190 transitions. [2023-09-01 02:08:33,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:08:33,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2190 transitions. [2023-09-01 02:08:33,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 146.0) internal successors, (2190), 15 states have internal predecessors, (2190), 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) [2023-09-01 02:08:33,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 297.0) internal successors, (4752), 16 states have internal predecessors, (4752), 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) [2023-09-01 02:08:33,970 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 297.0) internal successors, (4752), 16 states have internal predecessors, (4752), 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) [2023-09-01 02:08:33,970 INFO L175 Difference]: Start difference. First operand has 281 places, 427 transitions, 6464 flow. Second operand 15 states and 2190 transitions. [2023-09-01 02:08:33,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 587 transitions, 9371 flow [2023-09-01 02:08:37,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 587 transitions, 9276 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-09-01 02:08:37,135 INFO L231 Difference]: Finished difference. Result has 301 places, 459 transitions, 7327 flow [2023-09-01 02:08:37,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=6371, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7327, PETRI_PLACES=301, PETRI_TRANSITIONS=459} [2023-09-01 02:08:37,136 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 229 predicate places. [2023-09-01 02:08:37,136 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 459 transitions, 7327 flow [2023-09-01 02:08:37,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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) [2023-09-01 02:08:37,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:08:37,136 INFO L208 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] [2023-09-01 02:08:37,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-09-01 02:08:37,136 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:08:37,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:08:37,137 INFO L85 PathProgramCache]: Analyzing trace with hash -625008696, now seen corresponding path program 25 times [2023-09-01 02:08:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:08:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378773585] [2023-09-01 02:08:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:08:37,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:08:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:08:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:08:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:08:37,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378773585] [2023-09-01 02:08:37,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378773585] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:08:37,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:08:37,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-01 02:08:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236673237] [2023-09-01 02:08:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:08:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:08:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:08:37,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:08:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:08:37,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:08:37,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 459 transitions, 7327 flow. Second operand has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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) [2023-09-01 02:08:37,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:08:37,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:08:37,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:08:47,636 INFO L130 PetriNetUnfolder]: 26577/50165 cut-off events. [2023-09-01 02:08:47,636 INFO L131 PetriNetUnfolder]: For 728834/732104 co-relation queries the response was YES. [2023-09-01 02:08:48,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275670 conditions, 50165 events. 26577/50165 cut-off events. For 728834/732104 co-relation queries the response was YES. Maximal size of possible extension queue 1494. Compared 480858 event pairs, 9817 based on Foata normal form. 784/50223 useless extension candidates. Maximal degree in co-relation 275549. Up to 31261 conditions per place. [2023-09-01 02:08:48,610 INFO L137 encePairwiseOnDemand]: 285/297 looper letters, 455 selfloop transitions, 151 changer transitions 7/650 dead transitions. [2023-09-01 02:08:48,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 650 transitions, 11097 flow [2023-09-01 02:08:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 02:08:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 02:08:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1626 transitions. [2023-09-01 02:08:48,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49770431588613406 [2023-09-01 02:08:48,612 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1626 transitions. [2023-09-01 02:08:48,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1626 transitions. [2023-09-01 02:08:48,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:08:48,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1626 transitions. [2023-09-01 02:08:48,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.8181818181818) internal successors, (1626), 11 states have internal predecessors, (1626), 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) [2023-09-01 02:08:48,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:08:48,616 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:08:48,616 INFO L175 Difference]: Start difference. First operand has 301 places, 459 transitions, 7327 flow. Second operand 11 states and 1626 transitions. [2023-09-01 02:08:48,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 650 transitions, 11097 flow [2023-09-01 02:08:53,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 650 transitions, 10862 flow, removed 110 selfloop flow, removed 4 redundant places. [2023-09-01 02:08:53,204 INFO L231 Difference]: Finished difference. Result has 314 places, 511 transitions, 8752 flow [2023-09-01 02:08:53,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=7112, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8752, PETRI_PLACES=314, PETRI_TRANSITIONS=511} [2023-09-01 02:08:53,205 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 242 predicate places. [2023-09-01 02:08:53,207 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 511 transitions, 8752 flow [2023-09-01 02:08:53,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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) [2023-09-01 02:08:53,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:08:53,207 INFO L208 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] [2023-09-01 02:08:53,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-09-01 02:08:53,207 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:08:53,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:08:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash -69946838, now seen corresponding path program 26 times [2023-09-01 02:08:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:08:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315103034] [2023-09-01 02:08:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:08:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:08:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:08:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:08:53,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:08:53,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315103034] [2023-09-01 02:08:53,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315103034] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:08:53,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:08:53,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:08:53,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807518846] [2023-09-01 02:08:53,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:08:53,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:08:53,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:08:53,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:08:53,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:08:53,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:08:53,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 511 transitions, 8752 flow. Second operand has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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) [2023-09-01 02:08:53,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:08:53,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:08:53,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:05,326 INFO L130 PetriNetUnfolder]: 28508/53648 cut-off events. [2023-09-01 02:09:05,326 INFO L131 PetriNetUnfolder]: For 876456/880274 co-relation queries the response was YES. [2023-09-01 02:09:06,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300003 conditions, 53648 events. 28508/53648 cut-off events. For 876456/880274 co-relation queries the response was YES. Maximal size of possible extension queue 1633. Compared 516368 event pairs, 10445 based on Foata normal form. 962/53760 useless extension candidates. Maximal degree in co-relation 299874. Up to 28896 conditions per place. [2023-09-01 02:09:06,483 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 430 selfloop transitions, 186 changer transitions 16/669 dead transitions. [2023-09-01 02:09:06,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 669 transitions, 11802 flow [2023-09-01 02:09:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 02:09:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 02:09:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1784 transitions. [2023-09-01 02:09:06,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500561167227834 [2023-09-01 02:09:06,485 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1784 transitions. [2023-09-01 02:09:06,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1784 transitions. [2023-09-01 02:09:06,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:06,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1784 transitions. [2023-09-01 02:09:06,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 148.66666666666666) internal successors, (1784), 12 states have internal predecessors, (1784), 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) [2023-09-01 02:09:06,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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) [2023-09-01 02:09:06,489 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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) [2023-09-01 02:09:06,489 INFO L175 Difference]: Start difference. First operand has 314 places, 511 transitions, 8752 flow. Second operand 12 states and 1784 transitions. [2023-09-01 02:09:06,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 669 transitions, 11802 flow [2023-09-01 02:09:11,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 669 transitions, 11577 flow, removed 108 selfloop flow, removed 1 redundant places. [2023-09-01 02:09:11,775 INFO L231 Difference]: Finished difference. Result has 331 places, 532 transitions, 9630 flow [2023-09-01 02:09:11,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=8599, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9630, PETRI_PLACES=331, PETRI_TRANSITIONS=532} [2023-09-01 02:09:11,775 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 259 predicate places. [2023-09-01 02:09:11,775 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 532 transitions, 9630 flow [2023-09-01 02:09:11,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.11111111111111) internal successors, (1225), 9 states have internal predecessors, (1225), 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) [2023-09-01 02:09:11,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:11,776 INFO L208 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] [2023-09-01 02:09:11,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-09-01 02:09:11,776 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:11,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1720644982, now seen corresponding path program 27 times [2023-09-01 02:09:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:11,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63550438] [2023-09-01 02:09:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:09:12,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:12,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63550438] [2023-09-01 02:09:12,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63550438] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:12,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:12,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-01 02:09:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915764389] [2023-09-01 02:09:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:12,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:09:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:09:12,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:09:12,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:09:12,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 532 transitions, 9630 flow. Second operand has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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) [2023-09-01 02:09:12,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:12,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:09:12,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:24,673 INFO L130 PetriNetUnfolder]: 29140/55637 cut-off events. [2023-09-01 02:09:24,673 INFO L131 PetriNetUnfolder]: For 1039287/1042052 co-relation queries the response was YES. [2023-09-01 02:09:26,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320865 conditions, 55637 events. 29140/55637 cut-off events. For 1039287/1042052 co-relation queries the response was YES. Maximal size of possible extension queue 1725. Compared 547995 event pairs, 12071 based on Foata normal form. 491/55311 useless extension candidates. Maximal degree in co-relation 320728. Up to 41284 conditions per place. [2023-09-01 02:09:26,151 INFO L137 encePairwiseOnDemand]: 281/297 looper letters, 473 selfloop transitions, 159 changer transitions 12/681 dead transitions. [2023-09-01 02:09:26,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 681 transitions, 12956 flow [2023-09-01 02:09:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:09:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:09:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1513 transitions. [2023-09-01 02:09:26,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094276094276095 [2023-09-01 02:09:26,153 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1513 transitions. [2023-09-01 02:09:26,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1513 transitions. [2023-09-01 02:09:26,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:26,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1513 transitions. [2023-09-01 02:09:26,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 151.3) internal successors, (1513), 10 states have internal predecessors, (1513), 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) [2023-09-01 02:09:26,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:09:26,156 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:09:26,157 INFO L175 Difference]: Start difference. First operand has 331 places, 532 transitions, 9630 flow. Second operand 10 states and 1513 transitions. [2023-09-01 02:09:26,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 681 transitions, 12956 flow [2023-09-01 02:09:32,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 681 transitions, 12747 flow, removed 94 selfloop flow, removed 2 redundant places. [2023-09-01 02:09:32,541 INFO L231 Difference]: Finished difference. Result has 345 places, 562 transitions, 10797 flow [2023-09-01 02:09:32,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=9429, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10797, PETRI_PLACES=345, PETRI_TRANSITIONS=562} [2023-09-01 02:09:32,541 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 273 predicate places. [2023-09-01 02:09:32,542 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 562 transitions, 10797 flow [2023-09-01 02:09:32,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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) [2023-09-01 02:09:32,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:32,542 INFO L208 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] [2023-09-01 02:09:32,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-09-01 02:09:32,542 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:32,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1126259404, now seen corresponding path program 28 times [2023-09-01 02:09:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996870573] [2023-09-01 02:09:32,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:09:32,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:32,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996870573] [2023-09-01 02:09:32,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996870573] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:32,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:32,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:09:32,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248128389] [2023-09-01 02:09:32,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:32,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:09:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:32,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:09:32,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:09:32,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:09:32,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 562 transitions, 10797 flow. Second operand has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-09-01 02:09:32,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:32,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:09:32,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:46,518 INFO L130 PetriNetUnfolder]: 28545/54439 cut-off events. [2023-09-01 02:09:46,518 INFO L131 PetriNetUnfolder]: For 1100473/1105227 co-relation queries the response was YES. [2023-09-01 02:09:47,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322829 conditions, 54439 events. 28545/54439 cut-off events. For 1100473/1105227 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 535669 event pairs, 13098 based on Foata normal form. 658/54135 useless extension candidates. Maximal degree in co-relation 322684. Up to 42363 conditions per place. [2023-09-01 02:09:47,749 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 485 selfloop transitions, 84 changer transitions 8/640 dead transitions. [2023-09-01 02:09:47,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 640 transitions, 12541 flow [2023-09-01 02:09:47,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:09:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:09:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1333 transitions. [2023-09-01 02:09:47,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986906098017209 [2023-09-01 02:09:47,750 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1333 transitions. [2023-09-01 02:09:47,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1333 transitions. [2023-09-01 02:09:47,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:47,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1333 transitions. [2023-09-01 02:09:47,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.11111111111111) internal successors, (1333), 9 states have internal predecessors, (1333), 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) [2023-09-01 02:09:47,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:09:47,753 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 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) [2023-09-01 02:09:47,753 INFO L175 Difference]: Start difference. First operand has 345 places, 562 transitions, 10797 flow. Second operand 9 states and 1333 transitions. [2023-09-01 02:09:47,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 640 transitions, 12541 flow [2023-09-01 02:09:54,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 640 transitions, 12409 flow, removed 66 selfloop flow, removed 0 redundant places. [2023-09-01 02:09:54,706 INFO L231 Difference]: Finished difference. Result has 356 places, 563 transitions, 10852 flow [2023-09-01 02:09:54,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=10629, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10852, PETRI_PLACES=356, PETRI_TRANSITIONS=563} [2023-09-01 02:09:54,706 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 284 predicate places. [2023-09-01 02:09:54,706 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 563 transitions, 10852 flow [2023-09-01 02:09:54,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-09-01 02:09:54,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:54,707 INFO L208 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] [2023-09-01 02:09:54,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-09-01 02:09:54,707 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:54,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1313248250, now seen corresponding path program 29 times [2023-09-01 02:09:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471553345] [2023-09-01 02:09:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:09:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:55,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471553345] [2023-09-01 02:09:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471553345] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:55,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 02:09:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939909431] [2023-09-01 02:09:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:55,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 02:09:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:55,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 02:09:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-09-01 02:09:55,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:09:55,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 563 transitions, 10852 flow. Second operand has 11 states, 11 states have (on average 135.36363636363637) internal successors, (1489), 11 states have internal predecessors, (1489), 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) [2023-09-01 02:09:55,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:55,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:09:55,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:10:12,036 INFO L130 PetriNetUnfolder]: 37115/70027 cut-off events. [2023-09-01 02:10:12,036 INFO L131 PetriNetUnfolder]: For 1502858/1508385 co-relation queries the response was YES. [2023-09-01 02:10:13,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422227 conditions, 70027 events. 37115/70027 cut-off events. For 1502858/1508385 co-relation queries the response was YES. Maximal size of possible extension queue 2252. Compared 707928 event pairs, 16285 based on Foata normal form. 786/69672 useless extension candidates. Maximal degree in co-relation 422078. Up to 44692 conditions per place. [2023-09-01 02:10:14,134 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 630 selfloop transitions, 252 changer transitions 40/959 dead transitions. [2023-09-01 02:10:14,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 959 transitions, 19968 flow [2023-09-01 02:10:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 02:10:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 02:10:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1786 transitions. [2023-09-01 02:10:14,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011223344556678 [2023-09-01 02:10:14,136 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1786 transitions. [2023-09-01 02:10:14,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1786 transitions. [2023-09-01 02:10:14,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:10:14,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1786 transitions. [2023-09-01 02:10:14,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 148.83333333333334) internal successors, (1786), 12 states have internal predecessors, (1786), 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) [2023-09-01 02:10:14,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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) [2023-09-01 02:10:14,140 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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) [2023-09-01 02:10:14,140 INFO L175 Difference]: Start difference. First operand has 356 places, 563 transitions, 10852 flow. Second operand 12 states and 1786 transitions. [2023-09-01 02:10:14,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 959 transitions, 19968 flow [2023-09-01 02:10:23,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 959 transitions, 19852 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-09-01 02:10:23,263 INFO L231 Difference]: Finished difference. Result has 376 places, 762 transitions, 16551 flow [2023-09-01 02:10:23,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=10773, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16551, PETRI_PLACES=376, PETRI_TRANSITIONS=762} [2023-09-01 02:10:23,264 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 304 predicate places. [2023-09-01 02:10:23,264 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 762 transitions, 16551 flow [2023-09-01 02:10:23,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 135.36363636363637) internal successors, (1489), 11 states have internal predecessors, (1489), 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) [2023-09-01 02:10:23,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:10:23,264 INFO L208 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] [2023-09-01 02:10:23,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-09-01 02:10:23,265 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:10:23,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:10:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1223009686, now seen corresponding path program 30 times [2023-09-01 02:10:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:10:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928992185] [2023-09-01 02:10:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:10:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:10:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:10:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:10:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:10:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928992185] [2023-09-01 02:10:23,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928992185] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:10:23,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:10:23,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 02:10:23,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502232424] [2023-09-01 02:10:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:10:23,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 02:10:23,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:10:23,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 02:10:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-09-01 02:10:23,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:10:23,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 762 transitions, 16551 flow. Second operand has 12 states, 12 states have (on average 135.08333333333334) internal successors, (1621), 12 states have internal predecessors, (1621), 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) [2023-09-01 02:10:23,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:10:23,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:10:23,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:10:46,097 INFO L130 PetriNetUnfolder]: 41789/79828 cut-off events. [2023-09-01 02:10:46,097 INFO L131 PetriNetUnfolder]: For 1946257/1953427 co-relation queries the response was YES. [2023-09-01 02:10:48,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500342 conditions, 79828 events. 41789/79828 cut-off events. For 1946257/1953427 co-relation queries the response was YES. Maximal size of possible extension queue 2614. Compared 828809 event pairs, 18200 based on Foata normal form. 1066/79504 useless extension candidates. Maximal degree in co-relation 500183. Up to 30263 conditions per place. [2023-09-01 02:10:48,428 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 757 selfloop transitions, 216 changer transitions 51/1061 dead transitions. [2023-09-01 02:10:48,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1061 transitions, 22950 flow [2023-09-01 02:10:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-09-01 02:10:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-09-01 02:10:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2499 transitions. [2023-09-01 02:10:48,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2023-09-01 02:10:48,430 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2499 transitions. [2023-09-01 02:10:48,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2499 transitions. [2023-09-01 02:10:48,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:10:48,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2499 transitions. [2023-09-01 02:10:48,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 147.0) internal successors, (2499), 17 states have internal predecessors, (2499), 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) [2023-09-01 02:10:48,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 297.0) internal successors, (5346), 18 states have internal predecessors, (5346), 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) [2023-09-01 02:10:48,435 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 297.0) internal successors, (5346), 18 states have internal predecessors, (5346), 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) [2023-09-01 02:10:48,435 INFO L175 Difference]: Start difference. First operand has 376 places, 762 transitions, 16551 flow. Second operand 17 states and 2499 transitions. [2023-09-01 02:10:48,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 1061 transitions, 22950 flow [2023-09-01 02:11:03,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1061 transitions, 22522 flow, removed 214 selfloop flow, removed 2 redundant places. [2023-09-01 02:11:03,818 INFO L231 Difference]: Finished difference. Result has 399 places, 794 transitions, 18091 flow [2023-09-01 02:11:03,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=16241, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=18091, PETRI_PLACES=399, PETRI_TRANSITIONS=794} [2023-09-01 02:11:03,819 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 327 predicate places. [2023-09-01 02:11:03,819 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 794 transitions, 18091 flow [2023-09-01 02:11:03,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 135.08333333333334) internal successors, (1621), 12 states have internal predecessors, (1621), 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) [2023-09-01 02:11:03,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:11:03,819 INFO L208 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] [2023-09-01 02:11:03,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-09-01 02:11:03,819 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:11:03,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:11:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1163369418, now seen corresponding path program 31 times [2023-09-01 02:11:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:11:03,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846901147] [2023-09-01 02:11:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:11:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:11:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:11:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:11:04,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:11:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846901147] [2023-09-01 02:11:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846901147] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:11:04,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:11:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:11:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372783392] [2023-09-01 02:11:04,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:11:04,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:11:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:11:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:11:04,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:11:04,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:11:04,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 794 transitions, 18091 flow. Second operand has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 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) [2023-09-01 02:11:04,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:11:04,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:11:04,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:11:29,673 INFO L130 PetriNetUnfolder]: 42420/81564 cut-off events. [2023-09-01 02:11:29,673 INFO L131 PetriNetUnfolder]: For 2048941/2056671 co-relation queries the response was YES. [2023-09-01 02:11:31,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519120 conditions, 81564 events. 42420/81564 cut-off events. For 2048941/2056671 co-relation queries the response was YES. Maximal size of possible extension queue 2823. Compared 860446 event pairs, 16049 based on Foata normal form. 1426/81648 useless extension candidates. Maximal degree in co-relation 518951. Up to 37586 conditions per place. [2023-09-01 02:11:32,200 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 506 selfloop transitions, 378 changer transitions 12/967 dead transitions. [2023-09-01 02:11:32,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 967 transitions, 22179 flow [2023-09-01 02:11:32,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:11:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:11:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1520 transitions. [2023-09-01 02:11:32,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117845117845118 [2023-09-01 02:11:32,201 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1520 transitions. [2023-09-01 02:11:32,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1520 transitions. [2023-09-01 02:11:32,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:11:32,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1520 transitions. [2023-09-01 02:11:32,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 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) [2023-09-01 02:11:32,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:11:32,204 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:11:32,204 INFO L175 Difference]: Start difference. First operand has 399 places, 794 transitions, 18091 flow. Second operand 10 states and 1520 transitions. [2023-09-01 02:11:32,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 967 transitions, 22179 flow [2023-09-01 02:11:47,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 967 transitions, 21766 flow, removed 183 selfloop flow, removed 7 redundant places. [2023-09-01 02:11:47,682 INFO L231 Difference]: Finished difference. Result has 400 places, 804 transitions, 19082 flow [2023-09-01 02:11:47,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=17660, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19082, PETRI_PLACES=400, PETRI_TRANSITIONS=804} [2023-09-01 02:11:47,683 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 328 predicate places. [2023-09-01 02:11:47,683 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 804 transitions, 19082 flow [2023-09-01 02:11:47,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 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) [2023-09-01 02:11:47,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:11:47,683 INFO L208 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] [2023-09-01 02:11:47,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-09-01 02:11:47,683 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:11:47,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:11:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash 860080012, now seen corresponding path program 32 times [2023-09-01 02:11:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:11:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782575025] [2023-09-01 02:11:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:11:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:11:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:11:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:11:48,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:11:48,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782575025] [2023-09-01 02:11:48,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782575025] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:11:48,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:11:48,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 02:11:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931300817] [2023-09-01 02:11:48,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:11:48,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 02:11:48,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:11:48,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 02:11:48,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-09-01 02:11:48,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:11:48,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 804 transitions, 19082 flow. Second operand has 12 states, 12 states have (on average 135.08333333333334) internal successors, (1621), 12 states have internal predecessors, (1621), 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) [2023-09-01 02:11:48,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:11:48,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:11:48,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:12:12,719 INFO L130 PetriNetUnfolder]: 42785/80685 cut-off events. [2023-09-01 02:12:12,719 INFO L131 PetriNetUnfolder]: For 2124674/2132679 co-relation queries the response was YES. [2023-09-01 02:12:15,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516738 conditions, 80685 events. 42785/80685 cut-off events. For 2124674/2132679 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 831696 event pairs, 22034 based on Foata normal form. 806/79730 useless extension candidates. Maximal degree in co-relation 516568. Up to 66866 conditions per place. [2023-09-01 02:12:15,286 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 713 selfloop transitions, 115 changer transitions 35/900 dead transitions. [2023-09-01 02:12:15,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 900 transitions, 21889 flow [2023-09-01 02:12:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 02:12:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 02:12:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1729 transitions. [2023-09-01 02:12:15,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851290684624018 [2023-09-01 02:12:15,287 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1729 transitions. [2023-09-01 02:12:15,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1729 transitions. [2023-09-01 02:12:15,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:12:15,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1729 transitions. [2023-09-01 02:12:15,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 144.08333333333334) internal successors, (1729), 12 states have internal predecessors, (1729), 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) [2023-09-01 02:12:15,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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) [2023-09-01 02:12:15,290 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 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) [2023-09-01 02:12:15,290 INFO L175 Difference]: Start difference. First operand has 400 places, 804 transitions, 19082 flow. Second operand 12 states and 1729 transitions. [2023-09-01 02:12:15,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 900 transitions, 21889 flow [2023-09-01 02:12:30,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 900 transitions, 21713 flow, removed 56 selfloop flow, removed 2 redundant places. [2023-09-01 02:12:30,845 INFO L231 Difference]: Finished difference. Result has 415 places, 808 transitions, 19355 flow [2023-09-01 02:12:30,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=18906, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=19355, PETRI_PLACES=415, PETRI_TRANSITIONS=808} [2023-09-01 02:12:30,846 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 343 predicate places. [2023-09-01 02:12:30,846 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 808 transitions, 19355 flow [2023-09-01 02:12:30,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 135.08333333333334) internal successors, (1621), 12 states have internal predecessors, (1621), 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) [2023-09-01 02:12:30,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:12:30,846 INFO L208 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] [2023-09-01 02:12:30,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-09-01 02:12:30,846 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:12:30,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:12:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1677343552, now seen corresponding path program 33 times [2023-09-01 02:12:30,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:12:30,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142558459] [2023-09-01 02:12:30,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:12:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:12:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:12:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:12:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:12:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142558459] [2023-09-01 02:12:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142558459] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:12:31,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:12:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-09-01 02:12:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877485625] [2023-09-01 02:12:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:12:31,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 02:12:31,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:12:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 02:12:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-09-01 02:12:31,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:12:31,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 808 transitions, 19355 flow. Second operand has 11 states, 11 states have (on average 136.27272727272728) internal successors, (1499), 11 states have internal predecessors, (1499), 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) [2023-09-01 02:12:31,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:12:31,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:12:31,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:12:56,095 INFO L130 PetriNetUnfolder]: 41838/79467 cut-off events. [2023-09-01 02:12:56,095 INFO L131 PetriNetUnfolder]: For 2114936/2122104 co-relation queries the response was YES. [2023-09-01 02:12:58,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507676 conditions, 79467 events. 41838/79467 cut-off events. For 2114936/2122104 co-relation queries the response was YES. Maximal size of possible extension queue 2748. Compared 824391 event pairs, 20634 based on Foata normal form. 850/78570 useless extension candidates. Maximal degree in co-relation 507500. Up to 59985 conditions per place. [2023-09-01 02:12:58,764 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 665 selfloop transitions, 166 changer transitions 25/908 dead transitions. [2023-09-01 02:12:58,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 908 transitions, 22071 flow [2023-09-01 02:12:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 02:12:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 02:12:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1639 transitions. [2023-09-01 02:12:58,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016835016835017 [2023-09-01 02:12:58,766 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1639 transitions. [2023-09-01 02:12:58,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1639 transitions. [2023-09-01 02:12:58,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:12:58,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1639 transitions. [2023-09-01 02:12:58,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 149.0) internal successors, (1639), 11 states have internal predecessors, (1639), 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) [2023-09-01 02:12:58,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:12:58,769 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:12:58,769 INFO L175 Difference]: Start difference. First operand has 415 places, 808 transitions, 19355 flow. Second operand 11 states and 1639 transitions. [2023-09-01 02:12:58,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 908 transitions, 22071 flow [2023-09-01 02:13:14,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 908 transitions, 21773 flow, removed 63 selfloop flow, removed 11 redundant places. [2023-09-01 02:13:14,731 INFO L231 Difference]: Finished difference. Result has 413 places, 795 transitions, 19299 flow [2023-09-01 02:13:14,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=18560, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19299, PETRI_PLACES=413, PETRI_TRANSITIONS=795} [2023-09-01 02:13:14,732 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 341 predicate places. [2023-09-01 02:13:14,732 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 795 transitions, 19299 flow [2023-09-01 02:13:14,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 136.27272727272728) internal successors, (1499), 11 states have internal predecessors, (1499), 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) [2023-09-01 02:13:14,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:13:14,732 INFO L208 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] [2023-09-01 02:13:14,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-09-01 02:13:14,732 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:13:14,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:13:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1420984084, now seen corresponding path program 34 times [2023-09-01 02:13:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:13:14,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905693216] [2023-09-01 02:13:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:13:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:13:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:13:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:13:14,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:13:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905693216] [2023-09-01 02:13:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905693216] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:13:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:13:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-09-01 02:13:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778773817] [2023-09-01 02:13:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:13:14,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 02:13:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:13:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 02:13:14,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-09-01 02:13:15,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-09-01 02:13:15,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 795 transitions, 19299 flow. Second operand has 11 states, 11 states have (on average 135.36363636363637) internal successors, (1489), 11 states have internal predecessors, (1489), 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) [2023-09-01 02:13:15,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:13:15,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-09-01 02:13:15,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:13:39,809 INFO L130 PetriNetUnfolder]: 41779/79815 cut-off events. [2023-09-01 02:13:39,809 INFO L131 PetriNetUnfolder]: For 2086148/2093519 co-relation queries the response was YES. [2023-09-01 02:13:42,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509331 conditions, 79815 events. 41779/79815 cut-off events. For 2086148/2093519 co-relation queries the response was YES. Maximal size of possible extension queue 2762. Compared 832453 event pairs, 23771 based on Foata normal form. 424/78780 useless extension candidates. Maximal degree in co-relation 509157. Up to 66995 conditions per place. [2023-09-01 02:13:42,376 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 740 selfloop transitions, 5 changer transitions 73/855 dead transitions. [2023-09-01 02:13:42,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 855 transitions, 21492 flow [2023-09-01 02:13:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:13:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:13:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1424 transitions. [2023-09-01 02:13:42,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794612794612795 [2023-09-01 02:13:42,377 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1424 transitions. [2023-09-01 02:13:42,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1424 transitions. [2023-09-01 02:13:42,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:13:42,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1424 transitions. [2023-09-01 02:13:42,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 142.4) internal successors, (1424), 10 states have internal predecessors, (1424), 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) [2023-09-01 02:13:42,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:13:42,380 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 297.0) internal successors, (3267), 11 states have internal predecessors, (3267), 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) [2023-09-01 02:13:42,380 INFO L175 Difference]: Start difference. First operand has 413 places, 795 transitions, 19299 flow. Second operand 10 states and 1424 transitions. [2023-09-01 02:13:42,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 855 transitions, 21492 flow [2023-09-01 02:13:56,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 855 transitions, 21255 flow, removed 100 selfloop flow, removed 5 redundant places. [2023-09-01 02:13:56,917 INFO L231 Difference]: Finished difference. Result has 417 places, 777 transitions, 18595 flow [2023-09-01 02:13:56,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=19029, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18595, PETRI_PLACES=417, PETRI_TRANSITIONS=777} [2023-09-01 02:13:56,918 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 345 predicate places. [2023-09-01 02:13:56,918 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 777 transitions, 18595 flow [2023-09-01 02:13:56,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 135.36363636363637) internal successors, (1489), 11 states have internal predecessors, (1489), 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) [2023-09-01 02:13:56,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:13:56,918 INFO L208 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] [2023-09-01 02:13:56,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-09-01 02:13:56,918 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:13:56,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:13:56,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1565792504, now seen corresponding path program 35 times [2023-09-01 02:13:56,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:13:56,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998075937] [2023-09-01 02:13:56,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:13:56,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:13:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:13:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:13:57,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:13:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998075937] [2023-09-01 02:13:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998075937] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:13:57,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:13:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:13:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703646639] [2023-09-01 02:13:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:13:57,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:13:57,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:13:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:13:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 02:13:57,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-09-01 02:13:57,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 777 transitions, 18595 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 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) [2023-09-01 02:13:57,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:13:57,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-09-01 02:13:57,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:14:19,660 INFO L130 PetriNetUnfolder]: 38987/75216 cut-off events. [2023-09-01 02:14:19,660 INFO L131 PetriNetUnfolder]: For 1972099/1980447 co-relation queries the response was YES. [2023-09-01 02:14:22,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474860 conditions, 75216 events. 38987/75216 cut-off events. For 1972099/1980447 co-relation queries the response was YES. Maximal size of possible extension queue 2666. Compared 789088 event pairs, 20554 based on Foata normal form. 868/74373 useless extension candidates. Maximal degree in co-relation 474687. Up to 61690 conditions per place. [2023-09-01 02:14:22,301 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 622 selfloop transitions, 46 changer transitions 7/804 dead transitions. [2023-09-01 02:14:22,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 804 transitions, 20114 flow [2023-09-01 02:14:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:14:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:14:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2023-09-01 02:14:22,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067340067340067 [2023-09-01 02:14:22,302 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2023-09-01 02:14:22,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2023-09-01 02:14:22,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:14:22,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2023-09-01 02:14:22,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 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) [2023-09-01 02:14:22,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 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) [2023-09-01 02:14:22,305 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 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) [2023-09-01 02:14:22,305 INFO L175 Difference]: Start difference. First operand has 417 places, 777 transitions, 18595 flow. Second operand 6 states and 903 transitions. [2023-09-01 02:14:22,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 804 transitions, 20114 flow [2023-09-01 02:14:36,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 804 transitions, 19776 flow, removed 70 selfloop flow, removed 10 redundant places. [2023-09-01 02:14:36,074 INFO L231 Difference]: Finished difference. Result has 401 places, 772 transitions, 18261 flow [2023-09-01 02:14:36,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=18130, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18261, PETRI_PLACES=401, PETRI_TRANSITIONS=772} [2023-09-01 02:14:36,075 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 329 predicate places. [2023-09-01 02:14:36,075 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 772 transitions, 18261 flow [2023-09-01 02:14:36,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 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) [2023-09-01 02:14:36,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:14:36,075 INFO L208 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] [2023-09-01 02:14:36,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-09-01 02:14:36,076 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:14:36,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:14:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1544462392, now seen corresponding path program 36 times [2023-09-01 02:14:36,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:14:36,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171690764] [2023-09-01 02:14:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:14:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:14:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:14:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:14:36,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:14:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171690764] [2023-09-01 02:14:36,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171690764] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:14:36,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:14:36,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:14:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944824715] [2023-09-01 02:14:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:14:36,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:14:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:14:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:14:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:14:36,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:14:36,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 772 transitions, 18261 flow. Second operand has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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) [2023-09-01 02:14:36,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:14:36,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:14:36,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:15:14,292 INFO L130 PetriNetUnfolder]: 67781/111401 cut-off events. [2023-09-01 02:15:14,293 INFO L131 PetriNetUnfolder]: For 2515015/2519281 co-relation queries the response was YES. [2023-09-01 02:15:18,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674022 conditions, 111401 events. 67781/111401 cut-off events. For 2515015/2519281 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 989431 event pairs, 25871 based on Foata normal form. 1324/111740 useless extension candidates. Maximal degree in co-relation 673851. Up to 35311 conditions per place. [2023-09-01 02:15:19,177 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 1027 selfloop transitions, 25 changer transitions 334/1573 dead transitions. [2023-09-01 02:15:19,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1573 transitions, 37463 flow [2023-09-01 02:15:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 02:15:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 02:15:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1655 transitions. [2023-09-01 02:15:19,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065809611264157 [2023-09-01 02:15:19,179 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1655 transitions. [2023-09-01 02:15:19,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1655 transitions. [2023-09-01 02:15:19,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:15:19,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1655 transitions. [2023-09-01 02:15:19,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 150.45454545454547) internal successors, (1655), 11 states have internal predecessors, (1655), 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) [2023-09-01 02:15:19,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:15:19,182 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 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) [2023-09-01 02:15:19,182 INFO L175 Difference]: Start difference. First operand has 401 places, 772 transitions, 18261 flow. Second operand 11 states and 1655 transitions. [2023-09-01 02:15:19,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 1573 transitions, 37463 flow [2023-09-01 02:15:40,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 1573 transitions, 37271 flow, removed 34 selfloop flow, removed 5 redundant places. [2023-09-01 02:15:40,567 INFO L231 Difference]: Finished difference. Result has 411 places, 758 transitions, 17656 flow [2023-09-01 02:15:40,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=18127, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17656, PETRI_PLACES=411, PETRI_TRANSITIONS=758} [2023-09-01 02:15:40,568 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 339 predicate places. [2023-09-01 02:15:40,568 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 758 transitions, 17656 flow [2023-09-01 02:15:40,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 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) [2023-09-01 02:15:40,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:15:40,568 INFO L208 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] [2023-09-01 02:15:40,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-09-01 02:15:40,569 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:15:40,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:15:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1196879374, now seen corresponding path program 37 times [2023-09-01 02:15:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:15:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626442264] [2023-09-01 02:15:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:15:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:15:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:15:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:15:40,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:15:40,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626442264] [2023-09-01 02:15:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626442264] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:15:40,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:15:40,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:15:40,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281005571] [2023-09-01 02:15:40,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:15:40,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:15:40,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:15:40,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:15:40,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 02:15:40,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-09-01 02:15:40,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 758 transitions, 17656 flow. Second operand has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 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) [2023-09-01 02:15:40,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:15:40,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-09-01 02:15:40,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:16:05,168 INFO L130 PetriNetUnfolder]: 39482/76002 cut-off events. [2023-09-01 02:16:05,168 INFO L131 PetriNetUnfolder]: For 1902102/1910224 co-relation queries the response was YES. [2023-09-01 02:16:08,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488169 conditions, 76002 events. 39482/76002 cut-off events. For 1902102/1910224 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 791967 event pairs, 21086 based on Foata normal form. 711/75347 useless extension candidates. Maximal degree in co-relation 487995. Up to 63321 conditions per place. [2023-09-01 02:16:08,286 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 611 selfloop transitions, 34 changer transitions 8/778 dead transitions. [2023-09-01 02:16:08,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 778 transitions, 19107 flow [2023-09-01 02:16:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 02:16:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 02:16:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2023-09-01 02:16:08,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2023-09-01 02:16:08,288 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 740 transitions. [2023-09-01 02:16:08,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 740 transitions. [2023-09-01 02:16:08,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:16:08,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 740 transitions. [2023-09-01 02:16:08,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 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) [2023-09-01 02:16:08,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 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) [2023-09-01 02:16:08,290 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 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) [2023-09-01 02:16:08,290 INFO L175 Difference]: Start difference. First operand has 411 places, 758 transitions, 17656 flow. Second operand 5 states and 740 transitions. [2023-09-01 02:16:08,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 778 transitions, 19107 flow [2023-09-01 02:16:23,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 778 transitions, 18975 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-09-01 02:16:23,823 INFO L231 Difference]: Finished difference. Result has 411 places, 752 transitions, 17421 flow [2023-09-01 02:16:23,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=17483, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=17421, PETRI_PLACES=411, PETRI_TRANSITIONS=752} [2023-09-01 02:16:23,824 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 339 predicate places. [2023-09-01 02:16:23,824 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 752 transitions, 17421 flow [2023-09-01 02:16:23,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 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) [2023-09-01 02:16:23,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:16:23,824 INFO L208 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] [2023-09-01 02:16:23,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-09-01 02:16:23,824 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:16:23,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:16:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1426013920, now seen corresponding path program 38 times [2023-09-01 02:16:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:16:23,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990826916] [2023-09-01 02:16:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:16:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:16:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:16:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:16:24,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:16:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990826916] [2023-09-01 02:16:24,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990826916] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:16:24,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:16:24,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 02:16:24,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458323558] [2023-09-01 02:16:24,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:16:24,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 02:16:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:16:24,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 02:16:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:16:24,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-09-01 02:16:24,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 752 transitions, 17421 flow. Second operand has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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) [2023-09-01 02:16:24,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:16:24,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-09-01 02:16:24,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:16:49,461 INFO L130 PetriNetUnfolder]: 39811/77195 cut-off events. [2023-09-01 02:16:49,462 INFO L131 PetriNetUnfolder]: For 1954711/1963541 co-relation queries the response was YES. [2023-09-01 02:16:52,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494433 conditions, 77195 events. 39811/77195 cut-off events. For 1954711/1963541 co-relation queries the response was YES. Maximal size of possible extension queue 2701. Compared 813796 event pairs, 20103 based on Foata normal form. 1192/76997 useless extension candidates. Maximal degree in co-relation 494258. Up to 61043 conditions per place. [2023-09-01 02:16:53,082 INFO L137 encePairwiseOnDemand]: 285/297 looper letters, 606 selfloop transitions, 79 changer transitions 8/813 dead transitions. [2023-09-01 02:16:53,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 813 transitions, 19472 flow [2023-09-01 02:16:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:16:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:16:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1182 transitions. [2023-09-01 02:16:53,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49747474747474746 [2023-09-01 02:16:53,084 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1182 transitions. [2023-09-01 02:16:53,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1182 transitions. [2023-09-01 02:16:53,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:16:53,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1182 transitions. [2023-09-01 02:16:53,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 147.75) internal successors, (1182), 8 states have internal predecessors, (1182), 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) [2023-09-01 02:16:53,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:16:53,086 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 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) [2023-09-01 02:16:53,086 INFO L175 Difference]: Start difference. First operand has 411 places, 752 transitions, 17421 flow. Second operand 8 states and 1182 transitions. [2023-09-01 02:16:53,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 813 transitions, 19472 flow [2023-09-01 02:17:10,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 813 transitions, 19377 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-09-01 02:17:10,149 INFO L231 Difference]: Finished difference. Result has 419 places, 757 transitions, 17680 flow [2023-09-01 02:17:10,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=17326, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17680, PETRI_PLACES=419, PETRI_TRANSITIONS=757} [2023-09-01 02:17:10,150 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 347 predicate places. [2023-09-01 02:17:10,150 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 757 transitions, 17680 flow [2023-09-01 02:17:10,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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) [2023-09-01 02:17:10,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:10,151 INFO L208 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] [2023-09-01 02:17:10,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-09-01 02:17:10,151 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:17:10,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:10,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1468144650, now seen corresponding path program 39 times [2023-09-01 02:17:10,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:17:10,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154212266] [2023-09-01 02:17:10,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:10,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:17:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:10,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:17:10,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154212266] [2023-09-01 02:17:10,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154212266] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:10,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 02:17:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204294283] [2023-09-01 02:17:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:10,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:17:10,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:17:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:17:10,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 02:17:10,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-09-01 02:17:10,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 757 transitions, 17680 flow. Second operand has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 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) [2023-09-01 02:17:10,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:10,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-09-01 02:17:10,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:35,013 INFO L130 PetriNetUnfolder]: 40183/77768 cut-off events. [2023-09-01 02:17:35,013 INFO L131 PetriNetUnfolder]: For 2035135/2042674 co-relation queries the response was YES. [2023-09-01 02:17:37,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509236 conditions, 77768 events. 40183/77768 cut-off events. For 2035135/2042674 co-relation queries the response was YES. Maximal size of possible extension queue 2633. Compared 815202 event pairs, 20616 based on Foata normal form. 879/77360 useless extension candidates. Maximal degree in co-relation 509057. Up to 63892 conditions per place. [2023-09-01 02:17:37,859 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 657 selfloop transitions, 46 changer transitions 27/805 dead transitions. [2023-09-01 02:17:37,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 805 transitions, 19676 flow [2023-09-01 02:17:37,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:17:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:17:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions. [2023-09-01 02:17:37,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011223344556678 [2023-09-01 02:17:37,860 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 893 transitions. [2023-09-01 02:17:37,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 893 transitions. [2023-09-01 02:17:37,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:37,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 893 transitions. [2023-09-01 02:17:37,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 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) [2023-09-01 02:17:37,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 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) [2023-09-01 02:17:37,862 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 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) [2023-09-01 02:17:37,862 INFO L175 Difference]: Start difference. First operand has 419 places, 757 transitions, 17680 flow. Second operand 6 states and 893 transitions. [2023-09-01 02:17:37,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 805 transitions, 19676 flow [2023-09-01 02:17:56,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 805 transitions, 19460 flow, removed 60 selfloop flow, removed 5 redundant places. [2023-09-01 02:17:56,751 INFO L231 Difference]: Finished difference. Result has 420 places, 752 transitions, 17449 flow [2023-09-01 02:17:56,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=17474, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=17449, PETRI_PLACES=420, PETRI_TRANSITIONS=752} [2023-09-01 02:17:56,751 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 348 predicate places. [2023-09-01 02:17:56,752 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 752 transitions, 17449 flow [2023-09-01 02:17:56,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 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) [2023-09-01 02:17:56,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:56,752 INFO L208 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] [2023-09-01 02:17:56,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-09-01 02:17:56,752 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:17:56,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1542670396, now seen corresponding path program 40 times [2023-09-01 02:17:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:17:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677360111] [2023-09-01 02:17:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:17:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:17:57,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677360111] [2023-09-01 02:17:57,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677360111] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:57,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:57,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:17:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393716351] [2023-09-01 02:17:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 02:17:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:17:57,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 02:17:57,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-09-01 02:17:57,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-09-01 02:17:57,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 752 transitions, 17449 flow. Second operand has 8 states, 8 states have (on average 139.25) internal successors, (1114), 8 states have internal predecessors, (1114), 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) [2023-09-01 02:17:57,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:57,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-09-01 02:17:57,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15