./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1dad5daa490be7069cef5ea8bf1cf3314a40a44a4796167c86226f70cfcf68a2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:46:52,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:46:52,884 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:46:52,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:46:52,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:46:52,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:46:52,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:46:52,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:46:52,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:46:52,916 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:46:52,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:46:52,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:46:52,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:46:52,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:46:52,918 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:46:52,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:46:52,919 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:46:52,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:46:52,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:46:52,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:46:52,921 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:46:52,921 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:46:52,922 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:46:52,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:46:52,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:46:52,923 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:46:52,924 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:46:52,924 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:46:52,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:46:52,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:46:52,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:46:52,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:46:52,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:52,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:46:52,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:46:52,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:46:52,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:46:52,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:46:52,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:46:52,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:46:52,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:46:52,928 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1dad5daa490be7069cef5ea8bf1cf3314a40a44a4796167c86226f70cfcf68a2 [2023-11-29 05:46:53,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:46:53,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:46:53,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:46:53,198 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:46:53,199 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:46:53,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2023-11-29 05:46:55,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:46:56,130 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:46:56,130 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2023-11-29 05:46:56,136 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/data/9dba364e9/b93e349124444f43827332bd646ad600/FLAG191866263 [2023-11-29 05:46:56,147 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/data/9dba364e9/b93e349124444f43827332bd646ad600 [2023-11-29 05:46:56,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:46:56,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:46:56,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:56,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:46:56,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:46:56,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68dcf6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56, skipping insertion in model container [2023-11-29 05:46:56,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:46:56,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:56,349 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:46:56,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:56,381 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:46:56,381 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:46:56,389 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:46:56,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56 WrapperNode [2023-11-29 05:46:56,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:56,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:56,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:46:56,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:46:56,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,430 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-11-29 05:46:56,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:56,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:46:56,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:46:56,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:46:56,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,462 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 05:46:56,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:46:56,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:46:56,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:46:56,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:46:56,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (1/1) ... [2023-11-29 05:46:56,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:56,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:46:56,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:46:56,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:46:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:46:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 05:46:56,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 05:46:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 05:46:56,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 05:46:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 05:46:56,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 05:46:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 05:46:56,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 05:46:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:46:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:46:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:46:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:46:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:46:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:46:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:46:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:46:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:46:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:46:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:46:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:46:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:46:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:46:56,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:46:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:46:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:46:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:46:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:46:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 05:46:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:46:56,564 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:46:56,687 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:46:56,689 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:46:56,936 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:46:57,073 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:46:57,074 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 05:46:57,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:57 BoogieIcfgContainer [2023-11-29 05:46:57,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:46:57,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:46:57,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:46:57,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:46:57,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:46:56" (1/3) ... [2023-11-29 05:46:57,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f966a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:57, skipping insertion in model container [2023-11-29 05:46:57,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:56" (2/3) ... [2023-11-29 05:46:57,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f966a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:57, skipping insertion in model container [2023-11-29 05:46:57,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:57" (3/3) ... [2023-11-29 05:46:57,083 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-11-29 05:46:57,098 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:46:57,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-29 05:46:57,099 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:46:57,157 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 05:46:57,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 166 flow [2023-11-29 05:46:57,229 INFO L124 PetriNetUnfolderBase]: 4/65 cut-off events. [2023-11-29 05:46:57,229 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 05:46:57,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 65 events. 4/65 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-11-29 05:46:57,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 69 transitions, 166 flow [2023-11-29 05:46:57,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 64 transitions, 152 flow [2023-11-29 05:46:57,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:46:57,253 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;@3ac2c212, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:46:57,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-29 05:46:57,256 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:46:57,257 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:46:57,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:46:57,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:57,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:46:57,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:46:57,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:57,275 INFO L85 PathProgramCache]: Analyzing trace with hash 12371, now seen corresponding path program 1 times [2023-11-29 05:46:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019037197] [2023-11-29 05:46:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019037197] [2023-11-29 05:46:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019037197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:57,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:57,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:57,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307433571] [2023-11-29 05:46:57,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:57,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:57,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2023-11-29 05:46:57,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:57,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:57,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2023-11-29 05:46:57,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:58,375 INFO L124 PetriNetUnfolderBase]: 3501/5329 cut-off events. [2023-11-29 05:46:58,375 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2023-11-29 05:46:58,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10115 conditions, 5329 events. 3501/5329 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 29145 event pairs, 2562 based on Foata normal form. 1/4930 useless extension candidates. Maximal degree in co-relation 9050. Up to 4525 conditions per place. [2023-11-29 05:46:58,427 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 31 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2023-11-29 05:46:58,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 208 flow [2023-11-29 05:46:58,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-29 05:46:58,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6473429951690821 [2023-11-29 05:46:58,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-29 05:46:58,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-29 05:46:58,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:58,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-29 05:46:58,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:58,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:58,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:58,453 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 152 flow. Second operand 3 states and 134 transitions. [2023-11-29 05:46:58,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 208 flow [2023-11-29 05:46:58,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 192 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-29 05:46:58,474 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 130 flow [2023-11-29 05:46:58,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-11-29 05:46:58,479 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 05:46:58,480 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 130 flow [2023-11-29 05:46:58,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:58,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:58,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:46:58,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:46:58,481 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:46:58,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash 12372, now seen corresponding path program 1 times [2023-11-29 05:46:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484126636] [2023-11-29 05:46:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:58,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:58,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484126636] [2023-11-29 05:46:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484126636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:58,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:58,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437926894] [2023-11-29 05:46:58,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:58,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:58,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:58,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:46:58,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:58,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:58,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:46:58,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:59,092 INFO L124 PetriNetUnfolderBase]: 2477/3964 cut-off events. [2023-11-29 05:46:59,092 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2023-11-29 05:46:59,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7297 conditions, 3964 events. 2477/3964 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 22167 event pairs, 1794 based on Foata normal form. 257/3842 useless extension candidates. Maximal degree in co-relation 7291. Up to 3244 conditions per place. [2023-11-29 05:46:59,125 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 29 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-11-29 05:46:59,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 186 flow [2023-11-29 05:46:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-29 05:46:59,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6618357487922706 [2023-11-29 05:46:59,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-29 05:46:59,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-29 05:46:59,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:59,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-29 05:46:59,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,132 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 130 flow. Second operand 3 states and 137 transitions. [2023-11-29 05:46:59,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 186 flow [2023-11-29 05:46:59,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:46:59,135 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 127 flow [2023-11-29 05:46:59,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2023-11-29 05:46:59,136 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 05:46:59,136 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 127 flow [2023-11-29 05:46:59,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:59,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:46:59,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:46:59,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:46:59,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash 368930850, now seen corresponding path program 1 times [2023-11-29 05:46:59,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:59,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9692844] [2023-11-29 05:46:59,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:59,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9692844] [2023-11-29 05:46:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9692844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:59,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114914262] [2023-11-29 05:46:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:59,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:59,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:59,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:59,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:59,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2023-11-29 05:46:59,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:59,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2023-11-29 05:46:59,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:46:59,652 INFO L124 PetriNetUnfolderBase]: 2673/4146 cut-off events. [2023-11-29 05:46:59,652 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-29 05:46:59,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7744 conditions, 4146 events. 2673/4146 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 22251 event pairs, 1941 based on Foata normal form. 0/3849 useless extension candidates. Maximal degree in co-relation 7737. Up to 3508 conditions per place. [2023-11-29 05:46:59,683 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 31 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-11-29 05:46:59,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 187 flow [2023-11-29 05:46:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:46:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-29 05:46:59,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.642512077294686 [2023-11-29 05:46:59,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-29 05:46:59,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-29 05:46:59,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:46:59,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-29 05:46:59,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,689 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 127 flow. Second operand 3 states and 133 transitions. [2023-11-29 05:46:59,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 187 flow [2023-11-29 05:46:59,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:46:59,691 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 124 flow [2023-11-29 05:46:59,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-11-29 05:46:59,692 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 05:46:59,692 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 124 flow [2023-11-29 05:46:59,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:46:59,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:46:59,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:46:59,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:46:59,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 368930851, now seen corresponding path program 1 times [2023-11-29 05:46:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:59,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3851666] [2023-11-29 05:46:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:59,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3851666] [2023-11-29 05:46:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3851666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:59,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:46:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714071031] [2023-11-29 05:46:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:59,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:59,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:59,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:46:59,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:59,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:46:59,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:46:59,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:00,167 INFO L124 PetriNetUnfolderBase]: 2477/3862 cut-off events. [2023-11-29 05:47:00,167 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2023-11-29 05:47:00,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7197 conditions, 3862 events. 2477/3862 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20840 event pairs, 1794 based on Foata normal form. 52/3637 useless extension candidates. Maximal degree in co-relation 7189. Up to 3244 conditions per place. [2023-11-29 05:47:00,190 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 29 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-11-29 05:47:00,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 180 flow [2023-11-29 05:47:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:47:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:47:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-29 05:47:00,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6618357487922706 [2023-11-29 05:47:00,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-29 05:47:00,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-29 05:47:00,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:00,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-29 05:47:00,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,196 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 124 flow. Second operand 3 states and 137 transitions. [2023-11-29 05:47:00,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 180 flow [2023-11-29 05:47:00,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:00,198 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 121 flow [2023-11-29 05:47:00,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2023-11-29 05:47:00,199 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 05:47:00,199 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 121 flow [2023-11-29 05:47:00,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:00,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:00,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:47:00,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:00,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1976113, now seen corresponding path program 1 times [2023-11-29 05:47:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567007530] [2023-11-29 05:47:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567007530] [2023-11-29 05:47:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567007530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:00,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:00,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:47:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658904932] [2023-11-29 05:47:00,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:00,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:47:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:47:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:47:00,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2023-11-29 05:47:00,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:00,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2023-11-29 05:47:00,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:00,616 INFO L124 PetriNetUnfolderBase]: 2541/3914 cut-off events. [2023-11-29 05:47:00,616 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-11-29 05:47:00,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7346 conditions, 3914 events. 2541/3914 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20754 event pairs, 1842 based on Foata normal form. 0/3684 useless extension candidates. Maximal degree in co-relation 7337. Up to 3340 conditions per place. [2023-11-29 05:47:00,638 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 31 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-11-29 05:47:00,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 52 transitions, 181 flow [2023-11-29 05:47:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:47:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:47:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-29 05:47:00,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.642512077294686 [2023-11-29 05:47:00,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-29 05:47:00,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-29 05:47:00,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:00,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-29 05:47:00,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,642 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 121 flow. Second operand 3 states and 133 transitions. [2023-11-29 05:47:00,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 52 transitions, 181 flow [2023-11-29 05:47:00,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:00,643 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 118 flow [2023-11-29 05:47:00,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-11-29 05:47:00,644 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -14 predicate places. [2023-11-29 05:47:00,645 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 118 flow [2023-11-29 05:47:00,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:00,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:00,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:47:00,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:00,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1976112, now seen corresponding path program 1 times [2023-11-29 05:47:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:00,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806553581] [2023-11-29 05:47:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:00,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:00,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:00,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806553581] [2023-11-29 05:47:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806553581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:00,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:47:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985106330] [2023-11-29 05:47:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:00,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:47:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:00,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:47:00,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:47:00,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:00,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:00,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:00,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:00,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:01,139 INFO L124 PetriNetUnfolderBase]: 2477/3814 cut-off events. [2023-11-29 05:47:01,139 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2023-11-29 05:47:01,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7151 conditions, 3814 events. 2477/3814 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20291 event pairs, 1794 based on Foata normal form. 28/3613 useless extension candidates. Maximal degree in co-relation 7141. Up to 3244 conditions per place. [2023-11-29 05:47:01,160 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 29 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-11-29 05:47:01,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 174 flow [2023-11-29 05:47:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:47:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:47:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-29 05:47:01,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6618357487922706 [2023-11-29 05:47:01,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-29 05:47:01,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-29 05:47:01,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:01,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-29 05:47:01,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,164 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 118 flow. Second operand 3 states and 137 transitions. [2023-11-29 05:47:01,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 174 flow [2023-11-29 05:47:01,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:01,166 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 115 flow [2023-11-29 05:47:01,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=115, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-29 05:47:01,167 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -15 predicate places. [2023-11-29 05:47:01,167 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 115 flow [2023-11-29 05:47:01,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:01,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:01,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:47:01,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:01,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1259547561, now seen corresponding path program 1 times [2023-11-29 05:47:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:01,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609431581] [2023-11-29 05:47:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:01,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609431581] [2023-11-29 05:47:01,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609431581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:01,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:01,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:47:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675916795] [2023-11-29 05:47:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:01,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:47:01,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:01,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:47:01,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:47:01,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2023-11-29 05:47:01,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:01,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2023-11-29 05:47:01,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:01,552 INFO L124 PetriNetUnfolderBase]: 2673/3976 cut-off events. [2023-11-29 05:47:01,552 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-29 05:47:01,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7578 conditions, 3976 events. 2673/3976 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20077 event pairs, 1941 based on Foata normal form. 0/3864 useless extension candidates. Maximal degree in co-relation 7567. Up to 3508 conditions per place. [2023-11-29 05:47:01,574 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 31 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-11-29 05:47:01,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 175 flow [2023-11-29 05:47:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:47:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:47:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-29 05:47:01,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.642512077294686 [2023-11-29 05:47:01,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-29 05:47:01,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-29 05:47:01,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:01,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-29 05:47:01,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,578 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 115 flow. Second operand 3 states and 133 transitions. [2023-11-29 05:47:01,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 175 flow [2023-11-29 05:47:01,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:01,580 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 112 flow [2023-11-29 05:47:01,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 05:47:01,581 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -16 predicate places. [2023-11-29 05:47:01,581 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 112 flow [2023-11-29 05:47:01,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:01,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:01,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:47:01,582 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:01,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1259547562, now seen corresponding path program 1 times [2023-11-29 05:47:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444686412] [2023-11-29 05:47:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:01,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:01,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444686412] [2023-11-29 05:47:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444686412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:01,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:01,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:47:01,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751874405] [2023-11-29 05:47:01,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:01,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:47:01,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:01,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:47:01,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:47:01,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:01,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:01,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:01,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:01,931 INFO L124 PetriNetUnfolderBase]: 2477/3712 cut-off events. [2023-11-29 05:47:01,931 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2023-11-29 05:47:01,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7051 conditions, 3712 events. 2477/3712 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18884 event pairs, 1794 based on Foata normal form. 67/3652 useless extension candidates. Maximal degree in co-relation 7039. Up to 3244 conditions per place. [2023-11-29 05:47:01,949 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 29 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-11-29 05:47:01,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 168 flow [2023-11-29 05:47:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:47:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:47:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-29 05:47:01,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6618357487922706 [2023-11-29 05:47:01,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-29 05:47:01,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-29 05:47:01,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:01,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-29 05:47:01,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,953 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 112 flow. Second operand 3 states and 137 transitions. [2023-11-29 05:47:01,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 168 flow [2023-11-29 05:47:01,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:01,954 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 109 flow [2023-11-29 05:47:01,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-29 05:47:01,955 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -17 predicate places. [2023-11-29 05:47:01,955 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 109 flow [2023-11-29 05:47:01,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:01,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:01,956 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] [2023-11-29 05:47:01,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:47:01,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:01,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash 492105233, now seen corresponding path program 1 times [2023-11-29 05:47:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:01,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954871658] [2023-11-29 05:47:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:02,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954871658] [2023-11-29 05:47:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954871658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:02,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:47:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732050080] [2023-11-29 05:47:02,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:02,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:47:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:02,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:47:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:47:02,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 69 [2023-11-29 05:47:02,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:02,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:02,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 69 [2023-11-29 05:47:02,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:02,428 INFO L124 PetriNetUnfolderBase]: 3331/4738 cut-off events. [2023-11-29 05:47:02,428 INFO L125 PetriNetUnfolderBase]: For 98/100 co-relation queries the response was YES. [2023-11-29 05:47:02,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9240 conditions, 4738 events. 3331/4738 cut-off events. For 98/100 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21965 event pairs, 587 based on Foata normal form. 2/4673 useless extension candidates. Maximal degree in co-relation 9227. Up to 3534 conditions per place. [2023-11-29 05:47:02,455 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 47 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2023-11-29 05:47:02,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 268 flow [2023-11-29 05:47:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:47:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:47:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2023-11-29 05:47:02,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2023-11-29 05:47:02,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 165 transitions. [2023-11-29 05:47:02,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 165 transitions. [2023-11-29 05:47:02,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:02,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 165 transitions. [2023-11-29 05:47:02,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:02,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:02,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:02,459 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 109 flow. Second operand 3 states and 165 transitions. [2023-11-29 05:47:02,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 268 flow [2023-11-29 05:47:02,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:02,461 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 141 flow [2023-11-29 05:47:02,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-29 05:47:02,462 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -15 predicate places. [2023-11-29 05:47:02,463 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 141 flow [2023-11-29 05:47:02,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:02,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:02,463 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] [2023-11-29 05:47:02,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:47:02,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:02,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 44040598, now seen corresponding path program 1 times [2023-11-29 05:47:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7855437] [2023-11-29 05:47:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:02,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7855437] [2023-11-29 05:47:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7855437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849523652] [2023-11-29 05:47:02,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:02,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:47:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:02,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:47:02,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:47:02,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:47:02,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:02,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:02,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:47:02,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:03,383 INFO L124 PetriNetUnfolderBase]: 7596/10809 cut-off events. [2023-11-29 05:47:03,383 INFO L125 PetriNetUnfolderBase]: For 1915/1917 co-relation queries the response was YES. [2023-11-29 05:47:03,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23708 conditions, 10809 events. 7596/10809 cut-off events. For 1915/1917 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 59663 event pairs, 2764 based on Foata normal form. 0/10062 useless extension candidates. Maximal degree in co-relation 23693. Up to 5148 conditions per place. [2023-11-29 05:47:03,430 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 94 selfloop transitions, 10 changer transitions 0/119 dead transitions. [2023-11-29 05:47:03,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 119 transitions, 546 flow [2023-11-29 05:47:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:47:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:47:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2023-11-29 05:47:03,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7855072463768116 [2023-11-29 05:47:03,433 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 271 transitions. [2023-11-29 05:47:03,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 271 transitions. [2023-11-29 05:47:03,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:03,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 271 transitions. [2023-11-29 05:47:03,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:03,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:03,436 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:03,436 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 141 flow. Second operand 5 states and 271 transitions. [2023-11-29 05:47:03,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 119 transitions, 546 flow [2023-11-29 05:47:03,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:03,443 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 199 flow [2023-11-29 05:47:03,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2023-11-29 05:47:03,444 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 05:47:03,444 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 199 flow [2023-11-29 05:47:03,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:03,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:03,445 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] [2023-11-29 05:47:03,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:47:03,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:03,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1165964600, now seen corresponding path program 2 times [2023-11-29 05:47:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075673657] [2023-11-29 05:47:03,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075673657] [2023-11-29 05:47:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075673657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:47:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624802269] [2023-11-29 05:47:03,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:47:03,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:47:03,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:47:03,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:47:03,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:47:03,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:47:03,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:47:03,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:03,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624802269] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:47:03,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:47:03,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 05:47:03,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190107414] [2023-11-29 05:47:03,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:47:03,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:47:03,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:47:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:47:03,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:03,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 199 flow. Second operand has 9 states, 9 states have (on average 39.44444444444444) internal successors, (355), 9 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:03,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:03,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:03,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:05,636 INFO L124 PetriNetUnfolderBase]: 13343/18144 cut-off events. [2023-11-29 05:47:05,636 INFO L125 PetriNetUnfolderBase]: For 7032/7034 co-relation queries the response was YES. [2023-11-29 05:47:05,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46262 conditions, 18144 events. 13343/18144 cut-off events. For 7032/7034 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 100318 event pairs, 1706 based on Foata normal form. 288/18312 useless extension candidates. Maximal degree in co-relation 46244. Up to 3861 conditions per place. [2023-11-29 05:47:05,714 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 247 selfloop transitions, 36 changer transitions 0/297 dead transitions. [2023-11-29 05:47:05,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 297 transitions, 1458 flow [2023-11-29 05:47:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:47:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 05:47:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 745 transitions. [2023-11-29 05:47:05,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7712215320910973 [2023-11-29 05:47:05,718 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 745 transitions. [2023-11-29 05:47:05,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 745 transitions. [2023-11-29 05:47:05,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:05,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 745 transitions. [2023-11-29 05:47:05,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 53.214285714285715) internal successors, (745), 14 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:05,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 69.0) internal successors, (1035), 15 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:05,725 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 69.0) internal successors, (1035), 15 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:05,725 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 199 flow. Second operand 14 states and 745 transitions. [2023-11-29 05:47:05,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 297 transitions, 1458 flow [2023-11-29 05:47:05,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 297 transitions, 1458 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:47:05,740 INFO L231 Difference]: Finished difference. Result has 83 places, 87 transitions, 435 flow [2023-11-29 05:47:05,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=435, PETRI_PLACES=83, PETRI_TRANSITIONS=87} [2023-11-29 05:47:05,741 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2023-11-29 05:47:05,741 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 435 flow [2023-11-29 05:47:05,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.44444444444444) internal successors, (355), 9 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:05,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:05,741 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] [2023-11-29 05:47:05,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:47:05,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 05:47:05,942 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:05,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1247844458, now seen corresponding path program 3 times [2023-11-29 05:47:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:05,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893742215] [2023-11-29 05:47:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:05,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:06,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:06,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893742215] [2023-11-29 05:47:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893742215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:06,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:06,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556541743] [2023-11-29 05:47:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:06,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:47:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:06,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:47:06,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:47:06,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:06,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:06,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:06,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:06,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:07,409 INFO L124 PetriNetUnfolderBase]: 12891/18277 cut-off events. [2023-11-29 05:47:07,409 INFO L125 PetriNetUnfolderBase]: For 23405/23408 co-relation queries the response was YES. [2023-11-29 05:47:07,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53439 conditions, 18277 events. 12891/18277 cut-off events. For 23405/23408 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 107276 event pairs, 5169 based on Foata normal form. 208/18102 useless extension candidates. Maximal degree in co-relation 53414. Up to 9913 conditions per place. [2023-11-29 05:47:07,497 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 112 selfloop transitions, 21 changer transitions 0/147 dead transitions. [2023-11-29 05:47:07,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 147 transitions, 889 flow [2023-11-29 05:47:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:47:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:47:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2023-11-29 05:47:07,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7855072463768116 [2023-11-29 05:47:07,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 271 transitions. [2023-11-29 05:47:07,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 271 transitions. [2023-11-29 05:47:07,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:07,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 271 transitions. [2023-11-29 05:47:07,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:07,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:07,501 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:07,501 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 435 flow. Second operand 5 states and 271 transitions. [2023-11-29 05:47:07,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 147 transitions, 889 flow [2023-11-29 05:47:07,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 147 transitions, 858 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:07,621 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 467 flow [2023-11-29 05:47:07,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=467, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2023-11-29 05:47:07,621 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2023-11-29 05:47:07,621 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 467 flow [2023-11-29 05:47:07,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:07,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:07,622 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] [2023-11-29 05:47:07,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:47:07,622 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:07,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -622185405, now seen corresponding path program 1 times [2023-11-29 05:47:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:07,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297459601] [2023-11-29 05:47:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297459601] [2023-11-29 05:47:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297459601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:47:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352045044] [2023-11-29 05:47:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:47:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:47:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:47:07,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 69 [2023-11-29 05:47:07,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:07,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:07,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 69 [2023-11-29 05:47:07,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:08,819 INFO L124 PetriNetUnfolderBase]: 7822/11386 cut-off events. [2023-11-29 05:47:08,820 INFO L125 PetriNetUnfolderBase]: For 20917/21219 co-relation queries the response was YES. [2023-11-29 05:47:08,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34024 conditions, 11386 events. 7822/11386 cut-off events. For 20917/21219 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 64971 event pairs, 2656 based on Foata normal form. 510/11726 useless extension candidates. Maximal degree in co-relation 33998. Up to 6571 conditions per place. [2023-11-29 05:47:08,901 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 77 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2023-11-29 05:47:08,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 107 transitions, 677 flow [2023-11-29 05:47:08,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:47:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:47:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2023-11-29 05:47:08,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8019323671497585 [2023-11-29 05:47:08,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 166 transitions. [2023-11-29 05:47:08,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 166 transitions. [2023-11-29 05:47:08,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:08,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 166 transitions. [2023-11-29 05:47:08,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:08,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:08,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:08,905 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 467 flow. Second operand 3 states and 166 transitions. [2023-11-29 05:47:08,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 107 transitions, 677 flow [2023-11-29 05:47:08,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 107 transitions, 637 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-29 05:47:08,937 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 419 flow [2023-11-29 05:47:08,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2023-11-29 05:47:08,938 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2023-11-29 05:47:08,938 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 419 flow [2023-11-29 05:47:08,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:08,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:08,939 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] [2023-11-29 05:47:08,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:47:08,939 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:08,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash 581638644, now seen corresponding path program 4 times [2023-11-29 05:47:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:08,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292102332] [2023-11-29 05:47:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:09,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292102332] [2023-11-29 05:47:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292102332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483999610] [2023-11-29 05:47:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:09,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:47:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:09,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:47:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:47:09,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:47:09,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 419 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:09,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:09,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:47:09,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:10,401 INFO L124 PetriNetUnfolderBase]: 12222/17587 cut-off events. [2023-11-29 05:47:10,401 INFO L125 PetriNetUnfolderBase]: For 22345/22351 co-relation queries the response was YES. [2023-11-29 05:47:10,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53035 conditions, 17587 events. 12222/17587 cut-off events. For 22345/22351 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 106292 event pairs, 3800 based on Foata normal form. 62/17399 useless extension candidates. Maximal degree in co-relation 53007. Up to 7700 conditions per place. [2023-11-29 05:47:10,537 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 111 selfloop transitions, 23 changer transitions 0/157 dead transitions. [2023-11-29 05:47:10,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 157 transitions, 979 flow [2023-11-29 05:47:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:47:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:47:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2023-11-29 05:47:10,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2023-11-29 05:47:10,538 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 270 transitions. [2023-11-29 05:47:10,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 270 transitions. [2023-11-29 05:47:10,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:10,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 270 transitions. [2023-11-29 05:47:10,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:10,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:10,541 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:10,541 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 419 flow. Second operand 5 states and 270 transitions. [2023-11-29 05:47:10,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 157 transitions, 979 flow [2023-11-29 05:47:10,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 157 transitions, 970 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:10,740 INFO L231 Difference]: Finished difference. Result has 93 places, 96 transitions, 582 flow [2023-11-29 05:47:10,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=582, PETRI_PLACES=93, PETRI_TRANSITIONS=96} [2023-11-29 05:47:10,741 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 20 predicate places. [2023-11-29 05:47:10,741 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 96 transitions, 582 flow [2023-11-29 05:47:10,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:10,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:10,741 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] [2023-11-29 05:47:10,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:47:10,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:10,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1145924566, now seen corresponding path program 5 times [2023-11-29 05:47:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:10,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517698441] [2023-11-29 05:47:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:10,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517698441] [2023-11-29 05:47:10,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517698441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:10,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674739025] [2023-11-29 05:47:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:10,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:47:10,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:47:10,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:47:10,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:47:10,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 96 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:10,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:10,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:47:10,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:12,262 INFO L124 PetriNetUnfolderBase]: 12474/17725 cut-off events. [2023-11-29 05:47:12,262 INFO L125 PetriNetUnfolderBase]: For 32913/32996 co-relation queries the response was YES. [2023-11-29 05:47:12,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57671 conditions, 17725 events. 12474/17725 cut-off events. For 32913/32996 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 105306 event pairs, 3249 based on Foata normal form. 106/17641 useless extension candidates. Maximal degree in co-relation 57640. Up to 7490 conditions per place. [2023-11-29 05:47:12,375 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 124 selfloop transitions, 17 changer transitions 0/164 dead transitions. [2023-11-29 05:47:12,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 164 transitions, 1113 flow [2023-11-29 05:47:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:47:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:47:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2023-11-29 05:47:12,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7855072463768116 [2023-11-29 05:47:12,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 271 transitions. [2023-11-29 05:47:12,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 271 transitions. [2023-11-29 05:47:12,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:12,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 271 transitions. [2023-11-29 05:47:12,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:12,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:12,378 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:12,379 INFO L175 Difference]: Start difference. First operand has 93 places, 96 transitions, 582 flow. Second operand 5 states and 271 transitions. [2023-11-29 05:47:12,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 164 transitions, 1113 flow [2023-11-29 05:47:12,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 164 transitions, 1101 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-29 05:47:12,609 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 635 flow [2023-11-29 05:47:12,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=635, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2023-11-29 05:47:12,610 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 26 predicate places. [2023-11-29 05:47:12,610 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 635 flow [2023-11-29 05:47:12,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:12,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:12,610 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] [2023-11-29 05:47:12,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:47:12,611 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:12,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 201738070, now seen corresponding path program 1 times [2023-11-29 05:47:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456292427] [2023-11-29 05:47:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:12,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:12,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456292427] [2023-11-29 05:47:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456292427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:12,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:12,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132207115] [2023-11-29 05:47:12,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:12,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:47:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:47:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:47:12,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:47:12,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 635 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:12,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:12,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:47:12,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:14,243 INFO L124 PetriNetUnfolderBase]: 13494/19684 cut-off events. [2023-11-29 05:47:14,244 INFO L125 PetriNetUnfolderBase]: For 55405/55830 co-relation queries the response was YES. [2023-11-29 05:47:14,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63859 conditions, 19684 events. 13494/19684 cut-off events. For 55405/55830 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 124793 event pairs, 6133 based on Foata normal form. 14/18366 useless extension candidates. Maximal degree in co-relation 63825. Up to 10643 conditions per place. [2023-11-29 05:47:14,368 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 108 selfloop transitions, 22 changer transitions 0/156 dead transitions. [2023-11-29 05:47:14,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 156 transitions, 1092 flow [2023-11-29 05:47:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:47:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:47:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2023-11-29 05:47:14,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2023-11-29 05:47:14,370 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 270 transitions. [2023-11-29 05:47:14,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 270 transitions. [2023-11-29 05:47:14,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:14,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 270 transitions. [2023-11-29 05:47:14,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:14,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:14,372 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:14,372 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 635 flow. Second operand 5 states and 270 transitions. [2023-11-29 05:47:14,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 156 transitions, 1092 flow [2023-11-29 05:47:14,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 156 transitions, 1055 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-29 05:47:14,433 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 669 flow [2023-11-29 05:47:14,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=669, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2023-11-29 05:47:14,434 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 30 predicate places. [2023-11-29 05:47:14,434 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 669 flow [2023-11-29 05:47:14,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:14,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:14,434 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] [2023-11-29 05:47:14,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:47:14,434 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:14,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash 750226105, now seen corresponding path program 1 times [2023-11-29 05:47:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:14,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939324747] [2023-11-29 05:47:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:14,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939324747] [2023-11-29 05:47:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939324747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:14,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:47:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942119186] [2023-11-29 05:47:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:14,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:47:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:47:14,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:47:14,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 69 [2023-11-29 05:47:14,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:14,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:14,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 69 [2023-11-29 05:47:14,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:16,201 INFO L124 PetriNetUnfolderBase]: 12596/18271 cut-off events. [2023-11-29 05:47:16,201 INFO L125 PetriNetUnfolderBase]: For 53680/54662 co-relation queries the response was YES. [2023-11-29 05:47:16,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62488 conditions, 18271 events. 12596/18271 cut-off events. For 53680/54662 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 112593 event pairs, 3772 based on Foata normal form. 282/18252 useless extension candidates. Maximal degree in co-relation 62452. Up to 9958 conditions per place. [2023-11-29 05:47:16,334 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 123 selfloop transitions, 3 changer transitions 3/156 dead transitions. [2023-11-29 05:47:16,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 156 transitions, 1408 flow [2023-11-29 05:47:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:47:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:47:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2023-11-29 05:47:16,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2023-11-29 05:47:16,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 162 transitions. [2023-11-29 05:47:16,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 162 transitions. [2023-11-29 05:47:16,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:16,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 162 transitions. [2023-11-29 05:47:16,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:16,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:16,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:16,337 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 669 flow. Second operand 3 states and 162 transitions. [2023-11-29 05:47:16,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 156 transitions, 1408 flow [2023-11-29 05:47:16,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 156 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:47:16,379 INFO L231 Difference]: Finished difference. Result has 104 places, 98 transitions, 637 flow [2023-11-29 05:47:16,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=104, PETRI_TRANSITIONS=98} [2023-11-29 05:47:16,380 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 31 predicate places. [2023-11-29 05:47:16,380 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 98 transitions, 637 flow [2023-11-29 05:47:16,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:16,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:16,380 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] [2023-11-29 05:47:16,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:47:16,381 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:16,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1604784574, now seen corresponding path program 2 times [2023-11-29 05:47:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:16,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796798698] [2023-11-29 05:47:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796798698] [2023-11-29 05:47:16,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796798698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:16,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:16,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:16,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173011374] [2023-11-29 05:47:16,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:16,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:47:16,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:16,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:47:16,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:47:16,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:47:16,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 98 transitions, 637 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:16,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:16,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:47:16,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:19,222 INFO L124 PetriNetUnfolderBase]: 18617/26482 cut-off events. [2023-11-29 05:47:19,222 INFO L125 PetriNetUnfolderBase]: For 67848/68326 co-relation queries the response was YES. [2023-11-29 05:47:19,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93647 conditions, 26482 events. 18617/26482 cut-off events. For 67848/68326 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 167127 event pairs, 8037 based on Foata normal form. 16/24615 useless extension candidates. Maximal degree in co-relation 93609. Up to 16678 conditions per place. [2023-11-29 05:47:19,471 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 105 selfloop transitions, 40 changer transitions 1/172 dead transitions. [2023-11-29 05:47:19,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 172 transitions, 1382 flow [2023-11-29 05:47:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:47:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:47:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2023-11-29 05:47:19,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7739130434782608 [2023-11-29 05:47:19,473 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 267 transitions. [2023-11-29 05:47:19,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 267 transitions. [2023-11-29 05:47:19,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:19,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 267 transitions. [2023-11-29 05:47:19,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:19,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:19,476 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:19,476 INFO L175 Difference]: Start difference. First operand has 104 places, 98 transitions, 637 flow. Second operand 5 states and 267 transitions. [2023-11-29 05:47:19,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 172 transitions, 1382 flow [2023-11-29 05:47:19,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 172 transitions, 1360 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-11-29 05:47:19,660 INFO L231 Difference]: Finished difference. Result has 108 places, 118 transitions, 949 flow [2023-11-29 05:47:19,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=949, PETRI_PLACES=108, PETRI_TRANSITIONS=118} [2023-11-29 05:47:19,661 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 35 predicate places. [2023-11-29 05:47:19,661 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 118 transitions, 949 flow [2023-11-29 05:47:19,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:19,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:19,661 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] [2023-11-29 05:47:19,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:47:19,662 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:19,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2122400918, now seen corresponding path program 3 times [2023-11-29 05:47:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61901048] [2023-11-29 05:47:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:19,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:19,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61901048] [2023-11-29 05:47:19,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61901048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:19,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:19,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:47:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663187741] [2023-11-29 05:47:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:19,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:47:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:47:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:47:19,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:19,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 118 transitions, 949 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:19,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:19,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:19,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:22,428 INFO L124 PetriNetUnfolderBase]: 22749/31921 cut-off events. [2023-11-29 05:47:22,428 INFO L125 PetriNetUnfolderBase]: For 100289/100820 co-relation queries the response was YES. [2023-11-29 05:47:22,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121445 conditions, 31921 events. 22749/31921 cut-off events. For 100289/100820 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 197492 event pairs, 9507 based on Foata normal form. 818/32400 useless extension candidates. Maximal degree in co-relation 121405. Up to 20430 conditions per place. [2023-11-29 05:47:22,693 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 123 selfloop transitions, 40 changer transitions 11/196 dead transitions. [2023-11-29 05:47:22,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 196 transitions, 1742 flow [2023-11-29 05:47:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:47:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:47:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 316 transitions. [2023-11-29 05:47:22,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7632850241545893 [2023-11-29 05:47:22,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 316 transitions. [2023-11-29 05:47:22,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 316 transitions. [2023-11-29 05:47:22,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:22,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 316 transitions. [2023-11-29 05:47:22,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 52.666666666666664) internal successors, (316), 6 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:22,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 69.0) internal successors, (483), 7 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:22,697 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 69.0) internal successors, (483), 7 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:22,697 INFO L175 Difference]: Start difference. First operand has 108 places, 118 transitions, 949 flow. Second operand 6 states and 316 transitions. [2023-11-29 05:47:22,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 196 transitions, 1742 flow [2023-11-29 05:47:22,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 196 transitions, 1703 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:22,995 INFO L231 Difference]: Finished difference. Result has 114 places, 118 transitions, 980 flow [2023-11-29 05:47:22,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=114, PETRI_TRANSITIONS=118} [2023-11-29 05:47:22,995 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 41 predicate places. [2023-11-29 05:47:22,996 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 118 transitions, 980 flow [2023-11-29 05:47:22,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:22,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:22,996 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] [2023-11-29 05:47:22,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:47:22,996 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:22,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash -769712666, now seen corresponding path program 4 times [2023-11-29 05:47:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586458989] [2023-11-29 05:47:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586458989] [2023-11-29 05:47:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586458989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:47:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700807834] [2023-11-29 05:47:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:47:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:47:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:47:23,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:47:23,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 118 transitions, 980 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:23,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:23,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:47:23,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:26,243 INFO L124 PetriNetUnfolderBase]: 21917/31011 cut-off events. [2023-11-29 05:47:26,243 INFO L125 PetriNetUnfolderBase]: For 116969/117594 co-relation queries the response was YES. [2023-11-29 05:47:26,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120087 conditions, 31011 events. 21917/31011 cut-off events. For 116969/117594 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 195502 event pairs, 8868 based on Foata normal form. 96/30558 useless extension candidates. Maximal degree in co-relation 120045. Up to 19214 conditions per place. [2023-11-29 05:47:26,463 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 151 selfloop transitions, 30 changer transitions 2/215 dead transitions. [2023-11-29 05:47:26,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 215 transitions, 2125 flow [2023-11-29 05:47:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:47:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:47:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2023-11-29 05:47:26,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7681159420289855 [2023-11-29 05:47:26,465 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 265 transitions. [2023-11-29 05:47:26,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 265 transitions. [2023-11-29 05:47:26,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:26,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 265 transitions. [2023-11-29 05:47:26,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:26,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:26,467 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:47:26,467 INFO L175 Difference]: Start difference. First operand has 114 places, 118 transitions, 980 flow. Second operand 5 states and 265 transitions. [2023-11-29 05:47:26,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 215 transitions, 2125 flow [2023-11-29 05:47:26,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 215 transitions, 2003 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-29 05:47:26,661 INFO L231 Difference]: Finished difference. Result has 116 places, 143 transitions, 1346 flow [2023-11-29 05:47:26,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1346, PETRI_PLACES=116, PETRI_TRANSITIONS=143} [2023-11-29 05:47:26,661 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 43 predicate places. [2023-11-29 05:47:26,661 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 143 transitions, 1346 flow [2023-11-29 05:47:26,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:26,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:26,662 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] [2023-11-29 05:47:26,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:47:26,662 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:26,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1870608298, now seen corresponding path program 5 times [2023-11-29 05:47:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103827016] [2023-11-29 05:47:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:26,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:26,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103827016] [2023-11-29 05:47:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103827016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:26,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:47:26,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683911338] [2023-11-29 05:47:26,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:26,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:47:26,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:26,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:47:26,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:47:26,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:47:26,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 143 transitions, 1346 flow. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:26,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:26,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:47:26,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:30,646 INFO L124 PetriNetUnfolderBase]: 25696/35546 cut-off events. [2023-11-29 05:47:30,646 INFO L125 PetriNetUnfolderBase]: For 154702/155919 co-relation queries the response was YES. [2023-11-29 05:47:30,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145142 conditions, 35546 events. 25696/35546 cut-off events. For 154702/155919 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 220619 event pairs, 2245 based on Foata normal form. 574/35855 useless extension candidates. Maximal degree in co-relation 145098. Up to 15445 conditions per place. [2023-11-29 05:47:31,069 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 268 selfloop transitions, 37 changer transitions 22/359 dead transitions. [2023-11-29 05:47:31,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 359 transitions, 4004 flow [2023-11-29 05:47:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:47:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:47:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2023-11-29 05:47:31,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7681159420289855 [2023-11-29 05:47:31,071 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 371 transitions. [2023-11-29 05:47:31,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 371 transitions. [2023-11-29 05:47:31,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:31,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 371 transitions. [2023-11-29 05:47:31,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:31,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:31,073 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:31,073 INFO L175 Difference]: Start difference. First operand has 116 places, 143 transitions, 1346 flow. Second operand 7 states and 371 transitions. [2023-11-29 05:47:31,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 359 transitions, 4004 flow [2023-11-29 05:47:31,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 359 transitions, 3988 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-11-29 05:47:31,403 INFO L231 Difference]: Finished difference. Result has 127 places, 166 transitions, 1867 flow [2023-11-29 05:47:31,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1867, PETRI_PLACES=127, PETRI_TRANSITIONS=166} [2023-11-29 05:47:31,403 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 54 predicate places. [2023-11-29 05:47:31,403 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 166 transitions, 1867 flow [2023-11-29 05:47:31,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:31,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:31,404 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] [2023-11-29 05:47:31,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:47:31,404 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:31,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -796622804, now seen corresponding path program 6 times [2023-11-29 05:47:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711379037] [2023-11-29 05:47:31,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:31,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:31,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:31,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711379037] [2023-11-29 05:47:31,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711379037] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:47:31,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396285875] [2023-11-29 05:47:31,513 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 05:47:31,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:31,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:47:31,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:47:31,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:47:31,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-29 05:47:31,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:47:31,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:47:31,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:31,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:31,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396285875] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:47:31,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:47:31,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-29 05:47:31,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232525853] [2023-11-29 05:47:31,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:47:31,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:47:31,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:31,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:47:31,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:47:31,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:31,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 166 transitions, 1867 flow. Second operand has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 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-11-29 05:47:31,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:31,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:31,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:37,763 INFO L124 PetriNetUnfolderBase]: 36629/50348 cut-off events. [2023-11-29 05:47:37,763 INFO L125 PetriNetUnfolderBase]: For 188630/189076 co-relation queries the response was YES. [2023-11-29 05:47:38,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203594 conditions, 50348 events. 36629/50348 cut-off events. For 188630/189076 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 317863 event pairs, 4144 based on Foata normal form. 450/50573 useless extension candidates. Maximal degree in co-relation 203544. Up to 10799 conditions per place. [2023-11-29 05:47:38,312 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 318 selfloop transitions, 112 changer transitions 1/447 dead transitions. [2023-11-29 05:47:38,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 447 transitions, 4210 flow [2023-11-29 05:47:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:47:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-29 05:47:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 800 transitions. [2023-11-29 05:47:38,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7729468599033816 [2023-11-29 05:47:38,315 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 800 transitions. [2023-11-29 05:47:38,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 800 transitions. [2023-11-29 05:47:38,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:38,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 800 transitions. [2023-11-29 05:47:38,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 53.333333333333336) internal successors, (800), 15 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:38,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 69.0) internal successors, (1104), 16 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:38,319 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 69.0) internal successors, (1104), 16 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:38,319 INFO L175 Difference]: Start difference. First operand has 127 places, 166 transitions, 1867 flow. Second operand 15 states and 800 transitions. [2023-11-29 05:47:38,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 447 transitions, 4210 flow [2023-11-29 05:47:39,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 447 transitions, 4144 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-11-29 05:47:39,274 INFO L231 Difference]: Finished difference. Result has 147 places, 184 transitions, 2325 flow [2023-11-29 05:47:39,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2325, PETRI_PLACES=147, PETRI_TRANSITIONS=184} [2023-11-29 05:47:39,274 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 74 predicate places. [2023-11-29 05:47:39,274 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 184 transitions, 2325 flow [2023-11-29 05:47:39,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 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-11-29 05:47:39,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:39,275 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] [2023-11-29 05:47:39,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:47:39,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 05:47:39,475 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:39,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash 974919324, now seen corresponding path program 7 times [2023-11-29 05:47:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:39,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981804090] [2023-11-29 05:47:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:39,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:39,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981804090] [2023-11-29 05:47:39,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981804090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:47:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862095122] [2023-11-29 05:47:39,561 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 05:47:39,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:39,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:47:39,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:47:39,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:47:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:39,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:47:39,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:39,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:39,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862095122] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:47:39,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:47:39,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-29 05:47:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102213134] [2023-11-29 05:47:39,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:47:39,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:47:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:39,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:47:39,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:47:39,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:39,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 184 transitions, 2325 flow. Second operand has 11 states, 11 states have (on average 38.63636363636363) internal successors, (425), 11 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:39,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:39,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:39,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:46,001 INFO L124 PetriNetUnfolderBase]: 34671/49163 cut-off events. [2023-11-29 05:47:46,001 INFO L125 PetriNetUnfolderBase]: For 266437/266818 co-relation queries the response was YES. [2023-11-29 05:47:46,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210460 conditions, 49163 events. 34671/49163 cut-off events. For 266437/266818 co-relation queries the response was YES. Maximal size of possible extension queue 1828. Compared 323815 event pairs, 10894 based on Foata normal form. 715/49542 useless extension candidates. Maximal degree in co-relation 210404. Up to 16669 conditions per place. [2023-11-29 05:47:46,419 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 262 selfloop transitions, 63 changer transitions 1/342 dead transitions. [2023-11-29 05:47:46,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 342 transitions, 3905 flow [2023-11-29 05:47:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:47:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:47:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 432 transitions. [2023-11-29 05:47:46,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2023-11-29 05:47:46,421 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 432 transitions. [2023-11-29 05:47:46,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 432 transitions. [2023-11-29 05:47:46,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:46,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 432 transitions. [2023-11-29 05:47:46,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:46,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 69.0) internal successors, (621), 9 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:46,423 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 69.0) internal successors, (621), 9 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:46,423 INFO L175 Difference]: Start difference. First operand has 147 places, 184 transitions, 2325 flow. Second operand 8 states and 432 transitions. [2023-11-29 05:47:46,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 342 transitions, 3905 flow [2023-11-29 05:47:47,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 342 transitions, 3852 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-29 05:47:47,577 INFO L231 Difference]: Finished difference. Result has 155 places, 187 transitions, 2453 flow [2023-11-29 05:47:47,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=2172, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2453, PETRI_PLACES=155, PETRI_TRANSITIONS=187} [2023-11-29 05:47:47,578 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 82 predicate places. [2023-11-29 05:47:47,578 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 187 transitions, 2453 flow [2023-11-29 05:47:47,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 38.63636363636363) internal successors, (425), 11 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:47,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:47,578 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] [2023-11-29 05:47:47,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:47:47,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 05:47:47,779 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:47,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1193660162, now seen corresponding path program 6 times [2023-11-29 05:47:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989238485] [2023-11-29 05:47:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:47,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:47,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989238485] [2023-11-29 05:47:47,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989238485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:47:47,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:47:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:47:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716420033] [2023-11-29 05:47:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:47:47,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:47:47,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:47:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:47:47,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:47,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 187 transitions, 2453 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:47,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:47,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:47,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:47:54,864 INFO L124 PetriNetUnfolderBase]: 39510/54147 cut-off events. [2023-11-29 05:47:54,865 INFO L125 PetriNetUnfolderBase]: For 398706/399695 co-relation queries the response was YES. [2023-11-29 05:47:55,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248593 conditions, 54147 events. 39510/54147 cut-off events. For 398706/399695 co-relation queries the response was YES. Maximal size of possible extension queue 2015. Compared 339484 event pairs, 13490 based on Foata normal form. 920/54399 useless extension candidates. Maximal degree in co-relation 248534. Up to 31048 conditions per place. [2023-11-29 05:47:55,456 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 218 selfloop transitions, 54 changer transitions 25/327 dead transitions. [2023-11-29 05:47:55,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 327 transitions, 4568 flow [2023-11-29 05:47:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:47:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:47:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 317 transitions. [2023-11-29 05:47:55,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7657004830917874 [2023-11-29 05:47:55,458 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 317 transitions. [2023-11-29 05:47:55,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 317 transitions. [2023-11-29 05:47:55,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:47:55,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 317 transitions. [2023-11-29 05:47:55,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:55,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 69.0) internal successors, (483), 7 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:55,460 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 69.0) internal successors, (483), 7 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:55,460 INFO L175 Difference]: Start difference. First operand has 155 places, 187 transitions, 2453 flow. Second operand 6 states and 317 transitions. [2023-11-29 05:47:55,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 327 transitions, 4568 flow [2023-11-29 05:47:57,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 327 transitions, 4285 flow, removed 38 selfloop flow, removed 4 redundant places. [2023-11-29 05:47:57,318 INFO L231 Difference]: Finished difference. Result has 158 places, 192 transitions, 2474 flow [2023-11-29 05:47:57,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2474, PETRI_PLACES=158, PETRI_TRANSITIONS=192} [2023-11-29 05:47:57,319 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 85 predicate places. [2023-11-29 05:47:57,319 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 192 transitions, 2474 flow [2023-11-29 05:47:57,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:57,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:47:57,319 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] [2023-11-29 05:47:57,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:47:57,320 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:47:57,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash 853342276, now seen corresponding path program 1 times [2023-11-29 05:47:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:47:57,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131816133] [2023-11-29 05:47:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:57,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:47:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131816133] [2023-11-29 05:47:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131816133] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:47:57,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878161178] [2023-11-29 05:47:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:47:57,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:47:57,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:47:57,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:47:57,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:47:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:47:57,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:47:57,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:57,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:57,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878161178] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:47:57,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:47:57,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 05:47:57,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760307408] [2023-11-29 05:47:57,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:47:57,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:47:57,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:57,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:47:57,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:47:57,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:47:57,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 192 transitions, 2474 flow. Second operand has 9 states, 9 states have (on average 39.888888888888886) internal successors, (359), 9 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:47:57,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:47:57,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:47:57,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:48:05,498 INFO L124 PetriNetUnfolderBase]: 45068/61039 cut-off events. [2023-11-29 05:48:05,498 INFO L125 PetriNetUnfolderBase]: For 382574/383778 co-relation queries the response was YES. [2023-11-29 05:48:05,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283140 conditions, 61039 events. 45068/61039 cut-off events. For 382574/383778 co-relation queries the response was YES. Maximal size of possible extension queue 2213. Compared 377072 event pairs, 1222 based on Foata normal form. 1146/61864 useless extension candidates. Maximal degree in co-relation 283080. Up to 13610 conditions per place. [2023-11-29 05:48:06,103 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 252 selfloop transitions, 216 changer transitions 0/498 dead transitions. [2023-11-29 05:48:06,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 498 transitions, 6165 flow [2023-11-29 05:48:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:48:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 05:48:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 710 transitions. [2023-11-29 05:48:06,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7349896480331263 [2023-11-29 05:48:06,105 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 710 transitions. [2023-11-29 05:48:06,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 710 transitions. [2023-11-29 05:48:06,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:48:06,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 710 transitions. [2023-11-29 05:48:06,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 50.714285714285715) internal successors, (710), 14 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:06,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 69.0) internal successors, (1035), 15 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:06,109 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 69.0) internal successors, (1035), 15 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:06,109 INFO L175 Difference]: Start difference. First operand has 158 places, 192 transitions, 2474 flow. Second operand 14 states and 710 transitions. [2023-11-29 05:48:06,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 498 transitions, 6165 flow [2023-11-29 05:48:09,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 498 transitions, 5597 flow, removed 52 selfloop flow, removed 16 redundant places. [2023-11-29 05:48:09,103 INFO L231 Difference]: Finished difference. Result has 151 places, 306 transitions, 4130 flow [2023-11-29 05:48:09,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4130, PETRI_PLACES=151, PETRI_TRANSITIONS=306} [2023-11-29 05:48:09,104 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 78 predicate places. [2023-11-29 05:48:09,104 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 306 transitions, 4130 flow [2023-11-29 05:48:09,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.888888888888886) internal successors, (359), 9 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:09,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:48:09,104 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] [2023-11-29 05:48:09,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:48:09,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 05:48:09,305 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:48:09,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:09,305 INFO L85 PathProgramCache]: Analyzing trace with hash 213436560, now seen corresponding path program 2 times [2023-11-29 05:48:09,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:09,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647286532] [2023-11-29 05:48:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:48:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:09,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647286532] [2023-11-29 05:48:09,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647286532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:48:09,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:48:09,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:48:09,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365642797] [2023-11-29 05:48:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:48:09,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:48:09,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:09,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:48:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:48:09,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:48:09,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 306 transitions, 4130 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:09,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:48:09,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:48:09,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:48:15,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][417], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 413#(= ~counter2~0 0), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 418#(= thread1Thread1of1ForFork2_~i~0 0), 14#L91-4true, Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 436#(= thread3Thread1of1ForFork3_~i~2 0), Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 1201#(and (<= (+ thread3Thread1of1ForFork3_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1205#true, 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 8#L72-5true, 447#(<= 1 ~N~0), 434#true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 115#(= ~counter2~0 ~counter1~0), Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:15,545 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 05:48:15,545 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 05:48:15,545 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 05:48:15,545 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 05:48:15,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][417], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 46#L92true, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 413#(= ~counter2~0 0), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 418#(= thread1Thread1of1ForFork2_~i~0 0), Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 436#(= thread3Thread1of1ForFork3_~i~2 0), Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 1201#(and (<= (+ thread3Thread1of1ForFork3_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1205#true, 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 447#(<= 1 ~N~0), 434#true, 38#$Ultimate##0true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 115#(= ~counter2~0 ~counter1~0), Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:15,546 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 05:48:15,546 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 05:48:15,546 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 05:48:15,547 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 05:48:16,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][417], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 46#L92true, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 413#(= ~counter2~0 0), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 418#(= thread1Thread1of1ForFork2_~i~0 0), Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 436#(= thread3Thread1of1ForFork3_~i~2 0), Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 1201#(and (<= (+ thread3Thread1of1ForFork3_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1205#true, 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 8#L72-5true, 447#(<= 1 ~N~0), 434#true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 115#(= ~counter2~0 ~counter1~0), Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:16,059 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 05:48:16,059 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 05:48:16,059 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 05:48:16,059 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 05:48:16,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][417], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 413#(= ~counter2~0 0), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 418#(= thread1Thread1of1ForFork2_~i~0 0), 14#L91-4true, Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 436#(= thread3Thread1of1ForFork3_~i~2 0), Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 1201#(and (<= (+ thread3Thread1of1ForFork3_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1205#true, 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 37#thread4EXITtrue, 447#(<= 1 ~N~0), 434#true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 115#(= ~counter2~0 ~counter1~0), Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:16,060 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 05:48:16,060 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 05:48:16,060 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 05:48:16,060 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 05:48:16,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][417], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 46#L92true, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 413#(= ~counter2~0 0), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 418#(= thread1Thread1of1ForFork2_~i~0 0), Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 436#(= thread3Thread1of1ForFork3_~i~2 0), Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 1201#(and (<= (+ thread3Thread1of1ForFork3_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1205#true, 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 37#thread4EXITtrue, 447#(<= 1 ~N~0), 434#true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 115#(= ~counter2~0 ~counter1~0), Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:16,589 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 05:48:16,589 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 05:48:16,589 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 05:48:16,589 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 05:48:16,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][417], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 413#(= ~counter2~0 0), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 418#(= thread1Thread1of1ForFork2_~i~0 0), 14#L91-4true, Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 436#(= thread3Thread1of1ForFork3_~i~2 0), Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 1201#(and (<= (+ thread3Thread1of1ForFork3_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1205#true, 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 447#(<= 1 ~N~0), 434#true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 115#(= ~counter2~0 ~counter1~0), 35#L76true, Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:16,590 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 05:48:16,590 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 05:48:16,590 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 05:48:16,590 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 05:48:16,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][417], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 46#L92true, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 413#(= ~counter2~0 0), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 418#(= thread1Thread1of1ForFork2_~i~0 0), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 436#(= thread3Thread1of1ForFork3_~i~2 0), Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 1201#(and (<= (+ thread3Thread1of1ForFork3_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1205#true, 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 447#(<= 1 ~N~0), 434#true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 115#(= ~counter2~0 ~counter1~0), 35#L76true, Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:16,789 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 05:48:16,789 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:48:16,789 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:48:16,789 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:48:17,005 INFO L124 PetriNetUnfolderBase]: 42282/59605 cut-off events. [2023-11-29 05:48:17,005 INFO L125 PetriNetUnfolderBase]: For 365342/366521 co-relation queries the response was YES. [2023-11-29 05:48:17,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274518 conditions, 59605 events. 42282/59605 cut-off events. For 365342/366521 co-relation queries the response was YES. Maximal size of possible extension queue 2375. Compared 402769 event pairs, 12022 based on Foata normal form. 420/58905 useless extension candidates. Maximal degree in co-relation 274468. Up to 31845 conditions per place. [2023-11-29 05:48:17,563 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 369 selfloop transitions, 20 changer transitions 10/443 dead transitions. [2023-11-29 05:48:17,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 443 transitions, 6320 flow [2023-11-29 05:48:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:48:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:48:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 258 transitions. [2023-11-29 05:48:17,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7478260869565218 [2023-11-29 05:48:17,564 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 258 transitions. [2023-11-29 05:48:17,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 258 transitions. [2023-11-29 05:48:17,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:48:17,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 258 transitions. [2023-11-29 05:48:17,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:17,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:48:17,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:48:17,565 INFO L175 Difference]: Start difference. First operand has 151 places, 306 transitions, 4130 flow. Second operand 5 states and 258 transitions. [2023-11-29 05:48:17,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 443 transitions, 6320 flow [2023-11-29 05:48:21,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 443 transitions, 6110 flow, removed 45 selfloop flow, removed 1 redundant places. [2023-11-29 05:48:21,398 INFO L231 Difference]: Finished difference. Result has 156 places, 306 transitions, 3996 flow [2023-11-29 05:48:21,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=3939, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3996, PETRI_PLACES=156, PETRI_TRANSITIONS=306} [2023-11-29 05:48:21,398 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 83 predicate places. [2023-11-29 05:48:21,398 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 306 transitions, 3996 flow [2023-11-29 05:48:21,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:21,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:48:21,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] [2023-11-29 05:48:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:48:21,399 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:48:21,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1609180794, now seen corresponding path program 3 times [2023-11-29 05:48:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646317501] [2023-11-29 05:48:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:48:21,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:21,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646317501] [2023-11-29 05:48:21,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646317501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:48:21,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:48:21,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:48:21,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042228006] [2023-11-29 05:48:21,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:48:21,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:48:21,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:48:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:48:21,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:48:21,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 306 transitions, 3996 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:21,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:48:21,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:48:21,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:48:32,162 INFO L124 PetriNetUnfolderBase]: 57529/81650 cut-off events. [2023-11-29 05:48:32,163 INFO L125 PetriNetUnfolderBase]: For 486028/486968 co-relation queries the response was YES. [2023-11-29 05:48:32,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362819 conditions, 81650 events. 57529/81650 cut-off events. For 486028/486968 co-relation queries the response was YES. Maximal size of possible extension queue 3580. Compared 585530 event pairs, 11750 based on Foata normal form. 1002/82054 useless extension candidates. Maximal degree in co-relation 362767. Up to 35238 conditions per place. [2023-11-29 05:48:32,938 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 562 selfloop transitions, 47 changer transitions 34/701 dead transitions. [2023-11-29 05:48:32,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 701 transitions, 10720 flow [2023-11-29 05:48:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:48:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:48:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2023-11-29 05:48:32,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7565217391304347 [2023-11-29 05:48:32,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 261 transitions. [2023-11-29 05:48:32,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 261 transitions. [2023-11-29 05:48:32,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:48:32,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 261 transitions. [2023-11-29 05:48:32,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:32,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:48:32,940 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:48:32,940 INFO L175 Difference]: Start difference. First operand has 156 places, 306 transitions, 3996 flow. Second operand 5 states and 261 transitions. [2023-11-29 05:48:32,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 701 transitions, 10720 flow [2023-11-29 05:48:36,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 701 transitions, 10488 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 05:48:36,928 INFO L231 Difference]: Finished difference. Result has 158 places, 335 transitions, 4411 flow [2023-11-29 05:48:36,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=3921, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4411, PETRI_PLACES=158, PETRI_TRANSITIONS=335} [2023-11-29 05:48:36,929 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 85 predicate places. [2023-11-29 05:48:36,929 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 335 transitions, 4411 flow [2023-11-29 05:48:36,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:36,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:48:36,929 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] [2023-11-29 05:48:36,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 05:48:36,929 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:48:36,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -388745916, now seen corresponding path program 4 times [2023-11-29 05:48:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968245879] [2023-11-29 05:48:36,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:48:36,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968245879] [2023-11-29 05:48:36,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968245879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:48:36,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:48:36,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:48:36,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484161356] [2023-11-29 05:48:36,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:48:36,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:48:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:36,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:48:36,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:48:36,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:48:36,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 335 transitions, 4411 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:36,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:48:36,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:48:36,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:48:44,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][305], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 46#L92true, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 938#(= thread3Thread1of1ForFork3_~i~2 0), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1208#(<= ~N~0 0), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1217#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 1215#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), Black: 447#(<= 1 ~N~0), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 8#L72-5true, 1216#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, 1222#true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 115#(= ~counter2~0 ~counter1~0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 413#(= ~counter2~0 0), Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:44,114 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 05:48:44,114 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 05:48:44,114 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 05:48:44,114 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 05:48:45,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][305], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 46#L92true, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 938#(= thread3Thread1of1ForFork3_~i~2 0), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1208#(<= ~N~0 0), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1217#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1216#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), Black: 447#(<= 1 ~N~0), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1215#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 37#thread4EXITtrue, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, 1222#true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 115#(= ~counter2~0 ~counter1~0), 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 413#(= ~counter2~0 0), Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:45,275 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 05:48:45,275 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 05:48:45,276 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 05:48:45,276 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 05:48:45,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][304], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 366#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 388#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 118#true, 638#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0), 15#thread1EXITtrue, 46#L92true, 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 938#(= thread3Thread1of1ForFork3_~i~2 0), 386#true, Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1208#(<= ~N~0 0), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1217#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 1215#(= |thread2Thread1of1ForFork0_~i~1#1| 0), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1216#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), Black: 447#(<= 1 ~N~0), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 446#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 37#thread4EXITtrue, 1213#true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, 1222#true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 115#(= ~counter2~0 ~counter1~0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), 413#(= ~counter2~0 0), 886#(< |thread2Thread1of1ForFork0_~i~1#1| ~N~0), Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:45,292 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 05:48:45,292 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 05:48:45,292 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 05:48:45,292 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 05:48:47,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L41-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (<= v_~N~0_45 v_thread1Thread1of1ForFork2_~i~0_5) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_45} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#res.offset][332], [Black: 383#(= ~counter1~0 0), Black: 389#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), 91#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 118#true, 15#thread1EXITtrue, 46#L92true, 502#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 413#(= ~counter2~0 0), 708#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 132#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 99#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 83#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 931#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 706#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 703#true, Black: 419#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 941#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 427#(= thread1Thread1of1ForFork2_~i~0 0), Black: 939#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 428#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), 4#L63true, Black: 1197#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 950#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0)), Black: 437#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 458#true, Black: 436#(= thread3Thread1of1ForFork3_~i~2 0), Black: 692#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1208#(<= ~N~0 0), Black: 498#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 111#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 1217#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), 1201#(and (<= (+ thread3Thread1of1ForFork3_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 450#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 1216#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 445#(= thread3Thread1of1ForFork3_~i~2 0), Black: 448#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 107#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 95#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 87#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 1215#(= |thread2Thread1of1ForFork0_~i~1#1| 0), 103#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 447#(<= 1 ~N~0), 434#true, Black: 130#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 17#L52true, 1222#true, Black: 129#(= thread1Thread1of1ForFork2_~i~0 0), Black: 115#(= ~counter2~0 ~counter1~0), Black: 358#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 35#L76true, Black: 377#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 05:48:47,929 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2023-11-29 05:48:47,929 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 05:48:47,930 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 05:48:47,930 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 05:48:48,161 INFO L124 PetriNetUnfolderBase]: 57265/82095 cut-off events. [2023-11-29 05:48:48,161 INFO L125 PetriNetUnfolderBase]: For 539233/541252 co-relation queries the response was YES. [2023-11-29 05:48:48,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386367 conditions, 82095 events. 57265/82095 cut-off events. For 539233/541252 co-relation queries the response was YES. Maximal size of possible extension queue 3748. Compared 598864 event pairs, 20818 based on Foata normal form. 840/81368 useless extension candidates. Maximal degree in co-relation 386314. Up to 51316 conditions per place. [2023-11-29 05:48:49,100 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 210 selfloop transitions, 132 changer transitions 9/395 dead transitions. [2023-11-29 05:48:49,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 395 transitions, 5544 flow [2023-11-29 05:48:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:48:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:48:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2023-11-29 05:48:49,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.744927536231884 [2023-11-29 05:48:49,102 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 257 transitions. [2023-11-29 05:48:49,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 257 transitions. [2023-11-29 05:48:49,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:48:49,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 257 transitions. [2023-11-29 05:48:49,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:49,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:48:49,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:48:49,103 INFO L175 Difference]: Start difference. First operand has 158 places, 335 transitions, 4411 flow. Second operand 5 states and 257 transitions. [2023-11-29 05:48:49,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 395 transitions, 5544 flow [2023-11-29 05:48:54,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 395 transitions, 5488 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:48:54,276 INFO L231 Difference]: Finished difference. Result has 162 places, 334 transitions, 4625 flow [2023-11-29 05:48:54,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=4367, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4625, PETRI_PLACES=162, PETRI_TRANSITIONS=334} [2023-11-29 05:48:54,277 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 89 predicate places. [2023-11-29 05:48:54,277 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 334 transitions, 4625 flow [2023-11-29 05:48:54,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:54,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:48:54,277 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] [2023-11-29 05:48:54,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 05:48:54,277 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:48:54,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash -165957450, now seen corresponding path program 5 times [2023-11-29 05:48:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:48:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788084489] [2023-11-29 05:48:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:48:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:48:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:48:54,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788084489] [2023-11-29 05:48:54,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788084489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:48:54,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:48:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:48:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465991025] [2023-11-29 05:48:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:48:54,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:48:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:48:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:48:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:48:54,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 69 [2023-11-29 05:48:54,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 334 transitions, 4625 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:48:54,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:48:54,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 69 [2023-11-29 05:48:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:49:08,667 INFO L124 PetriNetUnfolderBase]: 76942/106350 cut-off events. [2023-11-29 05:49:08,667 INFO L125 PetriNetUnfolderBase]: For 655270/655753 co-relation queries the response was YES. [2023-11-29 05:49:09,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507299 conditions, 106350 events. 76942/106350 cut-off events. For 655270/655753 co-relation queries the response was YES. Maximal size of possible extension queue 4203. Compared 733620 event pairs, 17172 based on Foata normal form. 284/106455 useless extension candidates. Maximal degree in co-relation 507245. Up to 59836 conditions per place. [2023-11-29 05:49:09,691 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 396 selfloop transitions, 164 changer transitions 0/604 dead transitions. [2023-11-29 05:49:09,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 604 transitions, 8764 flow [2023-11-29 05:49:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:49:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:49:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2023-11-29 05:49:09,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7623188405797101 [2023-11-29 05:49:09,692 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 263 transitions. [2023-11-29 05:49:09,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 263 transitions. [2023-11-29 05:49:09,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:49:09,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 263 transitions. [2023-11-29 05:49:09,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:49:09,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:49:09,693 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 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-11-29 05:49:09,693 INFO L175 Difference]: Start difference. First operand has 162 places, 334 transitions, 4625 flow. Second operand 5 states and 263 transitions. [2023-11-29 05:49:09,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 604 transitions, 8764 flow [2023-11-29 05:49:17,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 604 transitions, 8424 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 05:49:17,243 INFO L231 Difference]: Finished difference. Result has 164 places, 454 transitions, 6484 flow [2023-11-29 05:49:17,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=4353, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6484, PETRI_PLACES=164, PETRI_TRANSITIONS=454} [2023-11-29 05:49:17,244 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 91 predicate places. [2023-11-29 05:49:17,244 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 454 transitions, 6484 flow [2023-11-29 05:49:17,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:49:17,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:49:17,245 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] [2023-11-29 05:49:17,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 05:49:17,245 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:49:17,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:49:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2011122644, now seen corresponding path program 6 times [2023-11-29 05:49:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:49:17,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048778181] [2023-11-29 05:49:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:49:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:49:17,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:49:17,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048778181] [2023-11-29 05:49:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048778181] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:49:17,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713532742] [2023-11-29 05:49:17,323 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 05:49:17,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:49:17,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:49:17,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:49:17,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:49:17,460 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-29 05:49:17,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:49:17,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:49:17,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:49:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:49:17,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:49:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:49:17,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713532742] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:49:17,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:49:17,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-29 05:49:17,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141996399] [2023-11-29 05:49:17,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:49:17,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:49:17,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:49:17,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:49:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:49:17,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 69 [2023-11-29 05:49:17,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 454 transitions, 6484 flow. Second operand has 11 states, 11 states have (on average 39.27272727272727) internal successors, (432), 11 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:49:17,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:49:17,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 69 [2023-11-29 05:49:17,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:49:39,772 INFO L124 PetriNetUnfolderBase]: 109449/149388 cut-off events. [2023-11-29 05:49:39,772 INFO L125 PetriNetUnfolderBase]: For 1027162/1027181 co-relation queries the response was YES. [2023-11-29 05:49:40,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740259 conditions, 149388 events. 109449/149388 cut-off events. For 1027162/1027181 co-relation queries the response was YES. Maximal size of possible extension queue 5687. Compared 1027492 event pairs, 13355 based on Foata normal form. 2407/151651 useless extension candidates. Maximal degree in co-relation 740203. Up to 32375 conditions per place. [2023-11-29 05:49:41,199 INFO L140 encePairwiseOnDemand]: 59/69 looper letters, 991 selfloop transitions, 317 changer transitions 8/1329 dead transitions. [2023-11-29 05:49:41,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1329 transitions, 18675 flow [2023-11-29 05:49:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 05:49:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-29 05:49:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1164 transitions. [2023-11-29 05:49:41,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7334593572778828 [2023-11-29 05:49:41,201 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1164 transitions. [2023-11-29 05:49:41,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1164 transitions. [2023-11-29 05:49:41,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:49:41,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1164 transitions. [2023-11-29 05:49:41,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 50.608695652173914) internal successors, (1164), 23 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:49:41,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 69.0) internal successors, (1656), 24 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:49:41,205 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 69.0) internal successors, (1656), 24 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:49:41,205 INFO L175 Difference]: Start difference. First operand has 164 places, 454 transitions, 6484 flow. Second operand 23 states and 1164 transitions. [2023-11-29 05:49:41,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1329 transitions, 18675 flow [2023-11-29 05:49:54,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1329 transitions, 18300 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-29 05:49:54,179 INFO L231 Difference]: Finished difference. Result has 199 places, 585 transitions, 9198 flow [2023-11-29 05:49:54,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=6356, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9198, PETRI_PLACES=199, PETRI_TRANSITIONS=585} [2023-11-29 05:49:54,180 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 126 predicate places. [2023-11-29 05:49:54,180 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 585 transitions, 9198 flow [2023-11-29 05:49:54,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 39.27272727272727) internal successors, (432), 11 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:49:54,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:49:54,180 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] [2023-11-29 05:49:54,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:49:54,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab521184-8192-45f9-af9f-94d94b6fddb3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:49:54,381 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 05:49:54,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:49:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash -23343166, now seen corresponding path program 7 times [2023-11-29 05:49:54,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:49:54,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245969942] [2023-11-29 05:49:54,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:54,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:49:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:49:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:49:54,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245969942] [2023-11-29 05:49:54,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245969942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:49:54,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:49:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:49:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292648249] [2023-11-29 05:49:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:49:54,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:49:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:49:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:49:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:49:54,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2023-11-29 05:49:54,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 585 transitions, 9198 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:49:54,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:49:54,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2023-11-29 05:49:54,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand