./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-4.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_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/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_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/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_2421d809-3ae1-48b8-9e74-cd802048455d/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 1b3f2e76aa91b47c1b0ab3ebb03a5219efabc6e79eff8c780f49eaa0a2d155ad --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:55:28,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:55:28,399 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:55:28,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:55:28,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:55:28,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:55:28,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:55:28,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:55:28,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:55:28,435 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:55:28,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:55:28,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:55:28,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:55:28,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:55:28,438 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:55:28,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:55:28,439 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:55:28,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:55:28,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:55:28,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:55:28,441 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:55:28,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:55:28,442 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:55:28,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:55:28,443 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:55:28,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:55:28,444 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:55:28,444 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:55:28,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:55:28,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:55:28,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:55:28,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:55:28,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:55:28,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:55:28,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:55:28,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:55:28,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:55:28,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:55:28,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:55:28,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:55:28,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:55:28,450 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_2421d809-3ae1-48b8-9e74-cd802048455d/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_2421d809-3ae1-48b8-9e74-cd802048455d/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 -> 1b3f2e76aa91b47c1b0ab3ebb03a5219efabc6e79eff8c780f49eaa0a2d155ad [2023-11-29 04:55:28,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:55:28,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:55:28,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:55:28,732 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:55:28,733 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:55:28,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2023-11-29 04:55:31,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:55:31,850 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:55:31,850 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2023-11-29 04:55:31,859 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/data/ab0349ef9/68cb76232a5e459f8f13c5e213170a99/FLAG26388a5d3 [2023-11-29 04:55:31,877 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/data/ab0349ef9/68cb76232a5e459f8f13c5e213170a99 [2023-11-29 04:55:31,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:55:31,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:55:31,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:55:31,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:55:31,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:55:31,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:55:31" (1/1) ... [2023-11-29 04:55:31,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5b374c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:31, skipping insertion in model container [2023-11-29 04:55:31,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:55:31" (1/1) ... [2023-11-29 04:55:31,929 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:55:32,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:55:32,148 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:55:32,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:55:32,186 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:55:32,186 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:55:32,195 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:55:32,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32 WrapperNode [2023-11-29 04:55:32,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:55:32,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:55:32,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:55:32,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:55:32,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,233 INFO L138 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2023-11-29 04:55:32,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:55:32,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:55:32,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:55:32,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:55:32,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,268 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 04:55:32,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:55:32,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:55:32,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:55:32,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:55:32,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (1/1) ... [2023-11-29 04:55:32,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:55:32,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:32,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:55:32,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:55:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:55:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 04:55:32,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 04:55:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 04:55:32,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 04:55:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 04:55:32,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 04:55:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:55:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:55:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:55:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:55:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:55:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:55:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:55:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:55:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:55:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:55:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:55:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:55:32,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:55:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:55:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:55:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:55:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:55:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:55:32,357 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 04:55:32,484 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:55:32,487 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:55:32,741 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:55:32,883 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:55:32,883 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 04:55:32,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:55:32 BoogieIcfgContainer [2023-11-29 04:55:32,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:55:32,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:55:32,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:55:32,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:55:32,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:55:31" (1/3) ... [2023-11-29 04:55:32,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4388f27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:55:32, skipping insertion in model container [2023-11-29 04:55:32,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:32" (2/3) ... [2023-11-29 04:55:32,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4388f27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:55:32, skipping insertion in model container [2023-11-29 04:55:32,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:55:32" (3/3) ... [2023-11-29 04:55:32,894 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2023-11-29 04:55:32,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:55:32,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-29 04:55:32,915 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:55:32,970 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 04:55:33,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 61 transitions, 143 flow [2023-11-29 04:55:33,041 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2023-11-29 04:55:33,041 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 04:55:33,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 4/58 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-29 04:55:33,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 61 transitions, 143 flow [2023-11-29 04:55:33,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 57 transitions, 132 flow [2023-11-29 04:55:33,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:55:33,070 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;@3c3d34b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:55:33,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-29 04:55:33,074 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:55:33,074 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:55:33,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:55:33,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:33,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:55:33,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:33,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 9144, now seen corresponding path program 1 times [2023-11-29 04:55:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:33,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656269683] [2023-11-29 04:55:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:33,432 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 04:55:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656269683] [2023-11-29 04:55:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656269683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:55:33,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029784751] [2023-11-29 04:55:33,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:33,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:33,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:33,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:33,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-29 04:55:33,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 04:55:33,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:33,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-29 04:55:33,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:33,616 INFO L124 PetriNetUnfolderBase]: 97/265 cut-off events. [2023-11-29 04:55:33,617 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-29 04:55:33,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 265 events. 97/265 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1340 event pairs, 72 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 379. Up to 154 conditions per place. [2023-11-29 04:55:33,624 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 17 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-29 04:55:33,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 160 flow [2023-11-29 04:55:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 04:55:33,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7540983606557377 [2023-11-29 04:55:33,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 04:55:33,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 04:55:33,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:33,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 04:55:33,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 04:55:33,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:33,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:33,650 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 132 flow. Second operand 3 states and 138 transitions. [2023-11-29 04:55:33,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 160 flow [2023-11-29 04:55:33,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 148 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 04:55:33,656 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 114 flow [2023-11-29 04:55:33,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-29 04:55:33,661 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -8 predicate places. [2023-11-29 04:55:33,662 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 114 flow [2023-11-29 04:55:33,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 04:55:33,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:33,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:55:33,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:55:33,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:33,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash 9145, now seen corresponding path program 1 times [2023-11-29 04:55:33,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:33,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659194301] [2023-11-29 04:55:33,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:33,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:33,835 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 04:55:33,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:33,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659194301] [2023-11-29 04:55:33,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659194301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:33,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:33,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:55:33,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188829204] [2023-11-29 04:55:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:33,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:33,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:33,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:33,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 61 [2023-11-29 04:55:33,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 04:55:33,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:33,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 61 [2023-11-29 04:55:33,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:33,943 INFO L124 PetriNetUnfolderBase]: 73/228 cut-off events. [2023-11-29 04:55:33,943 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 04:55:33,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 228 events. 73/228 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1135 event pairs, 52 based on Foata normal form. 13/193 useless extension candidates. Maximal degree in co-relation 353. Up to 117 conditions per place. [2023-11-29 04:55:33,947 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 15 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-11-29 04:55:33,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 142 flow [2023-11-29 04:55:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 04:55:33,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7704918032786885 [2023-11-29 04:55:33,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 04:55:33,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 04:55:33,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:33,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 04:55:33,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 04:55:33,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:33,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:33,955 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-29 04:55:33,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 142 flow [2023-11-29 04:55:33,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:55:33,958 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 111 flow [2023-11-29 04:55:33,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-11-29 04:55:33,959 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-11-29 04:55:33,959 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 111 flow [2023-11-29 04:55:33,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 04:55:33,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:33,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:55:33,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:55:33,960 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:33,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash 272689716, now seen corresponding path program 1 times [2023-11-29 04:55:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:33,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677942674] [2023-11-29 04:55:33,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:34,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677942674] [2023-11-29 04:55:34,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677942674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:34,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:34,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:55:34,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908618428] [2023-11-29 04:55:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:34,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:34,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-29 04:55:34,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 04:55:34,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:34,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-29 04:55:34,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:34,181 INFO L124 PetriNetUnfolderBase]: 80/228 cut-off events. [2023-11-29 04:55:34,182 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 04:55:34,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 228 events. 80/228 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1110 event pairs, 58 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 367. Up to 131 conditions per place. [2023-11-29 04:55:34,185 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 17 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-11-29 04:55:34,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 143 flow [2023-11-29 04:55:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-29 04:55:34,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7486338797814208 [2023-11-29 04:55:34,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-29 04:55:34,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-29 04:55:34,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:34,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-29 04:55:34,190 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 04:55:34,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:34,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:34,192 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 111 flow. Second operand 3 states and 137 transitions. [2023-11-29 04:55:34,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 143 flow [2023-11-29 04:55:34,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:55:34,195 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 108 flow [2023-11-29 04:55:34,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-11-29 04:55:34,196 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2023-11-29 04:55:34,197 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 108 flow [2023-11-29 04:55:34,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 04:55:34,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:34,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:55:34,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:55:34,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:34,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash 272689717, now seen corresponding path program 1 times [2023-11-29 04:55:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:34,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090245271] [2023-11-29 04:55:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:34,300 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 04:55:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090245271] [2023-11-29 04:55:34,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090245271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:34,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:55:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433275470] [2023-11-29 04:55:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:34,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:34,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 61 [2023-11-29 04:55:34,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 04:55:34,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:34,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 61 [2023-11-29 04:55:34,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:34,392 INFO L124 PetriNetUnfolderBase]: 73/214 cut-off events. [2023-11-29 04:55:34,393 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 04:55:34,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 214 events. 73/214 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1014 event pairs, 52 based on Foata normal form. 7/187 useless extension candidates. Maximal degree in co-relation 339. Up to 117 conditions per place. [2023-11-29 04:55:34,396 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 15 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-11-29 04:55:34,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 136 flow [2023-11-29 04:55:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 04:55:34,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7704918032786885 [2023-11-29 04:55:34,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 04:55:34,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 04:55:34,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:34,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 04:55:34,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 04:55:34,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:34,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:34,402 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 108 flow. Second operand 3 states and 141 transitions. [2023-11-29 04:55:34,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 136 flow [2023-11-29 04:55:34,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:55:34,405 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 105 flow [2023-11-29 04:55:34,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-11-29 04:55:34,406 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -11 predicate places. [2023-11-29 04:55:34,407 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 105 flow [2023-11-29 04:55:34,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 04:55:34,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:34,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:34,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:55:34,408 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:34,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1916451594, now seen corresponding path program 1 times [2023-11-29 04:55:34,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:34,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825534317] [2023-11-29 04:55:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:34,471 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 04:55:34,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825534317] [2023-11-29 04:55:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825534317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:34,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:34,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:55:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144943760] [2023-11-29 04:55:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:34,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:34,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-29 04:55:34,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 04:55:34,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:34,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-29 04:55:34,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:34,558 INFO L124 PetriNetUnfolderBase]: 83/216 cut-off events. [2023-11-29 04:55:34,559 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 04:55:34,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 216 events. 83/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1018 event pairs, 60 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 359. Up to 135 conditions per place. [2023-11-29 04:55:34,561 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 17 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-11-29 04:55:34,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 137 flow [2023-11-29 04:55:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-29 04:55:34,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7486338797814208 [2023-11-29 04:55:34,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-29 04:55:34,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-29 04:55:34,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:34,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-29 04:55:34,565 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 04:55:34,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:34,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:34,567 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 105 flow. Second operand 3 states and 137 transitions. [2023-11-29 04:55:34,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 137 flow [2023-11-29 04:55:34,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:55:34,570 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 102 flow [2023-11-29 04:55:34,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-11-29 04:55:34,571 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -12 predicate places. [2023-11-29 04:55:34,571 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 102 flow [2023-11-29 04:55:34,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 04:55:34,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:34,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:34,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:55:34,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:34,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1916451595, now seen corresponding path program 1 times [2023-11-29 04:55:34,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:34,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154716574] [2023-11-29 04:55:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:34,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:34,638 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 04:55:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154716574] [2023-11-29 04:55:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154716574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:34,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:34,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:55:34,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541197399] [2023-11-29 04:55:34,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:34,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:34,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 61 [2023-11-29 04:55:34,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 04:55:34,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:34,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 61 [2023-11-29 04:55:34,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:34,745 INFO L124 PetriNetUnfolderBase]: 73/198 cut-off events. [2023-11-29 04:55:34,745 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 04:55:34,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 198 events. 73/198 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 899 event pairs, 52 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 323. Up to 117 conditions per place. [2023-11-29 04:55:34,748 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 15 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-11-29 04:55:34,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 130 flow [2023-11-29 04:55:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 04:55:34,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7704918032786885 [2023-11-29 04:55:34,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 04:55:34,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 04:55:34,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:34,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 04:55:34,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 04:55:34,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:34,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:34,752 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 102 flow. Second operand 3 states and 141 transitions. [2023-11-29 04:55:34,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 130 flow [2023-11-29 04:55:34,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:55:34,754 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 99 flow [2023-11-29 04:55:34,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-11-29 04:55:34,755 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -13 predicate places. [2023-11-29 04:55:34,755 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 99 flow [2023-11-29 04:55:34,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 04:55:34,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:34,756 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] [2023-11-29 04:55:34,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:55:34,756 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:34,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2138363269, now seen corresponding path program 1 times [2023-11-29 04:55:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812670658] [2023-11-29 04:55:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:34,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:34,913 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 04:55:34,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:34,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812670658] [2023-11-29 04:55:34,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812670658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:34,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:55:34,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938449141] [2023-11-29 04:55:34,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:34,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:55:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:34,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:55:34,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:55:34,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-29 04:55:34,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 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 04:55:34,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:34,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-29 04:55:34,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:35,059 INFO L124 PetriNetUnfolderBase]: 122/246 cut-off events. [2023-11-29 04:55:35,059 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 04:55:35,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 246 events. 122/246 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 871 event pairs, 14 based on Foata normal form. 10/246 useless extension candidates. Maximal degree in co-relation 445. Up to 114 conditions per place. [2023-11-29 04:55:35,063 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 28 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-11-29 04:55:35,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 191 flow [2023-11-29 04:55:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:55:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:55:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2023-11-29 04:55:35,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7909836065573771 [2023-11-29 04:55:35,065 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 193 transitions. [2023-11-29 04:55:35,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 193 transitions. [2023-11-29 04:55:35,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:35,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 193 transitions. [2023-11-29 04:55:35,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 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 04:55:35,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 04:55:35,068 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 04:55:35,068 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 99 flow. Second operand 4 states and 193 transitions. [2023-11-29 04:55:35,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 191 flow [2023-11-29 04:55:35,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:55:35,071 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 119 flow [2023-11-29 04:55:35,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 04:55:35,072 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-11-29 04:55:35,072 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 119 flow [2023-11-29 04:55:35,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 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 04:55:35,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:35,073 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] [2023-11-29 04:55:35,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:55:35,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:35,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash -892580371, now seen corresponding path program 2 times [2023-11-29 04:55:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903803778] [2023-11-29 04:55:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:35,252 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 04:55:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903803778] [2023-11-29 04:55:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903803778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:35,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:35,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:55:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648833015] [2023-11-29 04:55:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:35,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:55:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:35,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:55:35,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:55:35,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-29 04:55:35,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 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 04:55:35,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:35,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-29 04:55:35,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:35,445 INFO L124 PetriNetUnfolderBase]: 236/433 cut-off events. [2023-11-29 04:55:35,445 INFO L125 PetriNetUnfolderBase]: For 38/50 co-relation queries the response was YES. [2023-11-29 04:55:35,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 433 events. 236/433 cut-off events. For 38/50 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1775 event pairs, 45 based on Foata normal form. 12/405 useless extension candidates. Maximal degree in co-relation 848. Up to 159 conditions per place. [2023-11-29 04:55:35,450 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 33 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2023-11-29 04:55:35,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 251 flow [2023-11-29 04:55:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:55:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:55:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2023-11-29 04:55:35,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7737704918032787 [2023-11-29 04:55:35,452 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 236 transitions. [2023-11-29 04:55:35,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 236 transitions. [2023-11-29 04:55:35,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:35,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 236 transitions. [2023-11-29 04:55:35,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 0 states have call successors, (0), 0 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 04:55:35,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 04:55:35,455 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 04:55:35,455 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 119 flow. Second operand 5 states and 236 transitions. [2023-11-29 04:55:35,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 251 flow [2023-11-29 04:55:35,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:55:35,458 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 172 flow [2023-11-29 04:55:35,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 04:55:35,459 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2023-11-29 04:55:35,459 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 172 flow [2023-11-29 04:55:35,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 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 04:55:35,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:35,460 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] [2023-11-29 04:55:35,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:55:35,460 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:35,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1324022851, now seen corresponding path program 3 times [2023-11-29 04:55:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798524845] [2023-11-29 04:55:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:35,709 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 04:55:35,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:35,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798524845] [2023-11-29 04:55:35,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798524845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:35,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:35,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:55:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019846477] [2023-11-29 04:55:35,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:35,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:55:35,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:35,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:55:35,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:55:35,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-29 04:55:35,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 04:55:35,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:35,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-29 04:55:35,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:36,061 INFO L124 PetriNetUnfolderBase]: 633/1280 cut-off events. [2023-11-29 04:55:36,062 INFO L125 PetriNetUnfolderBase]: For 748/808 co-relation queries the response was YES. [2023-11-29 04:55:36,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1280 events. 633/1280 cut-off events. For 748/808 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7650 event pairs, 61 based on Foata normal form. 54/1231 useless extension candidates. Maximal degree in co-relation 2736. Up to 390 conditions per place. [2023-11-29 04:55:36,077 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 49 selfloop transitions, 15 changer transitions 8/97 dead transitions. [2023-11-29 04:55:36,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 97 transitions, 468 flow [2023-11-29 04:55:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:55:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:55:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2023-11-29 04:55:36,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7962529274004684 [2023-11-29 04:55:36,079 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 340 transitions. [2023-11-29 04:55:36,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 340 transitions. [2023-11-29 04:55:36,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:36,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 340 transitions. [2023-11-29 04:55:36,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 48.57142857142857) internal successors, (340), 7 states have internal predecessors, (340), 0 states have call successors, (0), 0 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 04:55:36,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 61.0) internal successors, (488), 8 states have internal predecessors, (488), 0 states have call successors, (0), 0 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 04:55:36,083 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 61.0) internal successors, (488), 8 states have internal predecessors, (488), 0 states have call successors, (0), 0 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 04:55:36,084 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 172 flow. Second operand 7 states and 340 transitions. [2023-11-29 04:55:36,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 97 transitions, 468 flow [2023-11-29 04:55:36,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:55:36,091 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 313 flow [2023-11-29 04:55:36,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2023-11-29 04:55:36,092 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 9 predicate places. [2023-11-29 04:55:36,093 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 313 flow [2023-11-29 04:55:36,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 04:55:36,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:36,093 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 04:55:36,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:55:36,093 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:36,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:36,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1287380403, now seen corresponding path program 1 times [2023-11-29 04:55:36,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:36,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004758145] [2023-11-29 04:55:36,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:36,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,185 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 04:55:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004758145] [2023-11-29 04:55:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004758145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:36,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:36,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:55:36,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405203103] [2023-11-29 04:55:36,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:36,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:36,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:36,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:36,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-29 04:55:36,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 313 flow. Second operand has 3 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 04:55:36,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:36,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-29 04:55:36,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:36,490 INFO L124 PetriNetUnfolderBase]: 593/1299 cut-off events. [2023-11-29 04:55:36,490 INFO L125 PetriNetUnfolderBase]: For 1849/2177 co-relation queries the response was YES. [2023-11-29 04:55:36,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 1299 events. 593/1299 cut-off events. For 1849/2177 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8062 event pairs, 186 based on Foata normal form. 110/1252 useless extension candidates. Maximal degree in co-relation 3157. Up to 538 conditions per place. [2023-11-29 04:55:36,511 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 33 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-11-29 04:55:36,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 428 flow [2023-11-29 04:55:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-29 04:55:36,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2023-11-29 04:55:36,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-29 04:55:36,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-29 04:55:36,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:36,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-29 04:55:36,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 04:55:36,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:36,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:36,515 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 313 flow. Second operand 3 states and 154 transitions. [2023-11-29 04:55:36,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 428 flow [2023-11-29 04:55:36,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 424 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-29 04:55:36,525 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 331 flow [2023-11-29 04:55:36,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2023-11-29 04:55:36,526 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 13 predicate places. [2023-11-29 04:55:36,526 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 331 flow [2023-11-29 04:55:36,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 04:55:36,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:36,527 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 04:55:36,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:55:36,527 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:36,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash 872694921, now seen corresponding path program 1 times [2023-11-29 04:55:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:36,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182599402] [2023-11-29 04:55:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,625 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 04:55:36,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:36,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182599402] [2023-11-29 04:55:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182599402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:36,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:36,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:55:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913395550] [2023-11-29 04:55:36,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:36,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:36,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:36,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-29 04:55:36,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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 04:55:36,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:36,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-29 04:55:36,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:37,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][67], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 138#true, 48#L54true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 4#L111-4true, 28#L76true, 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:37,012 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 04:55:37,013 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:37,013 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:37,013 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:37,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][67], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 138#true, 46#L112true, 48#L54true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 28#L76true, 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:37,082 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 04:55:37,082 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:55:37,082 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:55:37,082 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:55:37,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([292] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][52], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 42#thread1EXITtrue, Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 138#true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 4#L111-4true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 28#L76true, 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:37,121 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-11-29 04:55:37,121 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-29 04:55:37,121 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-29 04:55:37,122 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-29 04:55:37,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([292] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][52], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 42#thread1EXITtrue, Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 138#true, 46#L112true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 28#L76true, 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:37,140 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-11-29 04:55:37,141 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-29 04:55:37,141 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-29 04:55:37,141 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-29 04:55:37,191 INFO L124 PetriNetUnfolderBase]: 1604/3035 cut-off events. [2023-11-29 04:55:37,191 INFO L125 PetriNetUnfolderBase]: For 3206/3272 co-relation queries the response was YES. [2023-11-29 04:55:37,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7668 conditions, 3035 events. 1604/3035 cut-off events. For 3206/3272 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 20627 event pairs, 482 based on Foata normal form. 61/2753 useless extension candidates. Maximal degree in co-relation 7638. Up to 1320 conditions per place. [2023-11-29 04:55:37,232 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 36 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2023-11-29 04:55:37,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 82 transitions, 474 flow [2023-11-29 04:55:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-29 04:55:37,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2023-11-29 04:55:37,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-29 04:55:37,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-29 04:55:37,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:37,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-29 04:55:37,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 04:55:37,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:37,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 04:55:37,238 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 331 flow. Second operand 3 states and 154 transitions. [2023-11-29 04:55:37,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 82 transitions, 474 flow [2023-11-29 04:55:37,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:55:37,263 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 347 flow [2023-11-29 04:55:37,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2023-11-29 04:55:37,264 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2023-11-29 04:55:37,265 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 347 flow [2023-11-29 04:55:37,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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 04:55:37,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:37,265 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:37,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:55:37,266 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:37,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1197222765, now seen corresponding path program 1 times [2023-11-29 04:55:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:37,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822052695] [2023-11-29 04:55:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:37,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:37,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822052695] [2023-11-29 04:55:37,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822052695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:37,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:37,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:55:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535646749] [2023-11-29 04:55:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:37,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:55:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:55:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:55:37,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 61 [2023-11-29 04:55:37,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 04:55:37,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:37,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 61 [2023-11-29 04:55:37,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:38,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 42#thread1EXITtrue, Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, 4#L111-4true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:38,358 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 04:55:38,358 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:55:38,358 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:55:38,358 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:55:38,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), 42#thread1EXITtrue, Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 46#L112true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:38,406 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 04:55:38,406 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:38,406 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:38,406 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:38,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 42#thread1EXITtrue, Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, 4#L111-4true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:38,410 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 04:55:38,410 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:38,410 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:38,410 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:55:38,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), 42#thread1EXITtrue, Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 46#L112true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:38,446 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 04:55:38,447 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:55:38,447 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:55:38,447 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:55:38,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 132#true, 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 48#L54true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, 4#L111-4true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:38,466 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-29 04:55:38,466 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:55:38,466 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:55:38,466 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:55:38,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 54#L112-2true, Black: 138#true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:38,477 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-29 04:55:38,477 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:55:38,477 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:55:38,477 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:55:38,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 132#true, 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 46#L112true, 48#L54true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:38,493 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 04:55:38,493 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:55:38,493 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:55:38,493 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:55:38,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 54#L112-2true, Black: 138#true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-29 04:55:38,504 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 04:55:38,504 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:55:38,504 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:55:38,504 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:55:38,540 INFO L124 PetriNetUnfolderBase]: 2873/5534 cut-off events. [2023-11-29 04:55:38,540 INFO L125 PetriNetUnfolderBase]: For 8815/8967 co-relation queries the response was YES. [2023-11-29 04:55:38,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15575 conditions, 5534 events. 2873/5534 cut-off events. For 8815/8967 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 41702 event pairs, 231 based on Foata normal form. 116/5391 useless extension candidates. Maximal degree in co-relation 15543. Up to 926 conditions per place. [2023-11-29 04:55:38,585 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 40 selfloop transitions, 9 changer transitions 81/158 dead transitions. [2023-11-29 04:55:38,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 158 transitions, 1069 flow [2023-11-29 04:55:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:55:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:55:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 485 transitions. [2023-11-29 04:55:38,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7950819672131147 [2023-11-29 04:55:38,588 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 485 transitions. [2023-11-29 04:55:38,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 485 transitions. [2023-11-29 04:55:38,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:38,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 485 transitions. [2023-11-29 04:55:38,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 0 states have call successors, (0), 0 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 04:55:38,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 61.0) internal successors, (671), 11 states have internal predecessors, (671), 0 states have call successors, (0), 0 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 04:55:38,592 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 61.0) internal successors, (671), 11 states have internal predecessors, (671), 0 states have call successors, (0), 0 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 04:55:38,592 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 347 flow. Second operand 10 states and 485 transitions. [2023-11-29 04:55:38,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 158 transitions, 1069 flow [2023-11-29 04:55:38,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 158 transitions, 1063 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:55:38,667 INFO L231 Difference]: Finished difference. Result has 93 places, 61 transitions, 346 flow [2023-11-29 04:55:38,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=346, PETRI_PLACES=93, PETRI_TRANSITIONS=61} [2023-11-29 04:55:38,668 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 30 predicate places. [2023-11-29 04:55:38,668 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 61 transitions, 346 flow [2023-11-29 04:55:38,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 04:55:38,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:38,669 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:38,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:55:38,669 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:38,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash 868288415, now seen corresponding path program 1 times [2023-11-29 04:55:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:38,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876050533] [2023-11-29 04:55:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:38,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:38,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876050533] [2023-11-29 04:55:38,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876050533] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:38,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028380538] [2023-11-29 04:55:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:38,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:38,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:38,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:38,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:55:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:39,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:55:39,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:55:39,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:55:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028380538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:55:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2023-11-29 04:55:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732449041] [2023-11-29 04:55:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:39,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:55:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:39,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:55:39,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:55:39,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-29 04:55:39,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 61 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 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 04:55:39,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:39,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-29 04:55:39,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:39,475 INFO L124 PetriNetUnfolderBase]: 760/1643 cut-off events. [2023-11-29 04:55:39,475 INFO L125 PetriNetUnfolderBase]: For 7609/7885 co-relation queries the response was YES. [2023-11-29 04:55:39,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 1643 events. 760/1643 cut-off events. For 7609/7885 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10493 event pairs, 155 based on Foata normal form. 96/1564 useless extension candidates. Maximal degree in co-relation 5839. Up to 507 conditions per place. [2023-11-29 04:55:39,508 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 35 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2023-11-29 04:55:39,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 502 flow [2023-11-29 04:55:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:55:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:55:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2023-11-29 04:55:39,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7770491803278688 [2023-11-29 04:55:39,511 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 237 transitions. [2023-11-29 04:55:39,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 237 transitions. [2023-11-29 04:55:39,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:39,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 237 transitions. [2023-11-29 04:55:39,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 0 states have call successors, (0), 0 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 04:55:39,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 04:55:39,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 04:55:39,565 INFO L175 Difference]: Start difference. First operand has 93 places, 61 transitions, 346 flow. Second operand 5 states and 237 transitions. [2023-11-29 04:55:39,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 502 flow [2023-11-29 04:55:39,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 464 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-11-29 04:55:39,576 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 335 flow [2023-11-29 04:55:39,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2023-11-29 04:55:39,577 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places. [2023-11-29 04:55:39,577 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 335 flow [2023-11-29 04:55:39,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 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 04:55:39,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:39,577 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:39,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:55:39,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:39,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:39,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash 459086853, now seen corresponding path program 2 times [2023-11-29 04:55:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:39,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382412461] [2023-11-29 04:55:39,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:39,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:39,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382412461] [2023-11-29 04:55:39,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382412461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:39,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101555120] [2023-11-29 04:55:39,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:55:39,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:39,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:39,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:55:40,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:55:40,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:55:40,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:55:40,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:40,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101555120] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:40,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:55:40,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 9 [2023-11-29 04:55:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258543690] [2023-11-29 04:55:40,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:40,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:55:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:40,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:55:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:55:40,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 04:55:40,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 335 flow. Second operand has 10 states, 10 states have (on average 40.4) internal successors, (404), 10 states have internal predecessors, (404), 0 states have call successors, (0), 0 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 04:55:40,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:40,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 04:55:40,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:41,815 INFO L124 PetriNetUnfolderBase]: 3475/6533 cut-off events. [2023-11-29 04:55:41,815 INFO L125 PetriNetUnfolderBase]: For 21606/22162 co-relation queries the response was YES. [2023-11-29 04:55:41,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23218 conditions, 6533 events. 3475/6533 cut-off events. For 21606/22162 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 49115 event pairs, 321 based on Foata normal form. 220/6108 useless extension candidates. Maximal degree in co-relation 23181. Up to 1367 conditions per place. [2023-11-29 04:55:41,949 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 78 selfloop transitions, 30 changer transitions 59/194 dead transitions. [2023-11-29 04:55:41,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1479 flow [2023-11-29 04:55:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:55:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 04:55:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 739 transitions. [2023-11-29 04:55:41,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.757172131147541 [2023-11-29 04:55:41,954 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 739 transitions. [2023-11-29 04:55:41,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 739 transitions. [2023-11-29 04:55:41,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:41,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 739 transitions. [2023-11-29 04:55:41,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 46.1875) internal successors, (739), 16 states have internal predecessors, (739), 0 states have call successors, (0), 0 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 04:55:41,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 61.0) internal successors, (1037), 17 states have internal predecessors, (1037), 0 states have call successors, (0), 0 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 04:55:41,961 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 61.0) internal successors, (1037), 17 states have internal predecessors, (1037), 0 states have call successors, (0), 0 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 04:55:41,961 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 335 flow. Second operand 16 states and 739 transitions. [2023-11-29 04:55:41,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1479 flow [2023-11-29 04:55:41,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 194 transitions, 1464 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:55:41,978 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 646 flow [2023-11-29 04:55:41,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=646, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2023-11-29 04:55:41,979 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 40 predicate places. [2023-11-29 04:55:41,979 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 646 flow [2023-11-29 04:55:41,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.4) internal successors, (404), 10 states have internal predecessors, (404), 0 states have call successors, (0), 0 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 04:55:41,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:41,980 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 04:55:41,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:55:42,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:42,181 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:42,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1127068667, now seen corresponding path program 2 times [2023-11-29 04:55:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:42,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087609806] [2023-11-29 04:55:42,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:42,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:55:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087609806] [2023-11-29 04:55:42,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087609806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:42,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:42,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:55:42,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486927586] [2023-11-29 04:55:42,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:42,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:55:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:55:42,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:55:42,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-29 04:55:42,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 646 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 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 04:55:42,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:42,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-29 04:55:42,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:43,012 INFO L124 PetriNetUnfolderBase]: 1508/3357 cut-off events. [2023-11-29 04:55:43,012 INFO L125 PetriNetUnfolderBase]: For 18204/18686 co-relation queries the response was YES. [2023-11-29 04:55:43,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12677 conditions, 3357 events. 1508/3357 cut-off events. For 18204/18686 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 24849 event pairs, 405 based on Foata normal form. 161/3078 useless extension candidates. Maximal degree in co-relation 12631. Up to 722 conditions per place. [2023-11-29 04:55:43,060 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 57 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2023-11-29 04:55:43,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 107 transitions, 835 flow [2023-11-29 04:55:43,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:55:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:55:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2023-11-29 04:55:43,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.860655737704918 [2023-11-29 04:55:43,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 210 transitions. [2023-11-29 04:55:43,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 210 transitions. [2023-11-29 04:55:43,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:43,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 210 transitions. [2023-11-29 04:55:43,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 04:55:43,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 04:55:43,065 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 04:55:43,065 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 646 flow. Second operand 4 states and 210 transitions. [2023-11-29 04:55:43,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 107 transitions, 835 flow [2023-11-29 04:55:43,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 107 transitions, 768 flow, removed 19 selfloop flow, removed 9 redundant places. [2023-11-29 04:55:43,109 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 570 flow [2023-11-29 04:55:43,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=570, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2023-11-29 04:55:43,110 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 33 predicate places. [2023-11-29 04:55:43,110 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 570 flow [2023-11-29 04:55:43,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 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 04:55:43,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:43,111 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 04:55:43,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:55:43,111 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:43,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash 651545345, now seen corresponding path program 3 times [2023-11-29 04:55:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167654351] [2023-11-29 04:55:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:55:43,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:43,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167654351] [2023-11-29 04:55:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167654351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:43,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:43,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:55:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933293466] [2023-11-29 04:55:43,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:43,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:55:43,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:43,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:55:43,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:55:43,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-29 04:55:43,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 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 04:55:43,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:43,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-29 04:55:43,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:44,020 INFO L124 PetriNetUnfolderBase]: 1895/3981 cut-off events. [2023-11-29 04:55:44,020 INFO L125 PetriNetUnfolderBase]: For 17340/17620 co-relation queries the response was YES. [2023-11-29 04:55:44,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14839 conditions, 3981 events. 1895/3981 cut-off events. For 17340/17620 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29966 event pairs, 508 based on Foata normal form. 66/3640 useless extension candidates. Maximal degree in co-relation 14797. Up to 1148 conditions per place. [2023-11-29 04:55:44,069 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 55 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2023-11-29 04:55:44,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 105 transitions, 839 flow [2023-11-29 04:55:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:55:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:55:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2023-11-29 04:55:44,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8278688524590164 [2023-11-29 04:55:44,071 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 202 transitions. [2023-11-29 04:55:44,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 202 transitions. [2023-11-29 04:55:44,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:44,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 202 transitions. [2023-11-29 04:55:44,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 50.5) internal successors, (202), 4 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 04:55:44,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 04:55:44,074 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 04:55:44,075 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 570 flow. Second operand 4 states and 202 transitions. [2023-11-29 04:55:44,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 105 transitions, 839 flow [2023-11-29 04:55:44,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 105 transitions, 825 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-29 04:55:44,113 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 574 flow [2023-11-29 04:55:44,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=574, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2023-11-29 04:55:44,114 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2023-11-29 04:55:44,114 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 574 flow [2023-11-29 04:55:44,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 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 04:55:44,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:44,115 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:44,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:55:44,115 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:44,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2060945037, now seen corresponding path program 1 times [2023-11-29 04:55:44,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:44,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164120861] [2023-11-29 04:55:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:44,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164120861] [2023-11-29 04:55:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164120861] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982416756] [2023-11-29 04:55:44,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:44,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:44,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:44,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:44,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:55:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:44,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:55:44,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:44,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:44,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982416756] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:44,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:55:44,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2023-11-29 04:55:44,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772616878] [2023-11-29 04:55:44,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:44,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:55:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:55:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:55:44,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-29 04:55:44,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 574 flow. Second operand has 11 states, 11 states have (on average 40.09090909090909) internal successors, (441), 11 states have internal predecessors, (441), 0 states have call successors, (0), 0 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 04:55:44,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:44,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-29 04:55:44,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:46,462 INFO L124 PetriNetUnfolderBase]: 4366/8909 cut-off events. [2023-11-29 04:55:46,462 INFO L125 PetriNetUnfolderBase]: For 53218/53729 co-relation queries the response was YES. [2023-11-29 04:55:46,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37953 conditions, 8909 events. 4366/8909 cut-off events. For 53218/53729 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 69514 event pairs, 272 based on Foata normal form. 427/8868 useless extension candidates. Maximal degree in co-relation 37911. Up to 1807 conditions per place. [2023-11-29 04:55:46,514 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 73 selfloop transitions, 54 changer transitions 71/232 dead transitions. [2023-11-29 04:55:46,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 232 transitions, 2108 flow [2023-11-29 04:55:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 04:55:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-29 04:55:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 869 transitions. [2023-11-29 04:55:46,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7497842968075927 [2023-11-29 04:55:46,519 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 869 transitions. [2023-11-29 04:55:46,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 869 transitions. [2023-11-29 04:55:46,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:46,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 869 transitions. [2023-11-29 04:55:46,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 45.73684210526316) internal successors, (869), 19 states have internal predecessors, (869), 0 states have call successors, (0), 0 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 04:55:46,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 61.0) internal successors, (1220), 20 states have internal predecessors, (1220), 0 states have call successors, (0), 0 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 04:55:46,527 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 61.0) internal successors, (1220), 20 states have internal predecessors, (1220), 0 states have call successors, (0), 0 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 04:55:46,527 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 574 flow. Second operand 19 states and 869 transitions. [2023-11-29 04:55:46,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 232 transitions, 2108 flow [2023-11-29 04:55:46,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 232 transitions, 2108 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:55:46,594 INFO L231 Difference]: Finished difference. Result has 129 places, 109 transitions, 1120 flow [2023-11-29 04:55:46,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1120, PETRI_PLACES=129, PETRI_TRANSITIONS=109} [2023-11-29 04:55:46,595 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 66 predicate places. [2023-11-29 04:55:46,595 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 109 transitions, 1120 flow [2023-11-29 04:55:46,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 40.09090909090909) internal successors, (441), 11 states have internal predecessors, (441), 0 states have call successors, (0), 0 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 04:55:46,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:46,596 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:46,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:55:46,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 04:55:46,797 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:46,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash 208710139, now seen corresponding path program 2 times [2023-11-29 04:55:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370326726] [2023-11-29 04:55:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:46,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:47,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370326726] [2023-11-29 04:55:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370326726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8368553] [2023-11-29 04:55:47,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:55:47,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:47,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:47,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:55:47,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:55:47,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:55:47,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:55:47,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:47,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8368553] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:47,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:55:47,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2023-11-29 04:55:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884426268] [2023-11-29 04:55:47,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:47,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:55:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:47,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:55:47,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:55:47,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 04:55:47,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 109 transitions, 1120 flow. Second operand has 11 states, 11 states have (on average 39.36363636363637) internal successors, (433), 11 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:47,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:47,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 04:55:47,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:50,685 INFO L124 PetriNetUnfolderBase]: 6551/13268 cut-off events. [2023-11-29 04:55:50,685 INFO L125 PetriNetUnfolderBase]: For 148716/148903 co-relation queries the response was YES. [2023-11-29 04:55:50,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66906 conditions, 13268 events. 6551/13268 cut-off events. For 148716/148903 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 110784 event pairs, 657 based on Foata normal form. 378/13636 useless extension candidates. Maximal degree in co-relation 66850. Up to 2014 conditions per place. [2023-11-29 04:55:50,782 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 116 selfloop transitions, 85 changer transitions 125/354 dead transitions. [2023-11-29 04:55:50,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 354 transitions, 4640 flow [2023-11-29 04:55:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 04:55:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-29 04:55:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1235 transitions. [2023-11-29 04:55:50,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7230679156908665 [2023-11-29 04:55:50,787 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1235 transitions. [2023-11-29 04:55:50,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1235 transitions. [2023-11-29 04:55:50,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:50,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1235 transitions. [2023-11-29 04:55:50,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 44.107142857142854) internal successors, (1235), 28 states have internal predecessors, (1235), 0 states have call successors, (0), 0 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 04:55:50,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 61.0) internal successors, (1769), 29 states have internal predecessors, (1769), 0 states have call successors, (0), 0 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 04:55:50,797 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 61.0) internal successors, (1769), 29 states have internal predecessors, (1769), 0 states have call successors, (0), 0 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 04:55:50,797 INFO L175 Difference]: Start difference. First operand has 129 places, 109 transitions, 1120 flow. Second operand 28 states and 1235 transitions. [2023-11-29 04:55:50,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 354 transitions, 4640 flow [2023-11-29 04:55:51,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 354 transitions, 4191 flow, removed 214 selfloop flow, removed 8 redundant places. [2023-11-29 04:55:51,189 INFO L231 Difference]: Finished difference. Result has 162 places, 161 transitions, 2202 flow [2023-11-29 04:55:51,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2202, PETRI_PLACES=162, PETRI_TRANSITIONS=161} [2023-11-29 04:55:51,189 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 99 predicate places. [2023-11-29 04:55:51,190 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 161 transitions, 2202 flow [2023-11-29 04:55:51,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 39.36363636363637) internal successors, (433), 11 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:51,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:51,190 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:51,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:55:51,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 04:55:51,391 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:55:51,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 939413157, now seen corresponding path program 3 times [2023-11-29 04:55:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032912634] [2023-11-29 04:55:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:51,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032912634] [2023-11-29 04:55:51,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032912634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731565080] [2023-11-29 04:55:51,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:55:51,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:51,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:51,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:51,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:55:51,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 04:55:51,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:55:51,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:55:51,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:51,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731565080] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:52,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:55:52,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 11 [2023-11-29 04:55:52,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210410798] [2023-11-29 04:55:52,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:52,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:55:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:55:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:55:52,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 04:55:52,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 161 transitions, 2202 flow. Second operand has 12 states, 12 states have (on average 38.916666666666664) internal successors, (467), 12 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 04:55:52,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:52,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 04:55:52,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:54,891 INFO L124 PetriNetUnfolderBase]: 5269/11106 cut-off events. [2023-11-29 04:55:54,891 INFO L125 PetriNetUnfolderBase]: For 201721/201860 co-relation queries the response was YES. [2023-11-29 04:55:54,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60517 conditions, 11106 events. 5269/11106 cut-off events. For 201721/201860 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 95282 event pairs, 399 based on Foata normal form. 170/11270 useless extension candidates. Maximal degree in co-relation 60462. Up to 2662 conditions per place. [2023-11-29 04:55:54,983 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2023-11-29 04:55:54,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 354 transitions, 5752 flow [2023-11-29 04:55:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 04:55:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-29 04:55:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1206 transitions. [2023-11-29 04:55:54,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7060889929742389 [2023-11-29 04:55:54,988 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1206 transitions. [2023-11-29 04:55:54,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1206 transitions. [2023-11-29 04:55:54,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:54,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1206 transitions. [2023-11-29 04:55:54,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 43.07142857142857) internal successors, (1206), 28 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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 04:55:54,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 61.0) internal successors, (1769), 29 states have internal predecessors, (1769), 0 states have call successors, (0), 0 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 04:55:54,998 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 61.0) internal successors, (1769), 29 states have internal predecessors, (1769), 0 states have call successors, (0), 0 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 04:55:54,998 INFO L175 Difference]: Start difference. First operand has 162 places, 161 transitions, 2202 flow. Second operand 28 states and 1206 transitions. [2023-11-29 04:55:54,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 354 transitions, 5752 flow [2023-11-29 04:55:55,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 354 transitions, 4672 flow, removed 494 selfloop flow, removed 20 redundant places. [2023-11-29 04:55:55,351 INFO L231 Difference]: Finished difference. Result has 144 places, 0 transitions, 0 flow [2023-11-29 04:55:55,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=0, PETRI_PLACES=144, PETRI_TRANSITIONS=0} [2023-11-29 04:55:55,352 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 81 predicate places. [2023-11-29 04:55:55,352 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 0 transitions, 0 flow [2023-11-29 04:55:55,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.916666666666664) internal successors, (467), 12 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 04:55:55,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2023-11-29 04:55:55,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2023-11-29 04:55:55,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2023-11-29 04:55:55,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2023-11-29 04:55:55,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2023-11-29 04:55:55,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2023-11-29 04:55:55,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2023-11-29 04:55:55,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2023-11-29 04:55:55,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2023-11-29 04:55:55,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2023-11-29 04:55:55,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2023-11-29 04:55:55,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2023-11-29 04:55:55,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (4 of 17 remaining) [2023-11-29 04:55:55,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (3 of 17 remaining) [2023-11-29 04:55:55,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 17 remaining) [2023-11-29 04:55:55,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 17 remaining) [2023-11-29 04:55:55,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 17 remaining) [2023-11-29 04:55:55,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 04:55:55,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:55,565 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:55,569 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:55:55,569 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:55:55,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:55:55 BasicIcfg [2023-11-29 04:55:55,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:55:55,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:55:55,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:55:55,575 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:55:55,576 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:55:32" (3/4) ... [2023-11-29 04:55:55,577 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:55:55,580 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-29 04:55:55,580 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-29 04:55:55,580 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-29 04:55:55,586 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2023-11-29 04:55:55,587 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 04:55:55,587 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 04:55:55,588 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:55:55,676 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:55:55,677 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:55:55,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:55:55,678 INFO L158 Benchmark]: Toolchain (without parser) took 23796.46ms. Allocated memory was 157.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 125.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 683.6MB. Max. memory is 16.1GB. [2023-11-29 04:55:55,678 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:55:55,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.66ms. Allocated memory is still 157.3MB. Free memory was 125.1MB in the beginning and 113.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:55:55,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.66ms. Allocated memory is still 157.3MB. Free memory was 113.9MB in the beginning and 112.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:55:55,680 INFO L158 Benchmark]: Boogie Preprocessor took 53.14ms. Allocated memory is still 157.3MB. Free memory was 112.4MB in the beginning and 109.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:55:55,680 INFO L158 Benchmark]: RCFGBuilder took 596.28ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 78.8MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-29 04:55:55,681 INFO L158 Benchmark]: TraceAbstraction took 22687.56ms. Allocated memory was 157.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 78.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 765.3MB. Max. memory is 16.1GB. [2023-11-29 04:55:55,681 INFO L158 Benchmark]: Witness Printer took 102.11ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:55:55,683 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.66ms. Allocated memory is still 157.3MB. Free memory was 125.1MB in the beginning and 113.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.66ms. Allocated memory is still 157.3MB. Free memory was 113.9MB in the beginning and 112.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.14ms. Allocated memory is still 157.3MB. Free memory was 112.4MB in the beginning and 109.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 596.28ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 78.8MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22687.56ms. Allocated memory was 157.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 78.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 765.3MB. Max. memory is 16.1GB. * Witness Printer took 102.11ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 97]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 83 locations, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.6s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1336 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1119 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3455 IncrementalHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 69 mSDtfsCounter, 3455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 391 SyntacticMatches, 18 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2202occurred in iteration=18, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 762 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 2682 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 102/178 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 04:55:55,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2421d809-3ae1-48b8-9e74-cd802048455d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE