./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 AFTER --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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 23:16:20,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 23:16:20,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 23:16:20,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 23:16:20,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 23:16:20,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 23:16:20,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 23:16:20,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 23:16:20,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 23:16:20,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 23:16:20,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 23:16:20,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 23:16:20,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 23:16:20,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 23:16:20,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 23:16:20,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 23:16:20,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 23:16:20,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 23:16:20,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 23:16:20,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 23:16:20,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 23:16:20,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 23:16:20,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 23:16:20,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 23:16:20,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 23:16:20,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 23:16:20,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 23:16:20,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 23:16:20,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 23:16:20,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 23:16:20,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 23:16:20,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 23:16:20,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 23:16:20,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 23:16:20,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 23:16:20,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 23:16:20,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 23:16:20,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 23:16:20,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 23:16:20,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 23:16:20,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 23:16:20,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 23:16:20,610 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 23:16:20,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 23:16:20,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 23:16:20,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 23:16:20,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 23:16:20,612 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 23:16:20,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 23:16:20,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 23:16:20,613 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 23:16:20,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 23:16:20,614 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 23:16:20,615 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 23:16:20,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 23:16:20,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 23:16:20,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 23:16:20,615 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 23:16:20,616 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 23:16:20,616 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 23:16:20,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 23:16:20,616 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 23:16:20,616 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 23:16:20,617 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 23:16:20,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 23:16:20,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 23:16:20,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 23:16:20,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 23:16:20,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 23:16:20,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 23:16:20,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 23:16:20,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 23:16:20,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 23:16:20,619 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 23:16:20,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 23:16:20,619 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 23:16:20,619 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 -> AFTER [2023-08-29 23:16:20,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 23:16:20,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 23:16:20,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 23:16:20,958 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 23:16:20,958 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 23:16:20,959 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-08-29 23:16:22,001 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 23:16:22,197 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 23:16:22,198 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-08-29 23:16:22,203 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a688268/fc2e26b7e52e4f56b3a6624f92c96d71/FLAGe9e61a202 [2023-08-29 23:16:22,215 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a688268/fc2e26b7e52e4f56b3a6624f92c96d71 [2023-08-29 23:16:22,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 23:16:22,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 23:16:22,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 23:16:22,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 23:16:22,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 23:16:22,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64022002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22, skipping insertion in model container [2023-08-29 23:16:22,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 23:16:22,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 23:16:22,452 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-08-29 23:16:22,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 23:16:22,462 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 23:16:22,489 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-08-29 23:16:22,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 23:16:22,508 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 23:16:22,509 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 23:16:22,514 INFO L208 MainTranslator]: Completed translation [2023-08-29 23:16:22,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22 WrapperNode [2023-08-29 23:16:22,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 23:16:22,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 23:16:22,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 23:16:22,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 23:16:22,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,574 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 265 [2023-08-29 23:16:22,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 23:16:22,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 23:16:22,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 23:16:22,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 23:16:22,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,619 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 23:16:22,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 23:16:22,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 23:16:22,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 23:16:22,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (1/1) ... [2023-08-29 23:16:22,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 23:16:22,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 23:16:22,666 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-08-29 23:16:22,697 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-08-29 23:16:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 23:16:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 23:16:22,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 23:16:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 23:16:22,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 23:16:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 23:16:22,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 23:16:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 23:16:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 23:16:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 23:16:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 23:16:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 23:16:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 23:16:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 23:16:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 23:16:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 23:16:22,707 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 23:16:22,817 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 23:16:22,819 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 23:16:23,178 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 23:16:23,296 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 23:16:23,299 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 23:16:23,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:16:23 BoogieIcfgContainer [2023-08-29 23:16:23,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 23:16:23,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 23:16:23,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 23:16:23,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 23:16:23,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 11:16:22" (1/3) ... [2023-08-29 23:16:23,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5509db24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 11:16:23, skipping insertion in model container [2023-08-29 23:16:23,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:16:22" (2/3) ... [2023-08-29 23:16:23,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5509db24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 11:16:23, skipping insertion in model container [2023-08-29 23:16:23,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:16:23" (3/3) ... [2023-08-29 23:16:23,309 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-08-29 23:16:23,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 23:16:23,321 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-29 23:16:23,321 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 23:16:23,384 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 23:16:23,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 366 flow [2023-08-29 23:16:23,505 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-29 23:16:23,505 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 23:16:23,509 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-08-29 23:16:23,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 366 flow [2023-08-29 23:16:23,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 164 transitions, 346 flow [2023-08-29 23:16:23,522 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 23:16:23,534 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 164 transitions, 346 flow [2023-08-29 23:16:23,541 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 164 transitions, 346 flow [2023-08-29 23:16:23,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 346 flow [2023-08-29 23:16:23,594 INFO L130 PetriNetUnfolder]: 2/164 cut-off events. [2023-08-29 23:16:23,594 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 23:16:23,595 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-08-29 23:16:23,598 INFO L119 LiptonReduction]: Number of co-enabled transitions 2688 [2023-08-29 23:16:28,105 INFO L134 LiptonReduction]: Checked pairs total: 22362 [2023-08-29 23:16:28,106 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-29 23:16:28,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 23:16:28,126 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;@25a0ca4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 23:16:28,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-08-29 23:16:28,127 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 23:16:28,128 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 23:16:28,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:28,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 23:16:28,129 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-08-29 23:16:28,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:28,131 INFO L85 PathProgramCache]: Analyzing trace with hash 756, now seen corresponding path program 1 times [2023-08-29 23:16:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:28,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026234785] [2023-08-29 23:16:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:28,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:28,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026234785] [2023-08-29 23:16:28,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026234785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:28,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:28,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 23:16:28,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787303183] [2023-08-29 23:16:28,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:28,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 23:16:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 23:16:28,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 23:16:28,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 297 [2023-08-29 23:16:28,239 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-08-29 23:16:28,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:28,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 297 [2023-08-29 23:16:28,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:28,958 INFO L130 PetriNetUnfolder]: 3906/6589 cut-off events. [2023-08-29 23:16:28,958 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2023-08-29 23:16:28,969 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-08-29 23:16:28,996 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 41 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-29 23:16:28,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 218 flow [2023-08-29 23:16:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 23:16:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 23:16:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 338 transitions. [2023-08-29 23:16:29,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.569023569023569 [2023-08-29 23:16:29,008 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 338 transitions. [2023-08-29 23:16:29,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 338 transitions. [2023-08-29 23:16:29,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:29,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 338 transitions. [2023-08-29 23:16:29,014 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-08-29 23:16:29,018 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-08-29 23:16:29,018 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-08-29 23:16:29,020 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 142 flow. Second operand 2 states and 338 transitions. [2023-08-29 23:16:29,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 218 flow [2023-08-29 23:16:29,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 206 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 23:16:29,028 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 124 flow [2023-08-29 23:16:29,029 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-08-29 23:16:29,032 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-08-29 23:16:29,032 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 124 flow [2023-08-29 23:16:29,032 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-08-29 23:16:29,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:29,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 23:16:29,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 23:16:29,033 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-08-29 23:16:29,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash 744639, now seen corresponding path program 1 times [2023-08-29 23:16:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448673644] [2023-08-29 23:16:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:29,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-08-29 23:16:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:29,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448673644] [2023-08-29 23:16:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448673644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:16:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112637133] [2023-08-29 23:16:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:29,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:16:29,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:29,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:16:29,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:16:29,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-08-29 23:16:29,440 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-08-29 23:16:29,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:29,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-08-29 23:16:29,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:29,967 INFO L130 PetriNetUnfolder]: 3816/6441 cut-off events. [2023-08-29 23:16:29,967 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-29 23:16:29,973 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-08-29 23:16:29,998 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 38 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-29 23:16:29,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 198 flow [2023-08-29 23:16:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-29 23:16:30,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072951739618407 [2023-08-29 23:16:30,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-29 23:16:30,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-29 23:16:30,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:30,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-29 23:16:30,004 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-08-29 23:16:30,006 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-08-29 23:16:30,006 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-08-29 23:16:30,006 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 124 flow. Second operand 3 states and 452 transitions. [2023-08-29 23:16:30,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 198 flow [2023-08-29 23:16:30,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 23:16:30,008 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 122 flow [2023-08-29 23:16:30,009 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-08-29 23:16:30,009 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-08-29 23:16:30,009 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 122 flow [2023-08-29 23:16:30,010 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-08-29 23:16:30,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:30,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 23:16:30,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 23:16:30,011 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-08-29 23:16:30,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash 744640, now seen corresponding path program 1 times [2023-08-29 23:16:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607393784] [2023-08-29 23:16:30,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:30,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:30,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607393784] [2023-08-29 23:16:30,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607393784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:30,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:30,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:16:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393375008] [2023-08-29 23:16:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:30,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:16:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:16:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:16:30,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-08-29 23:16:30,191 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-08-29 23:16:30,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:30,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-08-29 23:16:30,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:30,671 INFO L130 PetriNetUnfolder]: 3726/6293 cut-off events. [2023-08-29 23:16:30,672 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-29 23:16:30,677 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-08-29 23:16:30,699 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 36 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-29 23:16:30,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 192 flow [2023-08-29 23:16:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-08-29 23:16:30,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218855218855218 [2023-08-29 23:16:30,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-08-29 23:16:30,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-08-29 23:16:30,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:30,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-08-29 23:16:30,703 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-08-29 23:16:30,704 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-08-29 23:16:30,705 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-08-29 23:16:30,705 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 122 flow. Second operand 3 states and 465 transitions. [2023-08-29 23:16:30,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 192 flow [2023-08-29 23:16:30,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:16:30,707 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 119 flow [2023-08-29 23:16:30,707 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-08-29 23:16:30,708 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-08-29 23:16:30,708 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 119 flow [2023-08-29 23:16:30,709 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-08-29 23:16:30,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:30,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 23:16:30,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 23:16:30,709 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-08-29 23:16:30,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash 715619205, now seen corresponding path program 1 times [2023-08-29 23:16:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395904285] [2023-08-29 23:16:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395904285] [2023-08-29 23:16:30,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395904285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:30,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:30,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:16:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673808474] [2023-08-29 23:16:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:30,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:16:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:16:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:16:30,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-08-29 23:16:30,839 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-08-29 23:16:30,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:30,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-08-29 23:16:30,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:31,242 INFO L130 PetriNetUnfolder]: 3636/6125 cut-off events. [2023-08-29 23:16:31,243 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-29 23:16:31,249 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-08-29 23:16:31,268 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 34 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-29 23:16:31,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 185 flow [2023-08-29 23:16:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-29 23:16:31,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196408529741863 [2023-08-29 23:16:31,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-29 23:16:31,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-29 23:16:31,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:31,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-29 23:16:31,272 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-08-29 23:16:31,274 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-08-29 23:16:31,274 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-08-29 23:16:31,275 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 119 flow. Second operand 3 states and 463 transitions. [2023-08-29 23:16:31,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 185 flow [2023-08-29 23:16:31,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:16:31,276 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 116 flow [2023-08-29 23:16:31,276 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-08-29 23:16:31,277 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-29 23:16:31,277 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 116 flow [2023-08-29 23:16:31,278 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-08-29 23:16:31,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:31,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 23:16:31,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 23:16:31,278 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-08-29 23:16:31,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash 715619204, now seen corresponding path program 1 times [2023-08-29 23:16:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286562835] [2023-08-29 23:16:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:31,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:31,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286562835] [2023-08-29 23:16:31,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286562835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:31,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:31,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:16:31,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726092065] [2023-08-29 23:16:31,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:31,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:16:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:31,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:16:31,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:16:31,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-08-29 23:16:31,375 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-08-29 23:16:31,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:31,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-08-29 23:16:31,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:31,733 INFO L130 PetriNetUnfolder]: 3546/5957 cut-off events. [2023-08-29 23:16:31,733 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-29 23:16:31,740 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-08-29 23:16:31,758 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 32 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-29 23:16:31,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 178 flow [2023-08-29 23:16:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-29 23:16:31,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500561167227834 [2023-08-29 23:16:31,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-29 23:16:31,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-29 23:16:31,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:31,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-29 23:16:31,762 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-08-29 23:16:31,764 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-08-29 23:16:31,765 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-08-29 23:16:31,765 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 116 flow. Second operand 3 states and 446 transitions. [2023-08-29 23:16:31,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 178 flow [2023-08-29 23:16:31,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:16:31,766 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 113 flow [2023-08-29 23:16:31,766 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-08-29 23:16:31,767 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 23:16:31,767 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 113 flow [2023-08-29 23:16:31,768 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-08-29 23:16:31,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:31,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:16:31,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 23:16:31,768 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-08-29 23:16:31,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 515305849, now seen corresponding path program 1 times [2023-08-29 23:16:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958917741] [2023-08-29 23:16:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958917741] [2023-08-29 23:16:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958917741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:31,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 23:16:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184883402] [2023-08-29 23:16:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:31,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 23:16:31,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:31,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 23:16:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 23:16:31,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 297 [2023-08-29 23:16:31,956 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-08-29 23:16:31,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:31,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 297 [2023-08-29 23:16:31,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:32,281 INFO L130 PetriNetUnfolder]: 2664/4554 cut-off events. [2023-08-29 23:16:32,283 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-29 23:16:32,289 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-08-29 23:16:32,302 INFO L137 encePairwiseOnDemand]: 295/297 looper letters, 31 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-08-29 23:16:32,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 175 flow [2023-08-29 23:16:32,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-29 23:16:32,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713804713804714 [2023-08-29 23:16:32,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-29 23:16:32,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-29 23:16:32,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:32,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-29 23:16:32,307 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-08-29 23:16:32,308 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-08-29 23:16:32,309 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-08-29 23:16:32,309 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 113 flow. Second operand 3 states and 420 transitions. [2023-08-29 23:16:32,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 175 flow [2023-08-29 23:16:32,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 50 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:16:32,311 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-08-29 23:16:32,311 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-08-29 23:16:32,313 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 23:16:32,314 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-08-29 23:16:32,315 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-08-29 23:16:32,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:32,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:16:32,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 23:16:32,316 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-08-29 23:16:32,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 515305850, now seen corresponding path program 1 times [2023-08-29 23:16:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:32,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882553219] [2023-08-29 23:16:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882553219] [2023-08-29 23:16:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882553219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:32,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:32,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:16:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950624197] [2023-08-29 23:16:32,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:32,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:16:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:32,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:16:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:16:32,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 297 [2023-08-29 23:16:32,527 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-08-29 23:16:32,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:32,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 297 [2023-08-29 23:16:32,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:32,774 INFO L130 PetriNetUnfolder]: 1782/3151 cut-off events. [2023-08-29 23:16:32,775 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-29 23:16:32,780 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-08-29 23:16:32,790 INFO L137 encePairwiseOnDemand]: 295/297 looper letters, 30 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-08-29 23:16:32,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 49 transitions, 172 flow [2023-08-29 23:16:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-29 23:16:32,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140291806958474 [2023-08-29 23:16:32,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-29 23:16:32,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-29 23:16:32,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:32,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-29 23:16:32,794 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-08-29 23:16:32,795 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-08-29 23:16:32,796 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-08-29 23:16:32,796 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 458 transitions. [2023-08-29 23:16:32,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 49 transitions, 172 flow [2023-08-29 23:16:32,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:16:32,797 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 111 flow [2023-08-29 23:16:32,798 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-08-29 23:16:32,798 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 23:16:32,798 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 111 flow [2023-08-29 23:16:32,799 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-08-29 23:16:32,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:32,799 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-08-29 23:16:32,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 23:16:32,799 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-08-29 23:16:32,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1851685884, now seen corresponding path program 1 times [2023-08-29 23:16:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517812714] [2023-08-29 23:16:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:33,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517812714] [2023-08-29 23:16:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517812714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:33,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:33,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:16:33,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283106808] [2023-08-29 23:16:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:33,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:16:33,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:33,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:16:33,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:16:33,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:16:33,302 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-08-29 23:16:33,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:33,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:16:33,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:34,157 INFO L130 PetriNetUnfolder]: 4870/7530 cut-off events. [2023-08-29 23:16:34,158 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-29 23:16:34,165 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-08-29 23:16:34,183 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 157 selfloop transitions, 15 changer transitions 25/209 dead transitions. [2023-08-29 23:16:34,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 209 transitions, 851 flow [2023-08-29 23:16:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 23:16:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 23:16:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1661 transitions. [2023-08-29 23:16:34,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084175084175084 [2023-08-29 23:16:34,188 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1661 transitions. [2023-08-29 23:16:34,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1661 transitions. [2023-08-29 23:16:34,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:34,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1661 transitions. [2023-08-29 23:16:34,192 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-08-29 23:16:34,196 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-08-29 23:16:34,198 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-08-29 23:16:34,199 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 111 flow. Second operand 11 states and 1661 transitions. [2023-08-29 23:16:34,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 209 transitions, 851 flow [2023-08-29 23:16:34,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 209 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:16:34,202 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 202 flow [2023-08-29 23:16:34,203 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-08-29 23:16:34,205 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2023-08-29 23:16:34,205 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 202 flow [2023-08-29 23:16:34,206 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-08-29 23:16:34,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:34,206 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-08-29 23:16:34,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 23:16:34,206 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-08-29 23:16:34,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -954322370, now seen corresponding path program 2 times [2023-08-29 23:16:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:34,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827770331] [2023-08-29 23:16:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:34,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:34,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827770331] [2023-08-29 23:16:34,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827770331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:34,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:34,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:16:34,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387949148] [2023-08-29 23:16:34,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:34,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:16:34,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:16:34,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:16:34,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:16:34,990 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-08-29 23:16:34,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:34,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:16:34,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:35,645 INFO L130 PetriNetUnfolder]: 4848/8600 cut-off events. [2023-08-29 23:16:35,645 INFO L131 PetriNetUnfolder]: For 223/225 co-relation queries the response was YES. [2023-08-29 23:16:35,661 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-08-29 23:16:35,686 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 114 selfloop transitions, 18 changer transitions 0/161 dead transitions. [2023-08-29 23:16:35,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 161 transitions, 669 flow [2023-08-29 23:16:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:16:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:16:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1332 transitions. [2023-08-29 23:16:35,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2023-08-29 23:16:35,690 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1332 transitions. [2023-08-29 23:16:35,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1332 transitions. [2023-08-29 23:16:35,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:35,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1332 transitions. [2023-08-29 23:16:35,694 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-08-29 23:16:35,697 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-08-29 23:16:35,697 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-08-29 23:16:35,698 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 202 flow. Second operand 9 states and 1332 transitions. [2023-08-29 23:16:35,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 161 transitions, 669 flow [2023-08-29 23:16:35,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 161 transitions, 665 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 23:16:35,703 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 313 flow [2023-08-29 23:16:35,703 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-08-29 23:16:35,704 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2023-08-29 23:16:35,704 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 313 flow [2023-08-29 23:16:35,705 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-08-29 23:16:35,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:35,705 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-08-29 23:16:35,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 23:16:35,706 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-08-29 23:16:35,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 40937618, now seen corresponding path program 3 times [2023-08-29 23:16:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745086884] [2023-08-29 23:16:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745086884] [2023-08-29 23:16:35,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745086884] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:35,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:35,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 23:16:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78793869] [2023-08-29 23:16:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:35,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:16:35,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:35,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:16:35,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:16:35,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-08-29 23:16:35,843 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-08-29 23:16:35,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:35,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-08-29 23:16:35,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:36,405 INFO L130 PetriNetUnfolder]: 3834/7344 cut-off events. [2023-08-29 23:16:36,405 INFO L131 PetriNetUnfolder]: For 3876/3990 co-relation queries the response was YES. [2023-08-29 23:16:36,427 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-08-29 23:16:36,450 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 56 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-08-29 23:16:36,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 96 transitions, 478 flow [2023-08-29 23:16:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-29 23:16:36,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-08-29 23:16:36,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-29 23:16:36,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-29 23:16:36,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:36,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-29 23:16:36,454 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-08-29 23:16:36,456 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-08-29 23:16:36,457 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-08-29 23:16:36,457 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 313 flow. Second operand 3 states and 479 transitions. [2023-08-29 23:16:36,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 96 transitions, 478 flow [2023-08-29 23:16:36,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 96 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 23:16:36,475 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 323 flow [2023-08-29 23:16:36,475 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-08-29 23:16:36,476 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 17 predicate places. [2023-08-29 23:16:36,476 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 323 flow [2023-08-29 23:16:36,477 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-08-29 23:16:36,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:36,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-08-29 23:16:36,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 23:16:36,477 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-08-29 23:16:36,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:36,478 INFO L85 PathProgramCache]: Analyzing trace with hash 466293516, now seen corresponding path program 4 times [2023-08-29 23:16:36,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:36,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704084111] [2023-08-29 23:16:36,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:36,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:36,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704084111] [2023-08-29 23:16:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704084111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:36,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:36,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:16:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064227221] [2023-08-29 23:16:36,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:36,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:16:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:36,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:16:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:16:37,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:16:37,006 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-08-29 23:16:37,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:37,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:16:37,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:38,025 INFO L130 PetriNetUnfolder]: 7739/13885 cut-off events. [2023-08-29 23:16:38,026 INFO L131 PetriNetUnfolder]: For 7098/7250 co-relation queries the response was YES. [2023-08-29 23:16:38,062 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-08-29 23:16:38,102 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 140 selfloop transitions, 36 changer transitions 2/206 dead transitions. [2023-08-29 23:16:38,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 206 transitions, 1075 flow [2023-08-29 23:16:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:16:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:16:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1347 transitions. [2023-08-29 23:16:38,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5039281705948373 [2023-08-29 23:16:38,106 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1347 transitions. [2023-08-29 23:16:38,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1347 transitions. [2023-08-29 23:16:38,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:38,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1347 transitions. [2023-08-29 23:16:38,110 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-08-29 23:16:38,113 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-08-29 23:16:38,114 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-08-29 23:16:38,114 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 323 flow. Second operand 9 states and 1347 transitions. [2023-08-29 23:16:38,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 206 transitions, 1075 flow [2023-08-29 23:16:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 206 transitions, 1071 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 23:16:38,135 INFO L231 Difference]: Finished difference. Result has 102 places, 117 transitions, 632 flow [2023-08-29 23:16:38,135 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-08-29 23:16:38,136 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 30 predicate places. [2023-08-29 23:16:38,136 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 117 transitions, 632 flow [2023-08-29 23:16:38,136 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-08-29 23:16:38,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:38,137 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-08-29 23:16:38,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 23:16:38,137 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-08-29 23:16:38,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1452945116, now seen corresponding path program 5 times [2023-08-29 23:16:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882786378] [2023-08-29 23:16:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:38,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:38,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882786378] [2023-08-29 23:16:38,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882786378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:38,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:16:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028168870] [2023-08-29 23:16:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:38,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:16:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:38,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:16:38,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:16:38,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:16:38,514 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-08-29 23:16:38,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:38,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:16:38,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:39,123 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-08-29 23:16:39,124 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 23:16:39,124 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 23:16:39,124 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 23:16:39,124 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 23:16:39,217 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-08-29 23:16:39,217 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 23:16:39,217 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 23:16:39,217 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 23:16:39,217 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 23:16:39,218 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-08-29 23:16:39,218 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 23:16:39,218 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 23:16:39,218 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 23:16:39,219 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 23:16:39,219 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-08-29 23:16:39,219 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,219 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,219 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,219 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,283 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-08-29 23:16:39,283 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,283 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,283 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,283 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,284 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-08-29 23:16:39,284 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,284 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,284 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,284 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,284 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 23:16:39,285 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-08-29 23:16:39,285 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,286 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,286 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,286 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,308 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-08-29 23:16:39,308 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,308 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,308 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,308 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,345 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-08-29 23:16:39,345 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,345 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,345 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,345 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 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-08-29 23:16:39,346 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 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-08-29 23:16:39,346 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:16:39,369 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-08-29 23:16:39,369 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,369 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,369 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,369 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,369 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-08-29 23:16:39,370 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,370 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,370 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,370 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,409 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-08-29 23:16:39,409 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,409 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,409 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,410 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,410 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-08-29 23:16:39,410 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,410 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,410 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,410 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,410 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,410 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-08-29 23:16:39,411 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,411 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,411 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,411 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,411 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:16:39,432 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-08-29 23:16:39,432 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,432 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,432 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,432 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,433 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-08-29 23:16:39,433 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,433 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,433 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,433 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,476 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-08-29 23:16:39,476 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,476 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,476 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,476 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,476 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,476 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-08-29 23:16:39,476 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,477 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,477 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,477 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,478 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-08-29 23:16:39,478 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:16:39,494 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-08-29 23:16:39,495 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,495 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,495 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,495 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,495 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-08-29 23:16:39,495 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,495 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,495 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,495 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,550 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-08-29 23:16:39,550 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,550 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,550 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,550 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,551 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,551 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-08-29 23:16:39,551 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,551 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,551 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,551 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,552 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,552 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-08-29 23:16:39,552 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,552 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,552 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,553 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,553 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-08-29 23:16:39,553 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,553 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,553 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,553 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:16:39,554 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-08-29 23:16:39,555 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,555 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,555 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,555 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,575 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-08-29 23:16:39,576 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,576 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,576 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,576 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,576 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-08-29 23:16:39,577 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,577 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,577 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,577 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,640 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-08-29 23:16:39,640 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,640 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,640 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,640 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,641 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,641 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-08-29 23:16:39,641 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,641 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,641 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,641 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,642 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,642 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-08-29 23:16:39,642 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,642 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,642 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,642 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,642 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:16:39,643 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-08-29 23:16:39,644 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,644 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,644 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,644 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,662 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-08-29 23:16:39,663 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,663 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,663 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,663 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,717 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-08-29 23:16:39,717 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,717 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,717 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,717 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,718 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,718 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-08-29 23:16:39,718 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,718 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,718 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,718 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:39,718 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:16:40,388 INFO L130 PetriNetUnfolder]: 10885/17775 cut-off events. [2023-08-29 23:16:40,388 INFO L131 PetriNetUnfolder]: For 20796/21515 co-relation queries the response was YES. [2023-08-29 23:16:40,423 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-08-29 23:16:40,474 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 235 selfloop transitions, 21 changer transitions 34/323 dead transitions. [2023-08-29 23:16:40,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 323 transitions, 2158 flow [2023-08-29 23:16:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 23:16:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 23:16:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1657 transitions. [2023-08-29 23:16:40,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071931435567799 [2023-08-29 23:16:40,479 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1657 transitions. [2023-08-29 23:16:40,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1657 transitions. [2023-08-29 23:16:40,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:40,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1657 transitions. [2023-08-29 23:16:40,484 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-08-29 23:16:40,488 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-08-29 23:16:40,489 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-08-29 23:16:40,489 INFO L175 Difference]: Start difference. First operand has 102 places, 117 transitions, 632 flow. Second operand 11 states and 1657 transitions. [2023-08-29 23:16:40,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 323 transitions, 2158 flow [2023-08-29 23:16:40,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 323 transitions, 2112 flow, removed 23 selfloop flow, removed 0 redundant places. [2023-08-29 23:16:40,565 INFO L231 Difference]: Finished difference. Result has 117 places, 126 transitions, 730 flow [2023-08-29 23:16:40,566 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-08-29 23:16:40,566 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 45 predicate places. [2023-08-29 23:16:40,566 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 126 transitions, 730 flow [2023-08-29 23:16:40,567 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-08-29 23:16:40,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:40,567 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-08-29 23:16:40,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 23:16:40,567 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-08-29 23:16:40,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash 790282874, now seen corresponding path program 6 times [2023-08-29 23:16:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:40,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963505781] [2023-08-29 23:16:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963505781] [2023-08-29 23:16:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963505781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:40,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:40,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 23:16:40,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487018620] [2023-08-29 23:16:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:40,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:16:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:40,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:16:40,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:16:40,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-08-29 23:16:40,713 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-08-29 23:16:40,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:40,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-08-29 23:16:40,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:41,970 INFO L130 PetriNetUnfolder]: 6770/12920 cut-off events. [2023-08-29 23:16:41,970 INFO L131 PetriNetUnfolder]: For 17034/17651 co-relation queries the response was YES. [2023-08-29 23:16:41,995 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-08-29 23:16:42,022 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 96 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2023-08-29 23:16:42,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 160 transitions, 1113 flow [2023-08-29 23:16:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-29 23:16:42,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-08-29 23:16:42,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-29 23:16:42,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-29 23:16:42,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:42,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-29 23:16:42,030 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-08-29 23:16:42,031 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-08-29 23:16:42,032 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-08-29 23:16:42,032 INFO L175 Difference]: Start difference. First operand has 117 places, 126 transitions, 730 flow. Second operand 3 states and 479 transitions. [2023-08-29 23:16:42,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 160 transitions, 1113 flow [2023-08-29 23:16:42,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 160 transitions, 1096 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-29 23:16:42,087 INFO L231 Difference]: Finished difference. Result has 113 places, 126 transitions, 723 flow [2023-08-29 23:16:42,087 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-08-29 23:16:42,088 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 41 predicate places. [2023-08-29 23:16:42,088 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 723 flow [2023-08-29 23:16:42,089 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-08-29 23:16:42,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:42,089 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-08-29 23:16:42,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 23:16:42,089 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-08-29 23:16:42,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -158141900, now seen corresponding path program 7 times [2023-08-29 23:16:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860323717] [2023-08-29 23:16:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:42,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860323717] [2023-08-29 23:16:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860323717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:42,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:16:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837478826] [2023-08-29 23:16:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:42,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:16:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:16:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:16:42,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:16:42,590 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-08-29 23:16:42,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:42,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:16:42,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:44,737 INFO L130 PetriNetUnfolder]: 9578/17477 cut-off events. [2023-08-29 23:16:44,738 INFO L131 PetriNetUnfolder]: For 22147/22664 co-relation queries the response was YES. [2023-08-29 23:16:44,777 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-08-29 23:16:44,819 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 142 selfloop transitions, 45 changer transitions 0/224 dead transitions. [2023-08-29 23:16:44,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 224 transitions, 1499 flow [2023-08-29 23:16:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 23:16:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 23:16:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1205 transitions. [2023-08-29 23:16:44,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071548821548821 [2023-08-29 23:16:44,823 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1205 transitions. [2023-08-29 23:16:44,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1205 transitions. [2023-08-29 23:16:44,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:44,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1205 transitions. [2023-08-29 23:16:44,827 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-08-29 23:16:44,830 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-08-29 23:16:44,831 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-08-29 23:16:44,831 INFO L175 Difference]: Start difference. First operand has 113 places, 126 transitions, 723 flow. Second operand 8 states and 1205 transitions. [2023-08-29 23:16:44,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 224 transitions, 1499 flow [2023-08-29 23:16:44,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 224 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 23:16:44,907 INFO L231 Difference]: Finished difference. Result has 122 places, 140 transitions, 973 flow [2023-08-29 23:16:44,908 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-08-29 23:16:44,908 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 50 predicate places. [2023-08-29 23:16:44,908 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 140 transitions, 973 flow [2023-08-29 23:16:44,915 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-08-29 23:16:44,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:44,915 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-08-29 23:16:44,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 23:16:44,915 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-08-29 23:16:44,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1903921250, now seen corresponding path program 8 times [2023-08-29 23:16:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275874699] [2023-08-29 23:16:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275874699] [2023-08-29 23:16:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275874699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:45,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 23:16:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905645708] [2023-08-29 23:16:45,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:45,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 23:16:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:45,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 23:16:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 23:16:45,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:16:45,395 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-08-29 23:16:45,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:45,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:16:45,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:47,645 INFO L130 PetriNetUnfolder]: 10061/18211 cut-off events. [2023-08-29 23:16:47,646 INFO L131 PetriNetUnfolder]: For 37976/38844 co-relation queries the response was YES. [2023-08-29 23:16:47,697 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-08-29 23:16:47,740 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 135 selfloop transitions, 31 changer transitions 0/206 dead transitions. [2023-08-29 23:16:47,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 206 transitions, 1607 flow [2023-08-29 23:16:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 23:16:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 23:16:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1045 transitions. [2023-08-29 23:16:47,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026455026455027 [2023-08-29 23:16:47,745 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1045 transitions. [2023-08-29 23:16:47,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1045 transitions. [2023-08-29 23:16:47,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:47,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1045 transitions. [2023-08-29 23:16:47,748 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-08-29 23:16:47,751 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-08-29 23:16:47,751 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-08-29 23:16:47,751 INFO L175 Difference]: Start difference. First operand has 122 places, 140 transitions, 973 flow. Second operand 7 states and 1045 transitions. [2023-08-29 23:16:47,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 206 transitions, 1607 flow [2023-08-29 23:16:47,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 206 transitions, 1547 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-29 23:16:47,862 INFO L231 Difference]: Finished difference. Result has 129 places, 153 transitions, 1164 flow [2023-08-29 23:16:47,862 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-08-29 23:16:47,863 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 57 predicate places. [2023-08-29 23:16:47,863 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 153 transitions, 1164 flow [2023-08-29 23:16:47,864 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-08-29 23:16:47,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:47,864 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-08-29 23:16:47,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 23:16:47,864 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-08-29 23:16:47,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:47,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2062195802, now seen corresponding path program 9 times [2023-08-29 23:16:47,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:47,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409327402] [2023-08-29 23:16:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:47,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:48,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409327402] [2023-08-29 23:16:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409327402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:48,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:48,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 23:16:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461122081] [2023-08-29 23:16:48,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:48,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 23:16:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 23:16:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 23:16:48,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:16:48,468 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-08-29 23:16:48,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:48,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:16:48,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:50,554 INFO L130 PetriNetUnfolder]: 11000/20023 cut-off events. [2023-08-29 23:16:50,555 INFO L131 PetriNetUnfolder]: For 49028/50172 co-relation queries the response was YES. [2023-08-29 23:16:50,612 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-08-29 23:16:50,650 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 155 selfloop transitions, 37 changer transitions 0/236 dead transitions. [2023-08-29 23:16:50,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 236 transitions, 2015 flow [2023-08-29 23:16:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 23:16:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 23:16:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1044 transitions. [2023-08-29 23:16:50,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021645021645021 [2023-08-29 23:16:50,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1044 transitions. [2023-08-29 23:16:50,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1044 transitions. [2023-08-29 23:16:50,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:50,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1044 transitions. [2023-08-29 23:16:50,656 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-08-29 23:16:50,658 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-08-29 23:16:50,659 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-08-29 23:16:50,659 INFO L175 Difference]: Start difference. First operand has 129 places, 153 transitions, 1164 flow. Second operand 7 states and 1044 transitions. [2023-08-29 23:16:50,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 236 transitions, 2015 flow [2023-08-29 23:16:50,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1983 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-08-29 23:16:50,835 INFO L231 Difference]: Finished difference. Result has 140 places, 184 transitions, 1580 flow [2023-08-29 23:16:50,836 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-08-29 23:16:50,837 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 68 predicate places. [2023-08-29 23:16:50,837 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 184 transitions, 1580 flow [2023-08-29 23:16:50,837 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-08-29 23:16:50,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:50,838 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-08-29 23:16:50,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 23:16:50,838 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-08-29 23:16:50,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash 261740224, now seen corresponding path program 10 times [2023-08-29 23:16:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:50,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11609289] [2023-08-29 23:16:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11609289] [2023-08-29 23:16:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11609289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:50,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 23:16:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774809802] [2023-08-29 23:16:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:50,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:16:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:16:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:16:50,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 297 [2023-08-29 23:16:50,997 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-08-29 23:16:50,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:50,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 297 [2023-08-29 23:16:50,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:52,995 INFO L130 PetriNetUnfolder]: 9682/18109 cut-off events. [2023-08-29 23:16:52,995 INFO L131 PetriNetUnfolder]: For 59966/61640 co-relation queries the response was YES. [2023-08-29 23:16:53,042 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-08-29 23:16:53,076 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 147 selfloop transitions, 2 changer transitions 1/228 dead transitions. [2023-08-29 23:16:53,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 228 transitions, 2242 flow [2023-08-29 23:16:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:16:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:16:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-29 23:16:53,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375982042648709 [2023-08-29 23:16:53,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-29 23:16:53,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-29 23:16:53,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:53,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-29 23:16:53,080 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-08-29 23:16:53,081 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-08-29 23:16:53,081 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-08-29 23:16:53,082 INFO L175 Difference]: Start difference. First operand has 140 places, 184 transitions, 1580 flow. Second operand 3 states and 479 transitions. [2023-08-29 23:16:53,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 228 transitions, 2242 flow [2023-08-29 23:16:53,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 228 transitions, 2168 flow, removed 37 selfloop flow, removed 0 redundant places. [2023-08-29 23:16:53,249 INFO L231 Difference]: Finished difference. Result has 143 places, 181 transitions, 1493 flow [2023-08-29 23:16:53,249 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-08-29 23:16:53,250 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 71 predicate places. [2023-08-29 23:16:53,250 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 181 transitions, 1493 flow [2023-08-29 23:16:53,250 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-08-29 23:16:53,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:53,250 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-08-29 23:16:53,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 23:16:53,251 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-08-29 23:16:53,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1778272718, now seen corresponding path program 11 times [2023-08-29 23:16:53,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382875048] [2023-08-29 23:16:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:53,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:53,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-08-29 23:16:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382875048] [2023-08-29 23:16:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382875048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:53,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:53,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:16:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059772903] [2023-08-29 23:16:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:53,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:16:53,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:16:53,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:16:53,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:16:53,770 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-08-29 23:16:53,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:53,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:16:53,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:16:56,507 INFO L130 PetriNetUnfolder]: 12990/24156 cut-off events. [2023-08-29 23:16:56,507 INFO L131 PetriNetUnfolder]: For 74618/76037 co-relation queries the response was YES. [2023-08-29 23:16:56,596 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-08-29 23:16:56,647 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 188 selfloop transitions, 58 changer transitions 11/308 dead transitions. [2023-08-29 23:16:56,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 308 transitions, 2759 flow [2023-08-29 23:16:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:16:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:16:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1342 transitions. [2023-08-29 23:16:56,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020576131687243 [2023-08-29 23:16:56,650 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1342 transitions. [2023-08-29 23:16:56,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1342 transitions. [2023-08-29 23:16:56,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:16:56,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1342 transitions. [2023-08-29 23:16:56,653 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-08-29 23:16:56,656 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-08-29 23:16:56,657 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-08-29 23:16:56,657 INFO L175 Difference]: Start difference. First operand has 143 places, 181 transitions, 1493 flow. Second operand 9 states and 1342 transitions. [2023-08-29 23:16:56,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 308 transitions, 2759 flow [2023-08-29 23:16:57,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 308 transitions, 2755 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 23:16:57,008 INFO L231 Difference]: Finished difference. Result has 155 places, 219 transitions, 2066 flow [2023-08-29 23:16:57,008 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-08-29 23:16:57,008 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 83 predicate places. [2023-08-29 23:16:57,008 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 219 transitions, 2066 flow [2023-08-29 23:16:57,009 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-08-29 23:16:57,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:16:57,009 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-08-29 23:16:57,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 23:16:57,009 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-08-29 23:16:57,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:16:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash -279244148, now seen corresponding path program 12 times [2023-08-29 23:16:57,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:16:57,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151564852] [2023-08-29 23:16:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:16:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:16:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:16:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:16:57,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:16:57,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151564852] [2023-08-29 23:16:57,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151564852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:16:57,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:16:57,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:16:57,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227578771] [2023-08-29 23:16:57,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:16:57,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:16:57,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:16:57,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:16:57,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:16:57,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:16:57,618 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-08-29 23:16:57,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:16:57,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:16:57,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:17:01,130 INFO L130 PetriNetUnfolder]: 15865/29258 cut-off events. [2023-08-29 23:17:01,130 INFO L131 PetriNetUnfolder]: For 117945/119327 co-relation queries the response was YES. [2023-08-29 23:17:01,236 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-08-29 23:17:01,303 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 240 selfloop transitions, 90 changer transitions 1/368 dead transitions. [2023-08-29 23:17:01,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 368 transitions, 3750 flow [2023-08-29 23:17:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 23:17:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 23:17:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1634 transitions. [2023-08-29 23:17:01,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5001530456075911 [2023-08-29 23:17:01,307 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1634 transitions. [2023-08-29 23:17:01,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1634 transitions. [2023-08-29 23:17:01,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:17:01,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1634 transitions. [2023-08-29 23:17:01,311 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-08-29 23:17:01,314 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-08-29 23:17:01,315 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-08-29 23:17:01,315 INFO L175 Difference]: Start difference. First operand has 155 places, 219 transitions, 2066 flow. Second operand 11 states and 1634 transitions. [2023-08-29 23:17:01,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 368 transitions, 3750 flow [2023-08-29 23:17:01,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 368 transitions, 3608 flow, removed 71 selfloop flow, removed 0 redundant places. [2023-08-29 23:17:01,607 INFO L231 Difference]: Finished difference. Result has 174 places, 263 transitions, 2830 flow [2023-08-29 23:17:01,607 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-08-29 23:17:01,608 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 102 predicate places. [2023-08-29 23:17:01,608 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 263 transitions, 2830 flow [2023-08-29 23:17:01,608 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-08-29 23:17:01,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:17:01,609 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-08-29 23:17:01,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 23:17:01,609 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-08-29 23:17:01,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:17:01,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1227370186, now seen corresponding path program 13 times [2023-08-29 23:17:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:17:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12313970] [2023-08-29 23:17:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:17:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:17:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:17:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:17:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:17:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12313970] [2023-08-29 23:17:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12313970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:17:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:17:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 23:17:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535941300] [2023-08-29 23:17:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:17:02,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 23:17:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:17:02,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 23:17:02,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-29 23:17:02,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-08-29 23:17:02,191 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-08-29 23:17:02,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:17:02,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-08-29 23:17:02,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:17:05,946 INFO L130 PetriNetUnfolder]: 14729/27266 cut-off events. [2023-08-29 23:17:05,946 INFO L131 PetriNetUnfolder]: For 154713/157847 co-relation queries the response was YES. [2023-08-29 23:17:06,071 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-08-29 23:17:06,139 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 230 selfloop transitions, 37 changer transitions 22/363 dead transitions. [2023-08-29 23:17:06,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 363 transitions, 4060 flow [2023-08-29 23:17:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:17:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:17:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1353 transitions. [2023-08-29 23:17:06,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2023-08-29 23:17:06,142 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1353 transitions. [2023-08-29 23:17:06,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1353 transitions. [2023-08-29 23:17:06,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:17:06,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1353 transitions. [2023-08-29 23:17:06,145 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-08-29 23:17:06,147 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-08-29 23:17:06,148 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-08-29 23:17:06,148 INFO L175 Difference]: Start difference. First operand has 174 places, 263 transitions, 2830 flow. Second operand 9 states and 1353 transitions. [2023-08-29 23:17:06,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 363 transitions, 4060 flow [2023-08-29 23:17:06,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 363 transitions, 3838 flow, removed 111 selfloop flow, removed 0 redundant places. [2023-08-29 23:17:06,668 INFO L231 Difference]: Finished difference. Result has 187 places, 280 transitions, 2982 flow [2023-08-29 23:17:06,669 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-08-29 23:17:06,669 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 115 predicate places. [2023-08-29 23:17:06,669 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 280 transitions, 2982 flow [2023-08-29 23:17:06,669 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-08-29 23:17:06,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:17:06,669 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-08-29 23:17:06,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 23:17:06,670 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-08-29 23:17:06,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:17:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 889321604, now seen corresponding path program 14 times [2023-08-29 23:17:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:17:06,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425426481] [2023-08-29 23:17:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:17:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:17:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:17:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:17:07,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:17:07,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425426481] [2023-08-29 23:17:07,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425426481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:17:07,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:17:07,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:17:07,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566793611] [2023-08-29 23:17:07,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:17:07,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:17:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:17:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:17:07,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:17:07,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-08-29 23:17:07,148 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-08-29 23:17:07,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:17:07,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-08-29 23:17:07,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:17:11,983 INFO L130 PetriNetUnfolder]: 18263/34098 cut-off events. [2023-08-29 23:17:11,984 INFO L131 PetriNetUnfolder]: For 206591/210256 co-relation queries the response was YES. [2023-08-29 23:17:12,160 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-08-29 23:17:12,242 INFO L137 encePairwiseOnDemand]: 288/297 looper letters, 249 selfloop transitions, 81 changer transitions 17/417 dead transitions. [2023-08-29 23:17:12,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 417 transitions, 4700 flow [2023-08-29 23:17:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:17:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:17:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1365 transitions. [2023-08-29 23:17:12,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510662177328844 [2023-08-29 23:17:12,245 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1365 transitions. [2023-08-29 23:17:12,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1365 transitions. [2023-08-29 23:17:12,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:17:12,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1365 transitions. [2023-08-29 23:17:12,248 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-08-29 23:17:12,250 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-08-29 23:17:12,250 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-08-29 23:17:12,251 INFO L175 Difference]: Start difference. First operand has 187 places, 280 transitions, 2982 flow. Second operand 9 states and 1365 transitions. [2023-08-29 23:17:12,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 417 transitions, 4700 flow [2023-08-29 23:17:12,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 417 transitions, 4667 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-29 23:17:12,839 INFO L231 Difference]: Finished difference. Result has 198 places, 300 transitions, 3490 flow [2023-08-29 23:17:12,839 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-08-29 23:17:12,840 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 126 predicate places. [2023-08-29 23:17:12,840 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 300 transitions, 3490 flow [2023-08-29 23:17:12,840 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-08-29 23:17:12,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:17:12,840 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-08-29 23:17:12,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 23:17:12,841 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-08-29 23:17:12,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:17:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1343915178, now seen corresponding path program 15 times [2023-08-29 23:17:12,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:17:12,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652558630] [2023-08-29 23:17:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:17:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:17:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:17:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:17:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:17:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652558630] [2023-08-29 23:17:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652558630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:17:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:17:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:17:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85961020] [2023-08-29 23:17:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:17:13,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:17:13,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:17:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:17:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:17:13,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-08-29 23:17:13,275 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-08-29 23:17:13,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:17:13,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-08-29 23:17:13,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:17:18,521 INFO L130 PetriNetUnfolder]: 18820/34830 cut-off events. [2023-08-29 23:17:18,522 INFO L131 PetriNetUnfolder]: For 243816/247302 co-relation queries the response was YES. [2023-08-29 23:17:18,728 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-08-29 23:17:18,823 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 243 selfloop transitions, 50 changer transitions 16/390 dead transitions. [2023-08-29 23:17:18,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 390 transitions, 4729 flow [2023-08-29 23:17:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 23:17:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 23:17:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1209 transitions. [2023-08-29 23:17:18,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088383838383839 [2023-08-29 23:17:18,826 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1209 transitions. [2023-08-29 23:17:18,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1209 transitions. [2023-08-29 23:17:18,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:17:18,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1209 transitions. [2023-08-29 23:17:18,828 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-08-29 23:17:18,831 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-08-29 23:17:18,831 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-08-29 23:17:18,831 INFO L175 Difference]: Start difference. First operand has 198 places, 300 transitions, 3490 flow. Second operand 8 states and 1209 transitions. [2023-08-29 23:17:18,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 390 transitions, 4729 flow [2023-08-29 23:17:19,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 390 transitions, 4623 flow, removed 41 selfloop flow, removed 3 redundant places. [2023-08-29 23:17:19,592 INFO L231 Difference]: Finished difference. Result has 203 places, 308 transitions, 3693 flow [2023-08-29 23:17:19,592 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-08-29 23:17:19,592 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 131 predicate places. [2023-08-29 23:17:19,593 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 308 transitions, 3693 flow [2023-08-29 23:17:19,593 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-08-29 23:17:19,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:17:19,593 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-08-29 23:17:19,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 23:17:19,594 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-08-29 23:17:19,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:17:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1577385606, now seen corresponding path program 16 times [2023-08-29 23:17:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:17:19,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372633079] [2023-08-29 23:17:19,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:17:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:17:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:17:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:17:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:17:19,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372633079] [2023-08-29 23:17:19,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372633079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:17:19,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:17:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:17:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300726751] [2023-08-29 23:17:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:17:19,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:17:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:17:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:17:19,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:17:19,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:17:19,979 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-08-29 23:17:19,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:17:19,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:17:19,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:17:25,881 INFO L130 PetriNetUnfolder]: 21830/39533 cut-off events. [2023-08-29 23:17:25,881 INFO L131 PetriNetUnfolder]: For 288579/291719 co-relation queries the response was YES. [2023-08-29 23:17:26,162 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-08-29 23:17:26,260 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 310 selfloop transitions, 128 changer transitions 10/493 dead transitions. [2023-08-29 23:17:26,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 493 transitions, 6350 flow [2023-08-29 23:17:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 23:17:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 23:17:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1501 transitions. [2023-08-29 23:17:26,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053872053872054 [2023-08-29 23:17:26,262 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1501 transitions. [2023-08-29 23:17:26,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1501 transitions. [2023-08-29 23:17:26,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:17:26,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1501 transitions. [2023-08-29 23:17:26,264 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-08-29 23:17:26,266 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-08-29 23:17:26,266 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-08-29 23:17:26,266 INFO L175 Difference]: Start difference. First operand has 203 places, 308 transitions, 3693 flow. Second operand 10 states and 1501 transitions. [2023-08-29 23:17:26,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 493 transitions, 6350 flow [2023-08-29 23:17:27,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 493 transitions, 6234 flow, removed 30 selfloop flow, removed 3 redundant places. [2023-08-29 23:17:27,303 INFO L231 Difference]: Finished difference. Result has 217 places, 357 transitions, 4871 flow [2023-08-29 23:17:27,303 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-08-29 23:17:27,304 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 145 predicate places. [2023-08-29 23:17:27,304 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 357 transitions, 4871 flow [2023-08-29 23:17:27,304 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-08-29 23:17:27,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:17:27,304 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-08-29 23:17:27,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 23:17:27,304 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-08-29 23:17:27,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:17:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1056183076, now seen corresponding path program 17 times [2023-08-29 23:17:27,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:17:27,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899911378] [2023-08-29 23:17:27,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:17:27,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:17:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:17:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:17:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:17:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899911378] [2023-08-29 23:17:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899911378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:17:28,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:17:28,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 23:17:28,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521997897] [2023-08-29 23:17:28,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:17:28,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 23:17:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:17:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 23:17:28,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-08-29 23:17:28,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:17:28,108 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-08-29 23:17:28,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:17:28,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:17:28,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:17:36,220 INFO L130 PetriNetUnfolder]: 24810/47361 cut-off events. [2023-08-29 23:17:36,220 INFO L131 PetriNetUnfolder]: For 418607/422204 co-relation queries the response was YES. [2023-08-29 23:17:36,638 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-08-29 23:17:36,758 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 470 selfloop transitions, 156 changer transitions 4/667 dead transitions. [2023-08-29 23:17:36,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 667 transitions, 9147 flow [2023-08-29 23:17:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 23:17:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 23:17:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2929 transitions. [2023-08-29 23:17:36,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930976430976431 [2023-08-29 23:17:36,761 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2929 transitions. [2023-08-29 23:17:36,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2929 transitions. [2023-08-29 23:17:36,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:17:36,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2929 transitions. [2023-08-29 23:17:36,764 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-08-29 23:17:36,767 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-08-29 23:17:36,768 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-08-29 23:17:36,768 INFO L175 Difference]: Start difference. First operand has 217 places, 357 transitions, 4871 flow. Second operand 20 states and 2929 transitions. [2023-08-29 23:17:36,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 667 transitions, 9147 flow [2023-08-29 23:17:39,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 667 transitions, 8740 flow, removed 197 selfloop flow, removed 2 redundant places. [2023-08-29 23:17:39,411 INFO L231 Difference]: Finished difference. Result has 249 places, 443 transitions, 6586 flow [2023-08-29 23:17:39,411 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-08-29 23:17:39,412 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 177 predicate places. [2023-08-29 23:17:39,412 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 443 transitions, 6586 flow [2023-08-29 23:17:39,412 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-08-29 23:17:39,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:17:39,413 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-08-29 23:17:39,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 23:17:39,413 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-08-29 23:17:39,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:17:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1567269094, now seen corresponding path program 18 times [2023-08-29 23:17:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:17:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142066313] [2023-08-29 23:17:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:17:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:17:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:17:39,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-08-29 23:17:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:17:39,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142066313] [2023-08-29 23:17:39,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142066313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:17:39,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:17:39,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 23:17:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555329734] [2023-08-29 23:17:39,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:17:39,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 23:17:39,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:17:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 23:17:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 23:17:39,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-29 23:17:39,867 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-08-29 23:17:39,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:17:39,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-29 23:17:39,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:17:48,161 INFO L130 PetriNetUnfolder]: 22748/42882 cut-off events. [2023-08-29 23:17:48,162 INFO L131 PetriNetUnfolder]: For 498031/500847 co-relation queries the response was YES. [2023-08-29 23:17:48,520 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-08-29 23:17:48,635 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 410 selfloop transitions, 59 changer transitions 4/510 dead transitions. [2023-08-29 23:17:48,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 510 transitions, 7984 flow [2023-08-29 23:17:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 23:17:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 23:17:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1196 transitions. [2023-08-29 23:17:48,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033670033670034 [2023-08-29 23:17:48,653 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1196 transitions. [2023-08-29 23:17:48,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1196 transitions. [2023-08-29 23:17:48,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:17:48,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1196 transitions. [2023-08-29 23:17:48,655 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-08-29 23:17:48,657 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-08-29 23:17:48,657 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-08-29 23:17:48,657 INFO L175 Difference]: Start difference. First operand has 249 places, 443 transitions, 6586 flow. Second operand 8 states and 1196 transitions. [2023-08-29 23:17:48,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 510 transitions, 7984 flow [2023-08-29 23:17:51,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 510 transitions, 7730 flow, removed 127 selfloop flow, removed 2 redundant places. [2023-08-29 23:17:51,015 INFO L231 Difference]: Finished difference. Result has 253 places, 430 transitions, 6279 flow [2023-08-29 23:17:51,015 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-08-29 23:17:51,015 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 181 predicate places. [2023-08-29 23:17:51,015 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 430 transitions, 6279 flow [2023-08-29 23:17:51,016 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-08-29 23:17:51,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:17:51,016 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-08-29 23:17:51,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 23:17:51,016 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-08-29 23:17:51,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:17:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1428394696, now seen corresponding path program 19 times [2023-08-29 23:17:51,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:17:51,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765718083] [2023-08-29 23:17:51,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:17:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:17:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:17:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:17:51,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:17:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765718083] [2023-08-29 23:17:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765718083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:17:51,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:17:51,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:17:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193059140] [2023-08-29 23:17:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:17:51,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:17:51,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:17:51,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:17:51,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:17:51,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-29 23:17:51,589 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-08-29 23:17:51,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:17:51,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-29 23:17:51,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:17:59,840 INFO L130 PetriNetUnfolder]: 23517/43854 cut-off events. [2023-08-29 23:17:59,841 INFO L131 PetriNetUnfolder]: For 495832/499818 co-relation queries the response was YES. [2023-08-29 23:18:00,259 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-08-29 23:18:00,632 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 388 selfloop transitions, 52 changer transitions 23/528 dead transitions. [2023-08-29 23:18:00,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 528 transitions, 8113 flow [2023-08-29 23:18:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:18:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:18:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1346 transitions. [2023-08-29 23:18:00,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035540591096147 [2023-08-29 23:18:00,634 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1346 transitions. [2023-08-29 23:18:00,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1346 transitions. [2023-08-29 23:18:00,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:18:00,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1346 transitions. [2023-08-29 23:18:00,642 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-08-29 23:18:00,646 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-08-29 23:18:00,647 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-08-29 23:18:00,647 INFO L175 Difference]: Start difference. First operand has 253 places, 430 transitions, 6279 flow. Second operand 9 states and 1346 transitions. [2023-08-29 23:18:00,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 528 transitions, 8113 flow [2023-08-29 23:18:02,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 528 transitions, 8034 flow, removed 33 selfloop flow, removed 1 redundant places. [2023-08-29 23:18:02,819 INFO L231 Difference]: Finished difference. Result has 263 places, 429 transitions, 6364 flow [2023-08-29 23:18:02,819 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-08-29 23:18:02,819 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 191 predicate places. [2023-08-29 23:18:02,819 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 429 transitions, 6364 flow [2023-08-29 23:18:02,820 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-08-29 23:18:02,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:18:02,820 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-08-29 23:18:02,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 23:18:02,820 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-08-29 23:18:02,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:18:02,820 INFO L85 PathProgramCache]: Analyzing trace with hash -572934070, now seen corresponding path program 20 times [2023-08-29 23:18:02,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:18:02,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745382724] [2023-08-29 23:18:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:18:02,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:18:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:18:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:18:03,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:18:03,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745382724] [2023-08-29 23:18:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745382724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:18:03,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:18:03,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 23:18:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886224408] [2023-08-29 23:18:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:18:03,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 23:18:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:18:03,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 23:18:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-08-29 23:18:03,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:18:03,296 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-08-29 23:18:03,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:18:03,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:18:03,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:18:12,048 INFO L130 PetriNetUnfolder]: 23678/45028 cut-off events. [2023-08-29 23:18:12,049 INFO L131 PetriNetUnfolder]: For 527474/530750 co-relation queries the response was YES. [2023-08-29 23:18:12,510 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-08-29 23:18:12,880 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 377 selfloop transitions, 28 changer transitions 34/496 dead transitions. [2023-08-29 23:18:12,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 496 transitions, 7716 flow [2023-08-29 23:18:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 23:18:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 23:18:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1455 transitions. [2023-08-29 23:18:12,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2023-08-29 23:18:12,883 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1455 transitions. [2023-08-29 23:18:12,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1455 transitions. [2023-08-29 23:18:12,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:18:12,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1455 transitions. [2023-08-29 23:18:12,887 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-08-29 23:18:12,890 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-08-29 23:18:12,890 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-08-29 23:18:12,890 INFO L175 Difference]: Start difference. First operand has 263 places, 429 transitions, 6364 flow. Second operand 10 states and 1455 transitions. [2023-08-29 23:18:12,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 496 transitions, 7716 flow [2023-08-29 23:18:15,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 496 transitions, 7601 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-08-29 23:18:15,594 INFO L231 Difference]: Finished difference. Result has 271 places, 425 transitions, 6258 flow [2023-08-29 23:18:15,595 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-08-29 23:18:15,595 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 199 predicate places. [2023-08-29 23:18:15,595 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 425 transitions, 6258 flow [2023-08-29 23:18:15,595 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-08-29 23:18:15,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:18:15,596 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-08-29 23:18:15,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 23:18:15,596 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-08-29 23:18:15,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:18:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1815263710, now seen corresponding path program 21 times [2023-08-29 23:18:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:18:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947299930] [2023-08-29 23:18:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:18:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:18:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:18:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:18:16,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:18:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947299930] [2023-08-29 23:18:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947299930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:18:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:18:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 23:18:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198195546] [2023-08-29 23:18:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:18:16,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 23:18:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:18:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 23:18:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-08-29 23:18:16,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-29 23:18:16,169 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-08-29 23:18:16,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:18:16,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-29 23:18:16,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:18:26,334 INFO L130 PetriNetUnfolder]: 23901/45508 cut-off events. [2023-08-29 23:18:26,334 INFO L131 PetriNetUnfolder]: For 549403/553377 co-relation queries the response was YES. [2023-08-29 23:18:26,843 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-08-29 23:18:26,959 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 385 selfloop transitions, 29 changer transitions 47/526 dead transitions. [2023-08-29 23:18:26,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 526 transitions, 8127 flow [2023-08-29 23:18:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:18:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:18:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2023-08-29 23:18:26,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043022820800599 [2023-08-29 23:18:26,960 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1348 transitions. [2023-08-29 23:18:26,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1348 transitions. [2023-08-29 23:18:26,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:18:26,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1348 transitions. [2023-08-29 23:18:26,962 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-08-29 23:18:26,963 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-08-29 23:18:26,963 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-08-29 23:18:26,963 INFO L175 Difference]: Start difference. First operand has 271 places, 425 transitions, 6258 flow. Second operand 9 states and 1348 transitions. [2023-08-29 23:18:26,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 526 transitions, 8127 flow [2023-08-29 23:18:29,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 526 transitions, 8050 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-08-29 23:18:29,397 INFO L231 Difference]: Finished difference. Result has 275 places, 427 transitions, 6376 flow [2023-08-29 23:18:29,398 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-08-29 23:18:29,398 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 203 predicate places. [2023-08-29 23:18:29,398 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 427 transitions, 6376 flow [2023-08-29 23:18:29,398 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-08-29 23:18:29,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:18:29,399 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-08-29 23:18:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 23:18:29,399 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-08-29 23:18:29,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:18:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash -358898564, now seen corresponding path program 22 times [2023-08-29 23:18:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:18:29,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454783655] [2023-08-29 23:18:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:18:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:18:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:18:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:18:29,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:18:29,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454783655] [2023-08-29 23:18:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454783655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:18:29,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:18:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-29 23:18:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126356658] [2023-08-29 23:18:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:18:29,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 23:18:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:18:29,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 23:18:29,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-29 23:18:30,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-29 23:18:30,054 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-08-29 23:18:30,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:18:30,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-29 23:18:30,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:18:39,000 INFO L130 PetriNetUnfolder]: 23431/44326 cut-off events. [2023-08-29 23:18:39,000 INFO L131 PetriNetUnfolder]: For 590299/593892 co-relation queries the response was YES. [2023-08-29 23:18:39,432 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-08-29 23:18:39,548 INFO L137 encePairwiseOnDemand]: 285/297 looper letters, 374 selfloop transitions, 52 changer transitions 11/502 dead transitions. [2023-08-29 23:18:39,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 502 transitions, 7960 flow [2023-08-29 23:18:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 23:18:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 23:18:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1188 transitions. [2023-08-29 23:18:39,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 23:18:39,551 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1188 transitions. [2023-08-29 23:18:39,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1188 transitions. [2023-08-29 23:18:39,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:18:39,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1188 transitions. [2023-08-29 23:18:39,553 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-08-29 23:18:39,554 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-08-29 23:18:39,554 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-08-29 23:18:39,554 INFO L175 Difference]: Start difference. First operand has 275 places, 427 transitions, 6376 flow. Second operand 8 states and 1188 transitions. [2023-08-29 23:18:39,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 502 transitions, 7960 flow [2023-08-29 23:18:42,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 502 transitions, 7834 flow, removed 52 selfloop flow, removed 5 redundant places. [2023-08-29 23:18:42,015 INFO L231 Difference]: Finished difference. Result has 277 places, 429 transitions, 6497 flow [2023-08-29 23:18:42,016 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-08-29 23:18:42,016 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 205 predicate places. [2023-08-29 23:18:42,016 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 429 transitions, 6497 flow [2023-08-29 23:18:42,016 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-08-29 23:18:42,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:18:42,017 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-08-29 23:18:42,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 23:18:42,017 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-08-29 23:18:42,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:18:42,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2020796068, now seen corresponding path program 23 times [2023-08-29 23:18:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:18:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782115338] [2023-08-29 23:18:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:18:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:18:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:18:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:18:42,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:18:42,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782115338] [2023-08-29 23:18:42,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782115338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:18:42,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:18:42,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:18:42,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994048550] [2023-08-29 23:18:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:18:42,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:18:42,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:18:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:18:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:18:42,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 297 [2023-08-29 23:18:42,539 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-08-29 23:18:42,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:18:42,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 297 [2023-08-29 23:18:42,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:18:51,348 INFO L130 PetriNetUnfolder]: 22776/43872 cut-off events. [2023-08-29 23:18:51,349 INFO L131 PetriNetUnfolder]: For 594094/598516 co-relation queries the response was YES. [2023-08-29 23:18:51,767 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-08-29 23:18:51,883 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 358 selfloop transitions, 26 changer transitions 10/481 dead transitions. [2023-08-29 23:18:51,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 481 transitions, 7638 flow [2023-08-29 23:18:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 23:18:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 23:18:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1183 transitions. [2023-08-29 23:18:51,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978956228956229 [2023-08-29 23:18:51,885 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1183 transitions. [2023-08-29 23:18:51,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1183 transitions. [2023-08-29 23:18:51,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:18:51,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1183 transitions. [2023-08-29 23:18:51,886 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-08-29 23:18:51,887 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-08-29 23:18:51,888 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-08-29 23:18:51,888 INFO L175 Difference]: Start difference. First operand has 277 places, 429 transitions, 6497 flow. Second operand 8 states and 1183 transitions. [2023-08-29 23:18:51,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 481 transitions, 7638 flow [2023-08-29 23:18:54,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 481 transitions, 7558 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-29 23:18:54,510 INFO L231 Difference]: Finished difference. Result has 281 places, 427 transitions, 6464 flow [2023-08-29 23:18:54,510 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-08-29 23:18:54,511 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 209 predicate places. [2023-08-29 23:18:54,511 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 427 transitions, 6464 flow [2023-08-29 23:18:54,511 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-08-29 23:18:54,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:18:54,512 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-08-29 23:18:54,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-29 23:18:54,512 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-08-29 23:18:54,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:18:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1389521552, now seen corresponding path program 24 times [2023-08-29 23:18:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:18:54,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942560625] [2023-08-29 23:18:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:18:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:18:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:18:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:18:55,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:18:55,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942560625] [2023-08-29 23:18:55,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942560625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:18:55,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:18:55,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-29 23:18:55,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7213598] [2023-08-29 23:18:55,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:18:55,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 23:18:55,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:18:55,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 23:18:55,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-08-29 23:18:55,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:18:55,165 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-08-29 23:18:55,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:18:55,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:18:55,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:19:04,789 INFO L130 PetriNetUnfolder]: 24808/45958 cut-off events. [2023-08-29 23:19:04,789 INFO L131 PetriNetUnfolder]: For 628389/632377 co-relation queries the response was YES. [2023-08-29 23:19:05,255 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-08-29 23:19:05,373 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 419 selfloop transitions, 76 changer transitions 47/587 dead transitions. [2023-08-29 23:19:05,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 587 transitions, 9371 flow [2023-08-29 23:19:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 23:19:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 23:19:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2190 transitions. [2023-08-29 23:19:05,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49158249158249157 [2023-08-29 23:19:05,376 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2190 transitions. [2023-08-29 23:19:05,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2190 transitions. [2023-08-29 23:19:05,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:19:05,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2190 transitions. [2023-08-29 23:19:05,378 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-08-29 23:19:05,380 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-08-29 23:19:05,380 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-08-29 23:19:05,381 INFO L175 Difference]: Start difference. First operand has 281 places, 427 transitions, 6464 flow. Second operand 15 states and 2190 transitions. [2023-08-29 23:19:05,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 587 transitions, 9371 flow [2023-08-29 23:19:08,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 587 transitions, 9276 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-08-29 23:19:08,222 INFO L231 Difference]: Finished difference. Result has 301 places, 459 transitions, 7327 flow [2023-08-29 23:19:08,222 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-08-29 23:19:08,223 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 229 predicate places. [2023-08-29 23:19:08,223 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 459 transitions, 7327 flow [2023-08-29 23:19:08,223 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-08-29 23:19:08,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:19:08,223 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-08-29 23:19:08,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-29 23:19:08,223 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-08-29 23:19:08,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:19:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash -625008696, now seen corresponding path program 25 times [2023-08-29 23:19:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:19:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476432723] [2023-08-29 23:19:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:19:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:19:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:19:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:19:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:19:08,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476432723] [2023-08-29 23:19:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476432723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:19:08,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:19:08,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 23:19:08,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264229706] [2023-08-29 23:19:08,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:19:08,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 23:19:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:19:08,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 23:19:08,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-29 23:19:08,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:19:08,627 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-08-29 23:19:08,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:19:08,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:19:08,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:19:19,654 INFO L130 PetriNetUnfolder]: 26577/50165 cut-off events. [2023-08-29 23:19:19,654 INFO L131 PetriNetUnfolder]: For 728834/732104 co-relation queries the response was YES. [2023-08-29 23:19:20,252 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-08-29 23:19:20,384 INFO L137 encePairwiseOnDemand]: 285/297 looper letters, 455 selfloop transitions, 151 changer transitions 7/650 dead transitions. [2023-08-29 23:19:20,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 650 transitions, 11097 flow [2023-08-29 23:19:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 23:19:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 23:19:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1626 transitions. [2023-08-29 23:19:20,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49770431588613406 [2023-08-29 23:19:20,387 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1626 transitions. [2023-08-29 23:19:20,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1626 transitions. [2023-08-29 23:19:20,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:19:20,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1626 transitions. [2023-08-29 23:19:20,389 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-08-29 23:19:20,391 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-08-29 23:19:20,392 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-08-29 23:19:20,392 INFO L175 Difference]: Start difference. First operand has 301 places, 459 transitions, 7327 flow. Second operand 11 states and 1626 transitions. [2023-08-29 23:19:20,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 650 transitions, 11097 flow [2023-08-29 23:19:24,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 650 transitions, 10862 flow, removed 110 selfloop flow, removed 4 redundant places. [2023-08-29 23:19:24,361 INFO L231 Difference]: Finished difference. Result has 314 places, 511 transitions, 8752 flow [2023-08-29 23:19:24,361 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-08-29 23:19:24,362 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 242 predicate places. [2023-08-29 23:19:24,362 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 511 transitions, 8752 flow [2023-08-29 23:19:24,362 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-08-29 23:19:24,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:19:24,363 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-08-29 23:19:24,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-29 23:19:24,363 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-08-29 23:19:24,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:19:24,363 INFO L85 PathProgramCache]: Analyzing trace with hash -69946838, now seen corresponding path program 26 times [2023-08-29 23:19:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:19:24,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579205044] [2023-08-29 23:19:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:19:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:19:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:19:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:19:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:19:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579205044] [2023-08-29 23:19:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579205044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:19:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:19:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:19:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515371225] [2023-08-29 23:19:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:19:25,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:19:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:19:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:19:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:19:25,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:19:25,104 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-08-29 23:19:25,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:19:25,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:19:25,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:19:37,544 INFO L130 PetriNetUnfolder]: 28508/53648 cut-off events. [2023-08-29 23:19:37,544 INFO L131 PetriNetUnfolder]: For 876456/880274 co-relation queries the response was YES. [2023-08-29 23:19:38,263 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-08-29 23:19:38,407 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 430 selfloop transitions, 186 changer transitions 16/669 dead transitions. [2023-08-29 23:19:38,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 669 transitions, 11802 flow [2023-08-29 23:19:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 23:19:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 23:19:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1784 transitions. [2023-08-29 23:19:38,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500561167227834 [2023-08-29 23:19:38,409 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1784 transitions. [2023-08-29 23:19:38,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1784 transitions. [2023-08-29 23:19:38,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:19:38,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1784 transitions. [2023-08-29 23:19:38,411 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-08-29 23:19:38,413 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-08-29 23:19:38,414 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-08-29 23:19:38,414 INFO L175 Difference]: Start difference. First operand has 314 places, 511 transitions, 8752 flow. Second operand 12 states and 1784 transitions. [2023-08-29 23:19:38,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 669 transitions, 11802 flow [2023-08-29 23:19:43,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 669 transitions, 11577 flow, removed 108 selfloop flow, removed 1 redundant places. [2023-08-29 23:19:43,194 INFO L231 Difference]: Finished difference. Result has 331 places, 532 transitions, 9630 flow [2023-08-29 23:19:43,195 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-08-29 23:19:43,195 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 259 predicate places. [2023-08-29 23:19:43,195 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 532 transitions, 9630 flow [2023-08-29 23:19:43,196 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-08-29 23:19:43,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:19:43,196 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-08-29 23:19:43,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-29 23:19:43,196 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-08-29 23:19:43,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:19:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1720644982, now seen corresponding path program 27 times [2023-08-29 23:19:43,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:19:43,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434017302] [2023-08-29 23:19:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:19:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:19:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:19:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:19:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:19:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434017302] [2023-08-29 23:19:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434017302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:19:43,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:19:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 23:19:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279721998] [2023-08-29 23:19:43,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:19:43,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 23:19:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:19:43,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 23:19:43,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-08-29 23:19:43,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:19:43,950 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-08-29 23:19:43,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:19:43,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:19:43,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:19:57,451 INFO L130 PetriNetUnfolder]: 29140/55637 cut-off events. [2023-08-29 23:19:57,451 INFO L131 PetriNetUnfolder]: For 1039287/1042052 co-relation queries the response was YES. [2023-08-29 23:19:58,238 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-08-29 23:19:58,390 INFO L137 encePairwiseOnDemand]: 281/297 looper letters, 473 selfloop transitions, 159 changer transitions 12/681 dead transitions. [2023-08-29 23:19:58,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 681 transitions, 12956 flow [2023-08-29 23:19:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 23:19:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 23:19:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1513 transitions. [2023-08-29 23:19:58,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094276094276095 [2023-08-29 23:19:58,392 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1513 transitions. [2023-08-29 23:19:58,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1513 transitions. [2023-08-29 23:19:58,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:19:58,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1513 transitions. [2023-08-29 23:19:58,398 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-08-29 23:19:58,400 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-08-29 23:19:58,400 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-08-29 23:19:58,400 INFO L175 Difference]: Start difference. First operand has 331 places, 532 transitions, 9630 flow. Second operand 10 states and 1513 transitions. [2023-08-29 23:19:58,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 681 transitions, 12956 flow [2023-08-29 23:20:04,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 681 transitions, 12747 flow, removed 94 selfloop flow, removed 2 redundant places. [2023-08-29 23:20:04,139 INFO L231 Difference]: Finished difference. Result has 345 places, 562 transitions, 10797 flow [2023-08-29 23:20:04,140 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-08-29 23:20:04,140 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 273 predicate places. [2023-08-29 23:20:04,140 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 562 transitions, 10797 flow [2023-08-29 23:20:04,141 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-08-29 23:20:04,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:20:04,141 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-08-29 23:20:04,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-29 23:20:04,141 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-08-29 23:20:04,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:20:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1126259404, now seen corresponding path program 28 times [2023-08-29 23:20:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:20:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582199413] [2023-08-29 23:20:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:20:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:20:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:20:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:20:04,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:20:04,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582199413] [2023-08-29 23:20:04,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582199413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:20:04,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:20:04,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:20:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602553263] [2023-08-29 23:20:04,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:20:04,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:20:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:20:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:20:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:20:04,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:20:04,612 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-08-29 23:20:04,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:20:04,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:20:04,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:20:20,333 INFO L130 PetriNetUnfolder]: 28545/54439 cut-off events. [2023-08-29 23:20:20,334 INFO L131 PetriNetUnfolder]: For 1100473/1105227 co-relation queries the response was YES. [2023-08-29 23:20:21,235 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-08-29 23:20:21,399 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 485 selfloop transitions, 84 changer transitions 8/640 dead transitions. [2023-08-29 23:20:21,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 640 transitions, 12541 flow [2023-08-29 23:20:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:20:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:20:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1333 transitions. [2023-08-29 23:20:21,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986906098017209 [2023-08-29 23:20:21,402 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1333 transitions. [2023-08-29 23:20:21,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1333 transitions. [2023-08-29 23:20:21,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:20:21,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1333 transitions. [2023-08-29 23:20:21,404 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-08-29 23:20:21,405 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-08-29 23:20:21,406 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-08-29 23:20:21,406 INFO L175 Difference]: Start difference. First operand has 345 places, 562 transitions, 10797 flow. Second operand 9 states and 1333 transitions. [2023-08-29 23:20:21,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 640 transitions, 12541 flow [2023-08-29 23:20:28,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 640 transitions, 12409 flow, removed 66 selfloop flow, removed 0 redundant places. [2023-08-29 23:20:28,023 INFO L231 Difference]: Finished difference. Result has 356 places, 563 transitions, 10852 flow [2023-08-29 23:20:28,023 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-08-29 23:20:28,024 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 284 predicate places. [2023-08-29 23:20:28,024 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 563 transitions, 10852 flow [2023-08-29 23:20:28,024 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-08-29 23:20:28,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:20:28,024 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-08-29 23:20:28,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-29 23:20:28,025 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-08-29 23:20:28,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:20:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1313248250, now seen corresponding path program 29 times [2023-08-29 23:20:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:20:28,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901156134] [2023-08-29 23:20:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:20:28,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:20:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:20:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:20:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:20:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901156134] [2023-08-29 23:20:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901156134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:20:28,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:20:28,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-29 23:20:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366099894] [2023-08-29 23:20:28,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:20:28,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 23:20:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:20:28,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 23:20:28,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-08-29 23:20:28,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:20:28,555 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-08-29 23:20:28,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:20:28,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:20:28,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:20:47,682 INFO L130 PetriNetUnfolder]: 37115/70027 cut-off events. [2023-08-29 23:20:47,682 INFO L131 PetriNetUnfolder]: For 1502858/1508385 co-relation queries the response was YES. [2023-08-29 23:20:48,990 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-08-29 23:20:49,473 INFO L137 encePairwiseOnDemand]: 282/297 looper letters, 630 selfloop transitions, 252 changer transitions 40/959 dead transitions. [2023-08-29 23:20:49,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 959 transitions, 19968 flow [2023-08-29 23:20:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 23:20:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 23:20:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1786 transitions. [2023-08-29 23:20:49,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011223344556678 [2023-08-29 23:20:49,475 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1786 transitions. [2023-08-29 23:20:49,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1786 transitions. [2023-08-29 23:20:49,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:20:49,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1786 transitions. [2023-08-29 23:20:49,478 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-08-29 23:20:49,480 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-08-29 23:20:49,480 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-08-29 23:20:49,481 INFO L175 Difference]: Start difference. First operand has 356 places, 563 transitions, 10852 flow. Second operand 12 states and 1786 transitions. [2023-08-29 23:20:49,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 959 transitions, 19968 flow [2023-08-29 23:20:58,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 959 transitions, 19852 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-29 23:20:58,192 INFO L231 Difference]: Finished difference. Result has 376 places, 762 transitions, 16551 flow [2023-08-29 23:20:58,192 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-08-29 23:20:58,193 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 304 predicate places. [2023-08-29 23:20:58,193 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 762 transitions, 16551 flow [2023-08-29 23:20:58,193 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-08-29 23:20:58,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:20:58,193 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-08-29 23:20:58,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-29 23:20:58,193 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-08-29 23:20:58,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:20:58,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1223009686, now seen corresponding path program 30 times [2023-08-29 23:20:58,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:20:58,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016387061] [2023-08-29 23:20:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:20:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:20:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:20:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:20:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:20:58,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016387061] [2023-08-29 23:20:58,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016387061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:20:58,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:20:58,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-29 23:20:58,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630909306] [2023-08-29 23:20:58,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:20:58,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 23:20:58,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:20:58,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 23:20:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-08-29 23:20:58,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:20:58,734 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-08-29 23:20:58,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:20:58,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:20:58,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:21:23,750 INFO L130 PetriNetUnfolder]: 41789/79828 cut-off events. [2023-08-29 23:21:23,750 INFO L131 PetriNetUnfolder]: For 1946257/1953427 co-relation queries the response was YES. [2023-08-29 23:21:25,295 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-08-29 23:21:25,541 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 757 selfloop transitions, 216 changer transitions 51/1061 dead transitions. [2023-08-29 23:21:25,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1061 transitions, 22950 flow [2023-08-29 23:21:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-29 23:21:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-29 23:21:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2499 transitions. [2023-08-29 23:21:25,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2023-08-29 23:21:25,543 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2499 transitions. [2023-08-29 23:21:25,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2499 transitions. [2023-08-29 23:21:25,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:21:25,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2499 transitions. [2023-08-29 23:21:25,546 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-08-29 23:21:25,549 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-08-29 23:21:25,550 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-08-29 23:21:25,550 INFO L175 Difference]: Start difference. First operand has 376 places, 762 transitions, 16551 flow. Second operand 17 states and 2499 transitions. [2023-08-29 23:21:25,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 1061 transitions, 22950 flow [2023-08-29 23:21:40,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1061 transitions, 22522 flow, removed 214 selfloop flow, removed 2 redundant places. [2023-08-29 23:21:40,654 INFO L231 Difference]: Finished difference. Result has 399 places, 794 transitions, 18091 flow [2023-08-29 23:21:40,655 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-08-29 23:21:40,656 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 327 predicate places. [2023-08-29 23:21:40,656 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 794 transitions, 18091 flow [2023-08-29 23:21:40,656 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-08-29 23:21:40,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:21:40,657 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-08-29 23:21:40,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-29 23:21:40,657 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-08-29 23:21:40,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:21:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1163369418, now seen corresponding path program 31 times [2023-08-29 23:21:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:21:40,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180304055] [2023-08-29 23:21:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:21:40,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:21:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:21:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:21:40,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:21:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180304055] [2023-08-29 23:21:40,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180304055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:21:40,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:21:40,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:21:40,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117983532] [2023-08-29 23:21:40,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:21:40,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:21:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:21:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:21:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:21:40,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:21:40,983 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-08-29 23:21:40,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:21:40,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:21:40,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:22:08,918 INFO L130 PetriNetUnfolder]: 42420/81564 cut-off events. [2023-08-29 23:22:08,918 INFO L131 PetriNetUnfolder]: For 2048941/2056671 co-relation queries the response was YES. [2023-08-29 23:22:10,733 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-08-29 23:22:11,003 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 506 selfloop transitions, 378 changer transitions 12/967 dead transitions. [2023-08-29 23:22:11,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 967 transitions, 22179 flow [2023-08-29 23:22:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 23:22:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 23:22:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1520 transitions. [2023-08-29 23:22:11,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117845117845118 [2023-08-29 23:22:11,004 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1520 transitions. [2023-08-29 23:22:11,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1520 transitions. [2023-08-29 23:22:11,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:22:11,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1520 transitions. [2023-08-29 23:22:11,007 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-08-29 23:22:11,009 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-08-29 23:22:11,009 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-08-29 23:22:11,009 INFO L175 Difference]: Start difference. First operand has 399 places, 794 transitions, 18091 flow. Second operand 10 states and 1520 transitions. [2023-08-29 23:22:11,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 967 transitions, 22179 flow [2023-08-29 23:22:25,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 967 transitions, 21766 flow, removed 183 selfloop flow, removed 7 redundant places. [2023-08-29 23:22:25,382 INFO L231 Difference]: Finished difference. Result has 400 places, 804 transitions, 19082 flow [2023-08-29 23:22:25,382 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-08-29 23:22:25,382 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 328 predicate places. [2023-08-29 23:22:25,382 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 804 transitions, 19082 flow [2023-08-29 23:22:25,383 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-08-29 23:22:25,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:22:25,383 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-08-29 23:22:25,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-29 23:22:25,383 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-08-29 23:22:25,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:22:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash 860080012, now seen corresponding path program 32 times [2023-08-29 23:22:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:22:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230035943] [2023-08-29 23:22:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:22:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:22:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:22:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:22:26,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:22:26,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230035943] [2023-08-29 23:22:26,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230035943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:22:26,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:22:26,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-29 23:22:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175011952] [2023-08-29 23:22:26,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:22:26,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 23:22:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:22:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 23:22:26,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-08-29 23:22:26,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:22:26,150 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-08-29 23:22:26,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:22:26,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:22:26,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:22:53,737 INFO L130 PetriNetUnfolder]: 42785/80685 cut-off events. [2023-08-29 23:22:53,737 INFO L131 PetriNetUnfolder]: For 2124674/2132679 co-relation queries the response was YES. [2023-08-29 23:22:55,523 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-08-29 23:22:55,780 INFO L137 encePairwiseOnDemand]: 284/297 looper letters, 713 selfloop transitions, 115 changer transitions 35/900 dead transitions. [2023-08-29 23:22:55,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 900 transitions, 21889 flow [2023-08-29 23:22:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 23:22:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 23:22:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1729 transitions. [2023-08-29 23:22:55,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851290684624018 [2023-08-29 23:22:55,782 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1729 transitions. [2023-08-29 23:22:55,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1729 transitions. [2023-08-29 23:22:55,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:22:55,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1729 transitions. [2023-08-29 23:22:55,785 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-08-29 23:22:55,788 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-08-29 23:22:55,788 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-08-29 23:22:55,788 INFO L175 Difference]: Start difference. First operand has 400 places, 804 transitions, 19082 flow. Second operand 12 states and 1729 transitions. [2023-08-29 23:22:55,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 900 transitions, 21889 flow [2023-08-29 23:23:10,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 900 transitions, 21713 flow, removed 56 selfloop flow, removed 2 redundant places. [2023-08-29 23:23:10,298 INFO L231 Difference]: Finished difference. Result has 415 places, 808 transitions, 19355 flow [2023-08-29 23:23:10,299 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-08-29 23:23:10,299 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 343 predicate places. [2023-08-29 23:23:10,300 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 808 transitions, 19355 flow [2023-08-29 23:23:10,300 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-08-29 23:23:10,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:23:10,300 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-08-29 23:23:10,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-29 23:23:10,300 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-08-29 23:23:10,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:23:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1677343552, now seen corresponding path program 33 times [2023-08-29 23:23:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:23:10,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821873825] [2023-08-29 23:23:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:23:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:23:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:23:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:23:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:23:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821873825] [2023-08-29 23:23:11,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821873825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:23:11,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:23:11,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-29 23:23:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140039894] [2023-08-29 23:23:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:23:11,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 23:23:11,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:23:11,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 23:23:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-08-29 23:23:11,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:23:11,123 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-08-29 23:23:11,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:23:11,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:23:11,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:23:38,615 INFO L130 PetriNetUnfolder]: 41838/79467 cut-off events. [2023-08-29 23:23:38,615 INFO L131 PetriNetUnfolder]: For 2114936/2122104 co-relation queries the response was YES. [2023-08-29 23:23:40,449 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-08-29 23:23:40,717 INFO L137 encePairwiseOnDemand]: 283/297 looper letters, 665 selfloop transitions, 166 changer transitions 25/908 dead transitions. [2023-08-29 23:23:40,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 908 transitions, 22071 flow [2023-08-29 23:23:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 23:23:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 23:23:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1639 transitions. [2023-08-29 23:23:40,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016835016835017 [2023-08-29 23:23:40,719 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1639 transitions. [2023-08-29 23:23:40,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1639 transitions. [2023-08-29 23:23:40,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:23:40,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1639 transitions. [2023-08-29 23:23:40,720 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-08-29 23:23:40,722 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-08-29 23:23:40,722 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-08-29 23:23:40,723 INFO L175 Difference]: Start difference. First operand has 415 places, 808 transitions, 19355 flow. Second operand 11 states and 1639 transitions. [2023-08-29 23:23:40,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 908 transitions, 22071 flow [2023-08-29 23:23:55,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 908 transitions, 21773 flow, removed 63 selfloop flow, removed 11 redundant places. [2023-08-29 23:23:55,797 INFO L231 Difference]: Finished difference. Result has 413 places, 795 transitions, 19299 flow [2023-08-29 23:23:55,797 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-08-29 23:23:55,798 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 341 predicate places. [2023-08-29 23:23:55,798 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 795 transitions, 19299 flow [2023-08-29 23:23:55,798 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-08-29 23:23:55,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:23:55,798 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-08-29 23:23:55,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-29 23:23:55,798 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-08-29 23:23:55,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:23:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1420984084, now seen corresponding path program 34 times [2023-08-29 23:23:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:23:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926108516] [2023-08-29 23:23:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:23:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:23:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:23:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:23:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:23:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926108516] [2023-08-29 23:23:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926108516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:23:56,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:23:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-29 23:23:56,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475258437] [2023-08-29 23:23:56,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:23:56,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 23:23:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:23:56,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 23:23:56,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 23:23:56,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-29 23:23:56,224 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-08-29 23:23:56,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:23:56,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-29 23:23:56,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:24:25,605 INFO L130 PetriNetUnfolder]: 41779/79815 cut-off events. [2023-08-29 23:24:25,605 INFO L131 PetriNetUnfolder]: For 2086148/2093519 co-relation queries the response was YES. [2023-08-29 23:24:27,445 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-08-29 23:24:27,953 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 740 selfloop transitions, 5 changer transitions 73/855 dead transitions. [2023-08-29 23:24:27,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 855 transitions, 21492 flow [2023-08-29 23:24:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 23:24:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 23:24:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1424 transitions. [2023-08-29 23:24:27,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794612794612795 [2023-08-29 23:24:27,955 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1424 transitions. [2023-08-29 23:24:27,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1424 transitions. [2023-08-29 23:24:27,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:24:27,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1424 transitions. [2023-08-29 23:24:27,957 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-08-29 23:24:27,958 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-08-29 23:24:27,958 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-08-29 23:24:27,958 INFO L175 Difference]: Start difference. First operand has 413 places, 795 transitions, 19299 flow. Second operand 10 states and 1424 transitions. [2023-08-29 23:24:27,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 855 transitions, 21492 flow [2023-08-29 23:24:41,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 855 transitions, 21255 flow, removed 100 selfloop flow, removed 5 redundant places. [2023-08-29 23:24:41,538 INFO L231 Difference]: Finished difference. Result has 417 places, 777 transitions, 18595 flow [2023-08-29 23:24:41,539 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-08-29 23:24:41,539 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 345 predicate places. [2023-08-29 23:24:41,539 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 777 transitions, 18595 flow [2023-08-29 23:24:41,540 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-08-29 23:24:41,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:24:41,540 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-08-29 23:24:41,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-29 23:24:41,540 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-08-29 23:24:41,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:24:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1565792504, now seen corresponding path program 35 times [2023-08-29 23:24:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:24:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487869304] [2023-08-29 23:24:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:24:41,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:24:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:24:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:24:41,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:24:41,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487869304] [2023-08-29 23:24:41,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487869304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:24:41,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:24:41,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 23:24:41,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544380794] [2023-08-29 23:24:41,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:24:41,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 23:24:41,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:24:41,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 23:24:41,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 23:24:41,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-08-29 23:24:41,945 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-08-29 23:24:41,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:24:41,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-08-29 23:24:41,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:25:06,311 INFO L130 PetriNetUnfolder]: 38987/75216 cut-off events. [2023-08-29 23:25:06,312 INFO L131 PetriNetUnfolder]: For 1972099/1980447 co-relation queries the response was YES. [2023-08-29 23:25:07,867 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-08-29 23:25:08,111 INFO L137 encePairwiseOnDemand]: 287/297 looper letters, 622 selfloop transitions, 46 changer transitions 7/804 dead transitions. [2023-08-29 23:25:08,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 804 transitions, 20114 flow [2023-08-29 23:25:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 23:25:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 23:25:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2023-08-29 23:25:08,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067340067340067 [2023-08-29 23:25:08,113 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2023-08-29 23:25:08,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2023-08-29 23:25:08,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:25:08,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2023-08-29 23:25:08,114 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-08-29 23:25:08,115 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-08-29 23:25:08,116 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-08-29 23:25:08,116 INFO L175 Difference]: Start difference. First operand has 417 places, 777 transitions, 18595 flow. Second operand 6 states and 903 transitions. [2023-08-29 23:25:08,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 804 transitions, 20114 flow [2023-08-29 23:25:20,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 804 transitions, 19776 flow, removed 70 selfloop flow, removed 10 redundant places. [2023-08-29 23:25:20,180 INFO L231 Difference]: Finished difference. Result has 401 places, 772 transitions, 18261 flow [2023-08-29 23:25:20,180 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-08-29 23:25:20,180 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 329 predicate places. [2023-08-29 23:25:20,181 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 772 transitions, 18261 flow [2023-08-29 23:25:20,181 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-08-29 23:25:20,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:25:20,181 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-08-29 23:25:20,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-29 23:25:20,181 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-08-29 23:25:20,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:25:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1544462392, now seen corresponding path program 36 times [2023-08-29 23:25:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:25:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765505247] [2023-08-29 23:25:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:25:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:25:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:25:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:25:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:25:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765505247] [2023-08-29 23:25:20,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765505247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:25:20,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:25:20,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:25:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902904956] [2023-08-29 23:25:20,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:25:20,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:25:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:25:20,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:25:20,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:25:20,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:25:20,394 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-08-29 23:25:20,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:25:20,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:25:20,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:25:58,388 INFO L130 PetriNetUnfolder]: 67781/111401 cut-off events. [2023-08-29 23:25:58,388 INFO L131 PetriNetUnfolder]: For 2515015/2519281 co-relation queries the response was YES. [2023-08-29 23:26:00,657 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-08-29 23:26:00,980 INFO L137 encePairwiseOnDemand]: 289/297 looper letters, 1027 selfloop transitions, 25 changer transitions 334/1573 dead transitions. [2023-08-29 23:26:00,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1573 transitions, 37463 flow [2023-08-29 23:26:00,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 23:26:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 23:26:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1655 transitions. [2023-08-29 23:26:00,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065809611264157 [2023-08-29 23:26:00,982 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1655 transitions. [2023-08-29 23:26:00,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1655 transitions. [2023-08-29 23:26:00,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:00,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1655 transitions. [2023-08-29 23:26:00,984 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-08-29 23:26:00,985 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-08-29 23:26:00,986 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-08-29 23:26:00,986 INFO L175 Difference]: Start difference. First operand has 401 places, 772 transitions, 18261 flow. Second operand 11 states and 1655 transitions. [2023-08-29 23:26:00,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 1573 transitions, 37463 flow [2023-08-29 23:26:19,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 1573 transitions, 37271 flow, removed 34 selfloop flow, removed 5 redundant places. [2023-08-29 23:26:19,324 INFO L231 Difference]: Finished difference. Result has 411 places, 758 transitions, 17656 flow [2023-08-29 23:26:19,324 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-08-29 23:26:19,325 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 339 predicate places. [2023-08-29 23:26:19,325 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 758 transitions, 17656 flow [2023-08-29 23:26:19,325 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-08-29 23:26:19,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:19,326 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-08-29 23:26:19,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-29 23:26:19,326 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-08-29 23:26:19,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1196879374, now seen corresponding path program 37 times [2023-08-29 23:26:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:26:19,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204544972] [2023-08-29 23:26:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:26:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:19,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:26:19,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204544972] [2023-08-29 23:26:19,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204544972] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:19,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 23:26:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7878768] [2023-08-29 23:26:19,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:19,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 23:26:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:26:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 23:26:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 23:26:19,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-29 23:26:19,917 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-08-29 23:26:19,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:19,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-29 23:26:19,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:44,409 INFO L130 PetriNetUnfolder]: 39482/76002 cut-off events. [2023-08-29 23:26:44,409 INFO L131 PetriNetUnfolder]: For 1902102/1910224 co-relation queries the response was YES. [2023-08-29 23:26:46,019 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-08-29 23:26:46,253 INFO L137 encePairwiseOnDemand]: 286/297 looper letters, 611 selfloop transitions, 34 changer transitions 8/778 dead transitions. [2023-08-29 23:26:46,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 778 transitions, 19107 flow [2023-08-29 23:26:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 23:26:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 23:26:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2023-08-29 23:26:46,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2023-08-29 23:26:46,255 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 740 transitions. [2023-08-29 23:26:46,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 740 transitions. [2023-08-29 23:26:46,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:46,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 740 transitions. [2023-08-29 23:26:46,256 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-08-29 23:26:46,256 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-08-29 23:26:46,256 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-08-29 23:26:46,256 INFO L175 Difference]: Start difference. First operand has 411 places, 758 transitions, 17656 flow. Second operand 5 states and 740 transitions. [2023-08-29 23:26:46,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 778 transitions, 19107 flow [2023-08-29 23:26:59,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 778 transitions, 18975 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-08-29 23:26:59,272 INFO L231 Difference]: Finished difference. Result has 411 places, 752 transitions, 17421 flow [2023-08-29 23:26:59,272 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-08-29 23:26:59,272 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 339 predicate places. [2023-08-29 23:26:59,272 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 752 transitions, 17421 flow [2023-08-29 23:26:59,273 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-08-29 23:26:59,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:59,273 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-08-29 23:26:59,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-29 23:26:59,273 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-08-29 23:26:59,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1426013920, now seen corresponding path program 38 times [2023-08-29 23:26:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:26:59,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435952854] [2023-08-29 23:26:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:59,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:26:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:27:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:27:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:27:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435952854] [2023-08-29 23:27:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435952854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:27:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:27:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:27:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897074028] [2023-08-29 23:27:00,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:27:00,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:27:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:27:00,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:27:00,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:27:00,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 297 [2023-08-29 23:27:00,152 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-08-29 23:27:00,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:27:00,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 297 [2023-08-29 23:27:00,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:27:26,206 INFO L130 PetriNetUnfolder]: 39811/77195 cut-off events. [2023-08-29 23:27:26,207 INFO L131 PetriNetUnfolder]: For 1954711/1963541 co-relation queries the response was YES. [2023-08-29 23:27:28,658 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-08-29 23:27:28,953 INFO L137 encePairwiseOnDemand]: 285/297 looper letters, 606 selfloop transitions, 79 changer transitions 8/813 dead transitions. [2023-08-29 23:27:28,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 813 transitions, 19472 flow [2023-08-29 23:27:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 23:27:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 23:27:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1182 transitions. [2023-08-29 23:27:28,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49747474747474746 [2023-08-29 23:27:28,955 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1182 transitions. [2023-08-29 23:27:28,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1182 transitions. [2023-08-29 23:27:28,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:27:28,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1182 transitions. [2023-08-29 23:27:28,957 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-08-29 23:27:28,958 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-08-29 23:27:28,959 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-08-29 23:27:28,959 INFO L175 Difference]: Start difference. First operand has 411 places, 752 transitions, 17421 flow. Second operand 8 states and 1182 transitions. [2023-08-29 23:27:28,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 813 transitions, 19472 flow [2023-08-29 23:27:44,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 813 transitions, 19377 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-29 23:27:44,112 INFO L231 Difference]: Finished difference. Result has 419 places, 757 transitions, 17680 flow [2023-08-29 23:27:44,113 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-08-29 23:27:44,113 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 347 predicate places. [2023-08-29 23:27:44,113 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 757 transitions, 17680 flow [2023-08-29 23:27:44,113 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-08-29 23:27:44,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:27:44,114 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-08-29 23:27:44,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-29 23:27:44,114 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-08-29 23:27:44,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:27:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1468144650, now seen corresponding path program 39 times [2023-08-29 23:27:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:27:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406889169] [2023-08-29 23:27:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:27:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:27:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:27:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:27:44,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:27:44,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406889169] [2023-08-29 23:27:44,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406889169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:27:44,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:27:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 23:27:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532402061] [2023-08-29 23:27:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:27:44,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 23:27:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:27:44,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 23:27:44,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 23:27:44,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2023-08-29 23:27:44,569 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-08-29 23:27:44,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:27:44,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2023-08-29 23:27:44,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15