./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/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_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/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_8b130fcf-53f7-4910-8bec-9dac0924715b/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 bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:41:35,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:41:35,913 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:41:35,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:41:35,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:41:35,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:41:35,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:41:35,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:41:35,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:41:35,940 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:41:35,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:41:35,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:41:35,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:41:35,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:41:35,943 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:41:35,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:41:35,944 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:41:35,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:41:35,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:41:35,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:41:35,946 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:41:35,946 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:41:35,947 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:41:35,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:41:35,948 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:41:35,948 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:41:35,949 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:41:35,949 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:41:35,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:41:35,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:41:35,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:41:35,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:41:35,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:35,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:41:35,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:41:35,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:41:35,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:41:35,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:41:35,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:41:35,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:41:35,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:41:35,953 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_8b130fcf-53f7-4910-8bec-9dac0924715b/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_8b130fcf-53f7-4910-8bec-9dac0924715b/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 -> bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa [2023-11-29 06:41:36,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:41:36,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:41:36,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:41:36,220 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:41:36,220 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:41:36,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2023-11-29 06:41:38,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:41:39,183 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:41:39,183 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2023-11-29 06:41:39,203 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/data/a0331011a/bc67296a2b444a5ca6a591f7311c5766/FLAG84b0f568c [2023-11-29 06:41:39,219 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/data/a0331011a/bc67296a2b444a5ca6a591f7311c5766 [2023-11-29 06:41:39,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:41:39,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:41:39,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:39,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:41:39,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:41:39,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:39,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d3542c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39, skipping insertion in model container [2023-11-29 06:41:39,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:39,301 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:41:39,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:39,785 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:41:39,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:39,916 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:41:39,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39 WrapperNode [2023-11-29 06:41:39,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:39,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:39,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:41:39,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:41:39,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:39,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:39,976 INFO L138 Inliner]: procedures = 372, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2023-11-29 06:41:39,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:39,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:41:39,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:41:39,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:41:39,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:39,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:39,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:40,017 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [5, 5, 14, 1]. 56 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0, 0, 0]. The 13 writes are split as follows [0, 2, 10, 1]. [2023-11-29 06:41:40,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:40,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:40,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:40,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:40,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:40,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:40,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:41:40,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:41:40,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:41:40,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:41:40,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (1/1) ... [2023-11-29 06:41:40,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:40,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:40,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:41:40,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:41:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:41:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:41:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:41:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:41:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 06:41:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:41:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 06:41:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:41:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:41:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:41:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 06:41:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:41:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:41:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:41:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:41:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 06:41:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:41:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:41:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:41:40,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:41:40,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:41:40,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 06:41:40,126 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-29 06:41:40,126 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-29 06:41:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:41:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:41:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:41:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:41:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:41:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:41:40,129 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 06:41:40,294 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:41:40,296 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:41:40,666 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:41:40,860 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:41:40,860 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:41:40,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:40 BoogieIcfgContainer [2023-11-29 06:41:40,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:41:40,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:41:40,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:41:40,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:41:40,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:41:39" (1/3) ... [2023-11-29 06:41:40,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:40, skipping insertion in model container [2023-11-29 06:41:40,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:39" (2/3) ... [2023-11-29 06:41:40,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:40, skipping insertion in model container [2023-11-29 06:41:40,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:40" (3/3) ... [2023-11-29 06:41:40,870 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2023-11-29 06:41:40,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:41:40,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-29 06:41:40,891 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:41:40,950 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:41:40,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 74 transitions, 152 flow [2023-11-29 06:41:41,024 INFO L124 PetriNetUnfolderBase]: 1/73 cut-off events. [2023-11-29 06:41:41,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:41:41,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 73 events. 1/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 286 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-11-29 06:41:41,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 74 transitions, 152 flow [2023-11-29 06:41:41,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 73 transitions, 149 flow [2023-11-29 06:41:41,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:41:41,048 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;@56bc8423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:41:41,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-29 06:41:41,052 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:41:41,052 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-11-29 06:41:41,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:41:41,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:41,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-29 06:41:41,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:41,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash 398674, now seen corresponding path program 1 times [2023-11-29 06:41:41,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:41,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738247972] [2023-11-29 06:41:41,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:41,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:41,316 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 06:41:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:41,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738247972] [2023-11-29 06:41:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738247972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:41,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:41,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:41,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201830949] [2023-11-29 06:41:41,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:41,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:41,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:41,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:41,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2023-11-29 06:41:41,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 149 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 06:41:41,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:41,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2023-11-29 06:41:41,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:41,586 INFO L124 PetriNetUnfolderBase]: 64/265 cut-off events. [2023-11-29 06:41:41,587 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 06:41:41,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 265 events. 64/265 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1336 event pairs, 63 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 377. Up to 151 conditions per place. [2023-11-29 06:41:41,592 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 24 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-11-29 06:41:41,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 197 flow [2023-11-29 06:41:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2023-11-29 06:41:41,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2023-11-29 06:41:41,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 158 transitions. [2023-11-29 06:41:41,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 158 transitions. [2023-11-29 06:41:41,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:41,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 158 transitions. [2023-11-29 06:41:41,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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 06:41:41,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 06:41:41,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 06:41:41,617 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 149 flow. Second operand 3 states and 158 transitions. [2023-11-29 06:41:41,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 197 flow [2023-11-29 06:41:41,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 69 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 06:41:41,623 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 148 flow [2023-11-29 06:41:41,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-11-29 06:41:41,628 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -3 predicate places. [2023-11-29 06:41:41,628 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 148 flow [2023-11-29 06:41:41,628 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 06:41:41,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:41,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-29 06:41:41,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:41:41,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:41,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:41,629 INFO L85 PathProgramCache]: Analyzing trace with hash 398675, now seen corresponding path program 1 times [2023-11-29 06:41:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915849913] [2023-11-29 06:41:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:41,747 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 06:41:41,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915849913] [2023-11-29 06:41:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915849913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:41,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520185139] [2023-11-29 06:41:41,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:41,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:41,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:41,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:41,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:41,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2023-11-29 06:41:41,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:41,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:41,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2023-11-29 06:41:41,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:41,926 INFO L124 PetriNetUnfolderBase]: 64/261 cut-off events. [2023-11-29 06:41:41,926 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 06:41:41,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 261 events. 64/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1325 event pairs, 63 based on Foata normal form. 4/208 useless extension candidates. Maximal degree in co-relation 388. Up to 151 conditions per place. [2023-11-29 06:41:41,929 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 22 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2023-11-29 06:41:41,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 65 transitions, 192 flow [2023-11-29 06:41:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2023-11-29 06:41:41,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7297297297297297 [2023-11-29 06:41:41,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 162 transitions. [2023-11-29 06:41:41,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 162 transitions. [2023-11-29 06:41:41,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:41,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 162 transitions. [2023-11-29 06:41:41,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:41,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 06:41:41,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 06:41:41,937 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 148 flow. Second operand 3 states and 162 transitions. [2023-11-29 06:41:41,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 65 transitions, 192 flow [2023-11-29 06:41:41,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 65 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:41,939 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 140 flow [2023-11-29 06:41:41,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2023-11-29 06:41:41,940 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -7 predicate places. [2023-11-29 06:41:41,941 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 140 flow [2023-11-29 06:41:41,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:41,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:41,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-29 06:41:41,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:41:41,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:41,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash 398640, now seen corresponding path program 1 times [2023-11-29 06:41:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:41,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681375456] [2023-11-29 06:41:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:41,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:41,981 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 06:41:41,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:41,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681375456] [2023-11-29 06:41:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681375456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:41,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:41,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408256911] [2023-11-29 06:41:41,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:41,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:41,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:41,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:41,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 74 [2023-11-29 06:41:41,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 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 06:41:41,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:41,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 74 [2023-11-29 06:41:41,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:42,089 INFO L124 PetriNetUnfolderBase]: 64/281 cut-off events. [2023-11-29 06:41:42,089 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 06:41:42,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 281 events. 64/281 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1345 event pairs, 63 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 401. Up to 153 conditions per place. [2023-11-29 06:41:42,092 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 31 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-29 06:41:42,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 228 flow [2023-11-29 06:41:42,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2023-11-29 06:41:42,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8018018018018018 [2023-11-29 06:41:42,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 178 transitions. [2023-11-29 06:41:42,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 178 transitions. [2023-11-29 06:41:42,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:42,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 178 transitions. [2023-11-29 06:41:42,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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 06:41:42,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 06:41:42,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 06:41:42,098 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 140 flow. Second operand 3 states and 178 transitions. [2023-11-29 06:41:42,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 72 transitions, 228 flow [2023-11-29 06:41:42,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 72 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:42,101 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 144 flow [2023-11-29 06:41:42,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2023-11-29 06:41:42,102 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -6 predicate places. [2023-11-29 06:41:42,102 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 144 flow [2023-11-29 06:41:42,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 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 06:41:42,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:42,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:42,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:41:42,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:42,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash 383136850, now seen corresponding path program 1 times [2023-11-29 06:41:42,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:42,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477753781] [2023-11-29 06:41:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:42,297 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 06:41:42,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:42,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477753781] [2023-11-29 06:41:42,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477753781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:42,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473233488] [2023-11-29 06:41:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:42,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:42,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:42,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2023-11-29 06:41:42,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 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 06:41:42,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:42,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2023-11-29 06:41:42,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:42,531 INFO L124 PetriNetUnfolderBase]: 74/302 cut-off events. [2023-11-29 06:41:42,531 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 06:41:42,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 302 events. 74/302 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1441 event pairs, 55 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 462. Up to 144 conditions per place. [2023-11-29 06:41:42,534 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 38 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-29 06:41:42,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 236 flow [2023-11-29 06:41:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2023-11-29 06:41:42,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7477477477477478 [2023-11-29 06:41:42,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 166 transitions. [2023-11-29 06:41:42,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 166 transitions. [2023-11-29 06:41:42,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:42,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 166 transitions. [2023-11-29 06:41:42,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:42,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 06:41:42,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 06:41:42,541 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 144 flow. Second operand 3 states and 166 transitions. [2023-11-29 06:41:42,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 236 flow [2023-11-29 06:41:42,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 06:41:42,544 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 144 flow [2023-11-29 06:41:42,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-11-29 06:41:42,545 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -7 predicate places. [2023-11-29 06:41:42,545 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 144 flow [2023-11-29 06:41:42,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 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 06:41:42,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:42,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:41:42,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:42,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 383136851, now seen corresponding path program 1 times [2023-11-29 06:41:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:42,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116386899] [2023-11-29 06:41:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:42,767 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 06:41:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116386899] [2023-11-29 06:41:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116386899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:42,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:41:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181745004] [2023-11-29 06:41:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:42,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:41:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:42,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:41:42,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:42,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 74 [2023-11-29 06:41:42,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 06:41:42,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:42,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 74 [2023-11-29 06:41:42,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:43,043 INFO L124 PetriNetUnfolderBase]: 64/269 cut-off events. [2023-11-29 06:41:43,044 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 06:41:43,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 269 events. 64/269 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1282 event pairs, 63 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 399. Up to 155 conditions per place. [2023-11-29 06:41:43,046 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 29 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2023-11-29 06:41:43,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-29 06:41:43,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:41:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2023-11-29 06:41:43,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7216216216216216 [2023-11-29 06:41:43,048 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 267 transitions. [2023-11-29 06:41:43,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 267 transitions. [2023-11-29 06:41:43,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:43,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 267 transitions. [2023-11-29 06:41:43,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:43,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 06:41:43,053 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 06:41:43,053 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 144 flow. Second operand 5 states and 267 transitions. [2023-11-29 06:41:43,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-29 06:41:43,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:43,056 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 182 flow [2023-11-29 06:41:43,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2023-11-29 06:41:43,057 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -2 predicate places. [2023-11-29 06:41:43,057 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 182 flow [2023-11-29 06:41:43,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 06:41:43,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:43,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:43,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:41:43,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:43,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1645714685, now seen corresponding path program 1 times [2023-11-29 06:41:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:43,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683100655] [2023-11-29 06:41:43,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:43,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:43,271 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 06:41:43,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:43,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683100655] [2023-11-29 06:41:43,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683100655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492892432] [2023-11-29 06:41:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:43,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:43,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:43,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 74 [2023-11-29 06:41:43,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 40.285714285714285) internal successors, (282), 7 states have internal predecessors, (282), 0 states have call successors, (0), 0 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 06:41:43,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:43,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 74 [2023-11-29 06:41:43,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:43,726 INFO L124 PetriNetUnfolderBase]: 64/265 cut-off events. [2023-11-29 06:41:43,726 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 06:41:43,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 265 events. 64/265 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1248 event pairs, 63 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 425. Up to 148 conditions per place. [2023-11-29 06:41:43,729 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 23 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2023-11-29 06:41:43,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 246 flow [2023-11-29 06:41:43,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:41:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:41:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 304 transitions. [2023-11-29 06:41:43,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5868725868725869 [2023-11-29 06:41:43,731 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 304 transitions. [2023-11-29 06:41:43,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 304 transitions. [2023-11-29 06:41:43,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:43,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 304 transitions. [2023-11-29 06:41:43,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 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 06:41:43,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 06:41:43,735 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 06:41:43,735 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 182 flow. Second operand 7 states and 304 transitions. [2023-11-29 06:41:43,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 246 flow [2023-11-29 06:41:43,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 65 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:43,738 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 196 flow [2023-11-29 06:41:43,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2023-11-29 06:41:43,739 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 0 predicate places. [2023-11-29 06:41:43,739 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 196 flow [2023-11-29 06:41:43,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.285714285714285) internal successors, (282), 7 states have internal predecessors, (282), 0 states have call successors, (0), 0 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 06:41:43,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:43,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:43,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:41:43,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:43,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1645714684, now seen corresponding path program 1 times [2023-11-29 06:41:43,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:43,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404071522] [2023-11-29 06:41:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:43,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:44,115 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 06:41:44,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404071522] [2023-11-29 06:41:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404071522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:44,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268542907] [2023-11-29 06:41:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:44,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:44,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:44,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2023-11-29 06:41:44,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:44,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:44,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2023-11-29 06:41:44,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:44,746 INFO L124 PetriNetUnfolderBase]: 64/261 cut-off events. [2023-11-29 06:41:44,747 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 06:41:44,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 261 events. 64/261 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1223 event pairs, 63 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 424. Up to 148 conditions per place. [2023-11-29 06:41:44,749 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 22 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2023-11-29 06:41:44,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 63 transitions, 258 flow [2023-11-29 06:41:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:41:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:41:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 282 transitions. [2023-11-29 06:41:44,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444015444015444 [2023-11-29 06:41:44,755 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 282 transitions. [2023-11-29 06:41:44,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 282 transitions. [2023-11-29 06:41:44,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:44,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 282 transitions. [2023-11-29 06:41:44,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 40.285714285714285) internal successors, (282), 7 states have internal predecessors, (282), 0 states have call successors, (0), 0 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 06:41:44,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 06:41:44,758 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 06:41:44,758 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 196 flow. Second operand 7 states and 282 transitions. [2023-11-29 06:41:44,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 63 transitions, 258 flow [2023-11-29 06:41:44,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 06:41:44,761 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 192 flow [2023-11-29 06:41:44,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2023-11-29 06:41:44,762 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -2 predicate places. [2023-11-29 06:41:44,762 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 192 flow [2023-11-29 06:41:44,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:44,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:44,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:44,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:41:44,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:44,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -983832572, now seen corresponding path program 1 times [2023-11-29 06:41:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587297792] [2023-11-29 06:41:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:44,918 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 06:41:44,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587297792] [2023-11-29 06:41:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587297792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:44,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665768496] [2023-11-29 06:41:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:44,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:41:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:41:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:45,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2023-11-29 06:41:45,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 06:41:45,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:45,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2023-11-29 06:41:45,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:45,186 INFO L124 PetriNetUnfolderBase]: 64/259 cut-off events. [2023-11-29 06:41:45,186 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-11-29 06:41:45,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 259 events. 64/259 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1201 event pairs, 63 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 421. Up to 150 conditions per place. [2023-11-29 06:41:45,188 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 20 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2023-11-29 06:41:45,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 252 flow [2023-11-29 06:41:45,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:41:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-11-29 06:41:45,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654054054054054 [2023-11-29 06:41:45,190 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 242 transitions. [2023-11-29 06:41:45,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 242 transitions. [2023-11-29 06:41:45,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:45,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 242 transitions. [2023-11-29 06:41:45,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:45,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 06:41:45,193 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 06:41:45,193 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 192 flow. Second operand 5 states and 242 transitions. [2023-11-29 06:41:45,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 252 flow [2023-11-29 06:41:45,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 230 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 06:41:45,195 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 190 flow [2023-11-29 06:41:45,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 06:41:45,196 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -5 predicate places. [2023-11-29 06:41:45,196 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 190 flow [2023-11-29 06:41:45,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 06:41:45,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:45,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:45,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:41:45,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:45,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:45,198 INFO L85 PathProgramCache]: Analyzing trace with hash -983832573, now seen corresponding path program 1 times [2023-11-29 06:41:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:45,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28668128] [2023-11-29 06:41:45,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:45,272 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 06:41:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28668128] [2023-11-29 06:41:45,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28668128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:45,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:45,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564598437] [2023-11-29 06:41:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:45,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:41:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:45,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:41:45,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:45,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2023-11-29 06:41:45,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 06:41:45,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:45,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2023-11-29 06:41:45,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:45,532 INFO L124 PetriNetUnfolderBase]: 64/257 cut-off events. [2023-11-29 06:41:45,532 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 06:41:45,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 257 events. 64/257 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1193 event pairs, 63 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 422. Up to 150 conditions per place. [2023-11-29 06:41:45,534 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 22 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2023-11-29 06:41:45,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 254 flow [2023-11-29 06:41:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:41:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2023-11-29 06:41:45,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6324324324324324 [2023-11-29 06:41:45,536 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 234 transitions. [2023-11-29 06:41:45,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 234 transitions. [2023-11-29 06:41:45,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:45,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 234 transitions. [2023-11-29 06:41:45,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 06:41:45,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 06:41:45,538 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 06:41:45,538 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 190 flow. Second operand 5 states and 234 transitions. [2023-11-29 06:41:45,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 254 flow [2023-11-29 06:41:45,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 06:41:45,541 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 188 flow [2023-11-29 06:41:45,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 06:41:45,542 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -6 predicate places. [2023-11-29 06:41:45,542 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 188 flow [2023-11-29 06:41:45,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 06:41:45,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:45,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:45,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:41:45,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:45,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash -570284254, now seen corresponding path program 1 times [2023-11-29 06:41:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573882199] [2023-11-29 06:41:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:45,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:45,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573882199] [2023-11-29 06:41:45,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573882199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:45,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231746373] [2023-11-29 06:41:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:45,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:45,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:41:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:45,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:41:45,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:45,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:45,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231746373] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:45,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:45,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-29 06:41:45,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780392843] [2023-11-29 06:41:45,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:45,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:45,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:45,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:45,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 74 [2023-11-29 06:41:45,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 0 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 06:41:45,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:45,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 74 [2023-11-29 06:41:45,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:45,979 INFO L124 PetriNetUnfolderBase]: 64/282 cut-off events. [2023-11-29 06:41:45,979 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-29 06:41:45,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 282 events. 64/282 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1142 event pairs, 63 based on Foata normal form. 3/241 useless extension candidates. Maximal degree in co-relation 420. Up to 146 conditions per place. [2023-11-29 06:41:45,981 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 42 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-11-29 06:41:45,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 78 transitions, 368 flow [2023-11-29 06:41:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:41:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 339 transitions. [2023-11-29 06:41:45,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7635135135135135 [2023-11-29 06:41:45,983 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 339 transitions. [2023-11-29 06:41:45,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 339 transitions. [2023-11-29 06:41:45,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:45,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 339 transitions. [2023-11-29 06:41:45,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 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 06:41:45,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 06:41:45,986 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 06:41:45,986 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 188 flow. Second operand 6 states and 339 transitions. [2023-11-29 06:41:45,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 78 transitions, 368 flow [2023-11-29 06:41:45,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 318 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 06:41:45,989 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 208 flow [2023-11-29 06:41:45,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2023-11-29 06:41:45,990 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2023-11-29 06:41:45,991 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 208 flow [2023-11-29 06:41:45,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 0 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 06:41:45,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:45,991 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:45,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:41:46,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 06:41:46,196 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:46,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1712689605, now seen corresponding path program 1 times [2023-11-29 06:41:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024355109] [2023-11-29 06:41:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:47,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024355109] [2023-11-29 06:41:47,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024355109] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545020795] [2023-11-29 06:41:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:47,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:47,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:47,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:41:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:47,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 06:41:47,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:47,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:47,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:47,311 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 06:41:47,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 06:41:47,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:47,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:47,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:47,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:47,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:47,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:47,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:47,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:47,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-29 06:41:47,948 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 06:41:47,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 06:41:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:48,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545020795] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:48,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:48,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 17 [2023-11-29 06:41:48,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84064170] [2023-11-29 06:41:48,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:48,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 06:41:48,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 06:41:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:41:50,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2023-11-29 06:41:50,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 208 flow. Second operand has 19 states, 19 states have (on average 37.21052631578947) internal successors, (707), 19 states have internal predecessors, (707), 0 states have call successors, (0), 0 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 06:41:50,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:50,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2023-11-29 06:41:50,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:50,604 INFO L124 PetriNetUnfolderBase]: 74/309 cut-off events. [2023-11-29 06:41:50,604 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 06:41:50,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 309 events. 74/309 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1312 event pairs, 73 based on Foata normal form. 3/264 useless extension candidates. Maximal degree in co-relation 472. Up to 172 conditions per place. [2023-11-29 06:41:50,606 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 52 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2023-11-29 06:41:50,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 398 flow [2023-11-29 06:41:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:41:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:41:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 313 transitions. [2023-11-29 06:41:50,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6042471042471043 [2023-11-29 06:41:50,609 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 313 transitions. [2023-11-29 06:41:50,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 313 transitions. [2023-11-29 06:41:50,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:50,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 313 transitions. [2023-11-29 06:41:50,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.714285714285715) internal successors, (313), 7 states have internal predecessors, (313), 0 states have call successors, (0), 0 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 06:41:50,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 06:41:50,612 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 06:41:50,612 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 208 flow. Second operand 7 states and 313 transitions. [2023-11-29 06:41:50,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 398 flow [2023-11-29 06:41:50,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 86 transitions, 388 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 06:41:50,616 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 236 flow [2023-11-29 06:41:50,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2023-11-29 06:41:50,617 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 7 predicate places. [2023-11-29 06:41:50,617 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 236 flow [2023-11-29 06:41:50,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 37.21052631578947) internal successors, (707), 19 states have internal predecessors, (707), 0 states have call successors, (0), 0 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 06:41:50,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:50,618 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2023-11-29 06:41:50,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 06:41:50,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:50,818 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:50,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash -263899656, now seen corresponding path program 2 times [2023-11-29 06:41:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:50,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541323158] [2023-11-29 06:41:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:51,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:51,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541323158] [2023-11-29 06:41:51,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541323158] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:51,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894547711] [2023-11-29 06:41:51,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:41:51,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:51,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:51,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:41:51,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:41:51,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:41:51,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:41:51,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:51,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:51,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894547711] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:51,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:51,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-29 06:41:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467118422] [2023-11-29 06:41:51,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:51,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:41:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:51,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:41:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:41:51,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 74 [2023-11-29 06:41:51,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 236 flow. Second operand has 13 states, 13 states have (on average 53.23076923076923) internal successors, (692), 13 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 06:41:51,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:51,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 74 [2023-11-29 06:41:51,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:51,770 INFO L124 PetriNetUnfolderBase]: 64/342 cut-off events. [2023-11-29 06:41:51,770 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2023-11-29 06:41:51,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 342 events. 64/342 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1136 event pairs, 63 based on Foata normal form. 6/304 useless extension candidates. Maximal degree in co-relation 621. Up to 146 conditions per place. [2023-11-29 06:41:51,773 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 78 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2023-11-29 06:41:51,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 119 transitions, 676 flow [2023-11-29 06:41:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:41:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 06:41:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 672 transitions. [2023-11-29 06:41:51,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7567567567567568 [2023-11-29 06:41:51,776 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 672 transitions. [2023-11-29 06:41:51,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 672 transitions. [2023-11-29 06:41:51,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:51,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 672 transitions. [2023-11-29 06:41:51,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 56.0) internal successors, (672), 12 states have internal predecessors, (672), 0 states have call successors, (0), 0 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 06:41:51,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 74.0) internal successors, (962), 13 states have internal predecessors, (962), 0 states have call successors, (0), 0 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 06:41:51,781 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 74.0) internal successors, (962), 13 states have internal predecessors, (962), 0 states have call successors, (0), 0 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 06:41:51,782 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 236 flow. Second operand 12 states and 672 transitions. [2023-11-29 06:41:51,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 119 transitions, 676 flow [2023-11-29 06:41:51,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 119 transitions, 647 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 06:41:51,787 INFO L231 Difference]: Finished difference. Result has 96 places, 71 transitions, 332 flow [2023-11-29 06:41:51,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=332, PETRI_PLACES=96, PETRI_TRANSITIONS=71} [2023-11-29 06:41:51,787 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 20 predicate places. [2023-11-29 06:41:51,788 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 332 flow [2023-11-29 06:41:51,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 53.23076923076923) internal successors, (692), 13 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 06:41:51,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:51,788 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2023-11-29 06:41:51,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:41:51,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:51,992 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:41:51,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash -204455141, now seen corresponding path program 2 times [2023-11-29 06:41:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798615254] [2023-11-29 06:41:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:54,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:54,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798615254] [2023-11-29 06:41:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798615254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:54,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816877130] [2023-11-29 06:41:54,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:41:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:41:54,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:54,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:41:54,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:41:54,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:41:54,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:41:54,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 06:41:54,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:54,920 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 06:41:54,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 06:41:54,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:54,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:54,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:55,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:55,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:55,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:55,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:55,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:55,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:55,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:41:55,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:41:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:55,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:55,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:55,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-29 06:41:56,054 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 06:41:56,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 06:41:56,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:56,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-29 06:41:56,611 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 06:41:56,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 06:41:57,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:57,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-29 06:41:57,149 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 06:41:57,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 06:41:57,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:57,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-11-29 06:41:57,832 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 06:41:57,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-29 06:41:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816877130] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:58,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:41:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 38 [2023-11-29 06:41:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456912113] [2023-11-29 06:41:58,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:58,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 06:41:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:58,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 06:41:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 06:42:07,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 74 [2023-11-29 06:42:07,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 71 transitions, 332 flow. Second operand has 40 states, 40 states have (on average 39.4) internal successors, (1576), 40 states have internal predecessors, (1576), 0 states have call successors, (0), 0 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 06:42:07,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:07,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 74 [2023-11-29 06:42:07,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:09,833 INFO L124 PetriNetUnfolderBase]: 74/369 cut-off events. [2023-11-29 06:42:09,833 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2023-11-29 06:42:09,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 369 events. 74/369 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1310 event pairs, 73 based on Foata normal form. 6/328 useless extension candidates. Maximal degree in co-relation 702. Up to 171 conditions per place. [2023-11-29 06:42:09,835 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 75 selfloop transitions, 20 changer transitions 0/121 dead transitions. [2023-11-29 06:42:09,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 121 transitions, 733 flow [2023-11-29 06:42:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:42:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 06:42:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 619 transitions. [2023-11-29 06:42:09,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5974903474903475 [2023-11-29 06:42:09,838 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 619 transitions. [2023-11-29 06:42:09,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 619 transitions. [2023-11-29 06:42:09,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:09,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 619 transitions. [2023-11-29 06:42:09,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 44.214285714285715) internal successors, (619), 14 states have internal predecessors, (619), 0 states have call successors, (0), 0 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 06:42:09,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 74.0) internal successors, (1110), 15 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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 06:42:09,842 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 74.0) internal successors, (1110), 15 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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 06:42:09,842 INFO L175 Difference]: Start difference. First operand has 96 places, 71 transitions, 332 flow. Second operand 14 states and 619 transitions. [2023-11-29 06:42:09,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 121 transitions, 733 flow [2023-11-29 06:42:09,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 121 transitions, 727 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:42:09,848 INFO L231 Difference]: Finished difference. Result has 114 places, 76 transitions, 443 flow [2023-11-29 06:42:09,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=443, PETRI_PLACES=114, PETRI_TRANSITIONS=76} [2023-11-29 06:42:09,849 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 38 predicate places. [2023-11-29 06:42:09,849 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 76 transitions, 443 flow [2023-11-29 06:42:09,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 39.4) internal successors, (1576), 40 states have internal predecessors, (1576), 0 states have call successors, (0), 0 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 06:42:09,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:09,850 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2023-11-29 06:42:09,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:42:10,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:10,052 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:42:10,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2119080924, now seen corresponding path program 3 times [2023-11-29 06:42:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:10,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078622536] [2023-11-29 06:42:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2023-11-29 06:42:13,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:13,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078622536] [2023-11-29 06:42:13,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078622536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:13,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532200200] [2023-11-29 06:42:13,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:42:13,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:13,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:13,337 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:13,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:53:09,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-29 06:53:09,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:53:09,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 06:53:09,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:53:09,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:53:09,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:09,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:09,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:09,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:09,818 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:53:09,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 06:53:09,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 06:53:09,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:09,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 06:53:09,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 06:53:09,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:09,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:09,987 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:53:09,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 06:53:10,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,210 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:53:10,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 06:53:10,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 06:53:10,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 06:53:10,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 06:53:10,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:53:10,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:53:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 55 proven. 113 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-11-29 06:53:10,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:53:14,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2186 Int) (v_ArrVal_2185 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1)))) is different from false [2023-11-29 06:53:18,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2186 Int) (v_ArrVal_2185 Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int)) (let ((.cse0 (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1)))) is different from false [2023-11-29 06:53:23,007 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2183 Int) (v_ArrVal_2186 Int) (v_ArrVal_2185 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int)) (let ((.cse0 (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1))))) is different from false [2023-11-29 06:53:27,214 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (v_ArrVal_2182 Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2183 Int) (v_ArrVal_2186 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2185 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int)) (let ((.cse0 (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1))))) is different from false [2023-11-29 06:53:31,353 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (v_ArrVal_2182 Int) (v_ArrVal_2181 Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2183 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2186 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2185 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int)) (let ((.cse0 (store (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1))))) is different from false [2023-11-29 06:53:35,614 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (v_ArrVal_2182 Int) (v_ArrVal_2181 Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2183 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2186 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2185 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int)) (let ((.cse0 (store (store (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1))))) is different from false [2023-11-29 06:53:39,757 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (v_ArrVal_2182 Int) (v_ArrVal_2181 Int) (|v_ULTIMATE.start_new_~p~0#1.base_96| Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2183 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2186 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2185 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (v_ArrVal_2179 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int)) (let ((.cse0 (store (store (store (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_96| v_ArrVal_2179) |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_96| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1)))) is different from false [2023-11-29 06:53:44,168 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (v_ArrVal_2182 Int) (|v_ULTIMATE.start_new_~p~0#1.base_97| Int) (v_ArrVal_2181 Int) (|v_ULTIMATE.start_new_~p~0#1.base_96| Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2183 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2186 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2185 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (v_ArrVal_2179 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (v_ArrVal_2178 Int)) (let ((.cse0 (store (store (store (store (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_97| v_ArrVal_2178) |v_ULTIMATE.start_new_~p~0#1.base_96| v_ArrVal_2179) |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_96| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_97| 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1)))) is different from false [2023-11-29 06:53:48,372 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (|v_ULTIMATE.start_new_~p~0#1.base_98| Int) (v_ArrVal_2182 Int) (|v_ULTIMATE.start_new_~p~0#1.base_97| Int) (v_ArrVal_2181 Int) (|v_ULTIMATE.start_new_~p~0#1.base_96| Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2183 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2186 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2185 Int) (v_ArrVal_2177 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (v_ArrVal_2179 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (v_ArrVal_2178 Int)) (let ((.cse0 (store (store (store (store (store (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_98| v_ArrVal_2177) |v_ULTIMATE.start_new_~p~0#1.base_97| v_ArrVal_2178) |v_ULTIMATE.start_new_~p~0#1.base_96| v_ArrVal_2179) |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_98| 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_96| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_97| 1))))) is different from false [2023-11-29 06:53:52,918 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (|v_ULTIMATE.start_new_~p~0#1.base_99| Int) (|v_ULTIMATE.start_new_~p~0#1.base_98| Int) (v_ArrVal_2182 Int) (|v_ULTIMATE.start_new_~p~0#1.base_97| Int) (v_ArrVal_2181 Int) (|v_ULTIMATE.start_new_~p~0#1.base_96| Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2183 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2186 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2185 Int) (v_ArrVal_2177 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (v_ArrVal_2179 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (v_ArrVal_2178 Int)) (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_99| 1) |v_ULTIMATE.start_new_~p~0#1.base_98| v_ArrVal_2177) |v_ULTIMATE.start_new_~p~0#1.base_97| v_ArrVal_2178) |v_ULTIMATE.start_new_~p~0#1.base_96| v_ArrVal_2179) |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_98| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_96| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_97| 1))))) is different from false [2023-11-29 06:53:57,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_100| Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (|v_ULTIMATE.start_new_~p~0#1.base_96| Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2175 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2177 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (v_ArrVal_2179 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (v_ArrVal_2178 Int) (v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_99| Int) (|v_ULTIMATE.start_new_~p~0#1.base_98| Int) (v_ArrVal_2182 Int) (|v_ULTIMATE.start_new_~p~0#1.base_97| Int) (v_ArrVal_2181 Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2183 Int) (v_ArrVal_2186 Int) (v_ArrVal_2185 Int)) (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_100| v_ArrVal_2175) |v_ULTIMATE.start_new_~p~0#1.base_99| 1) |v_ULTIMATE.start_new_~p~0#1.base_98| v_ArrVal_2177) |v_ULTIMATE.start_new_~p~0#1.base_97| v_ArrVal_2178) |v_ULTIMATE.start_new_~p~0#1.base_96| v_ArrVal_2179) |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_98| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_100| 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_96| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_97| 1))))) is different from false [2023-11-29 06:54:19,041 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_100| Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (|v_ULTIMATE.start_new_~p~0#1.base_96| Int) (v_ArrVal_2172 Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2175 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2174 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2177 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (|v_ULTIMATE.start_new_~p~0#1.base_102| Int) (v_ArrVal_2179 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (|v_ULTIMATE.start_new_~p~0#1.base_101| Int) (v_ArrVal_2178 Int) (v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_99| Int) (|v_ULTIMATE.start_new_~p~0#1.base_98| Int) (v_ArrVal_2182 Int) (|v_ULTIMATE.start_new_~p~0#1.base_97| Int) (v_ArrVal_2181 Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2183 Int) (v_ArrVal_2186 Int) (v_ArrVal_2185 Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_102| v_ArrVal_2172) |v_ULTIMATE.start_new_~p~0#1.base_101| v_ArrVal_2174))) (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_100| v_ArrVal_2175) |v_ULTIMATE.start_new_~p~0#1.base_99| 1) |v_ULTIMATE.start_new_~p~0#1.base_98| v_ArrVal_2177) |v_ULTIMATE.start_new_~p~0#1.base_97| v_ArrVal_2178) |v_ULTIMATE.start_new_~p~0#1.base_96| v_ArrVal_2179) |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_98| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_102|) 1)) (not (= 1 (select .cse1 |v_ULTIMATE.start_new_~p~0#1.base_90|))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_100| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (= (select (store .cse1 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_96| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_101| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_97| 1)))))) is different from false [2023-11-29 06:54:23,965 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_100| Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (v_ArrVal_2171 Int) (|v_ULTIMATE.start_new_~p~0#1.base_96| Int) (v_ArrVal_2172 Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2175 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2174 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (v_ArrVal_2177 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_103| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (|v_ULTIMATE.start_new_~p~0#1.base_102| Int) (v_ArrVal_2179 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (|v_ULTIMATE.start_new_~p~0#1.base_101| Int) (v_ArrVal_2178 Int) (v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_99| Int) (|v_ULTIMATE.start_new_~p~0#1.base_98| Int) (v_ArrVal_2182 Int) (|v_ULTIMATE.start_new_~p~0#1.base_97| Int) (v_ArrVal_2181 Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2183 Int) (v_ArrVal_2186 Int) (v_ArrVal_2185 Int)) (let ((.cse0 (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_103| v_ArrVal_2171) |v_ULTIMATE.start_new_~p~0#1.base_102| v_ArrVal_2172) |v_ULTIMATE.start_new_~p~0#1.base_101| v_ArrVal_2174))) (let ((.cse1 (store (store (store (store (store (store (store (store (store (store (store (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_100| v_ArrVal_2175) |v_ULTIMATE.start_new_~p~0#1.base_99| 1) |v_ULTIMATE.start_new_~p~0#1.base_98| v_ArrVal_2177) |v_ULTIMATE.start_new_~p~0#1.base_97| v_ArrVal_2178) |v_ULTIMATE.start_new_~p~0#1.base_96| v_ArrVal_2179) |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_102|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_98| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_100| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_96| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_101| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_97| 1)) (= (select (store .cse1 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= (select .cse1 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_103| 1)))))) is different from false [2023-11-29 06:54:28,410 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_100| Int) (|v_ULTIMATE.start_new_~p~0#1.base_89| Int) (v_ArrVal_2191 Int) (v_ArrVal_2171 Int) (v_ArrVal_2170 Int) (|v_ULTIMATE.start_new_~p~0#1.base_96| Int) (v_ArrVal_2172 Int) (|v_ULTIMATE.start_new_~p~0#1.base_95| Int) (v_ArrVal_2175 Int) (|v_ULTIMATE.start_new_~p~0#1.base_94| Int) (v_ArrVal_2174 Int) (|v_ULTIMATE.start_new_~p~0#1.base_93| Int) (|v_ULTIMATE.start_new_~p~0#1.base_104| Int) (v_ArrVal_2177 Int) (|v_ULTIMATE.start_new_~p~0#1.base_92| Int) (|v_ULTIMATE.start_new_~p~0#1.base_103| Int) (|v_ULTIMATE.start_new_~p~0#1.base_91| Int) (|v_ULTIMATE.start_new_~p~0#1.base_102| Int) (v_ArrVal_2179 Int) (|v_ULTIMATE.start_new_~p~0#1.base_90| Int) (|v_ULTIMATE.start_new_~p~0#1.base_101| Int) (v_ArrVal_2178 Int) (v_ArrVal_2180 Int) (|v_ULTIMATE.start_new_~p~0#1.base_99| Int) (|v_ULTIMATE.start_new_~p~0#1.base_98| Int) (v_ArrVal_2182 Int) (|v_ULTIMATE.start_new_~p~0#1.base_97| Int) (v_ArrVal_2181 Int) (v_ArrVal_2184 Int) (|v_ULTIMATE.start_new_~p~0#1.base_85| Int) (v_ArrVal_2183 Int) (v_ArrVal_2186 Int) (v_ArrVal_2185 Int)) (let ((.cse1 (store (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_104| v_ArrVal_2170) |v_ULTIMATE.start_new_~p~0#1.base_103| v_ArrVal_2171) |v_ULTIMATE.start_new_~p~0#1.base_102| v_ArrVal_2172) |v_ULTIMATE.start_new_~p~0#1.base_101| v_ArrVal_2174))) (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store .cse1 |v_ULTIMATE.start_new_~p~0#1.base_100| v_ArrVal_2175) |v_ULTIMATE.start_new_~p~0#1.base_99| 1) |v_ULTIMATE.start_new_~p~0#1.base_98| v_ArrVal_2177) |v_ULTIMATE.start_new_~p~0#1.base_97| v_ArrVal_2178) |v_ULTIMATE.start_new_~p~0#1.base_96| v_ArrVal_2179) |v_ULTIMATE.start_new_~p~0#1.base_95| v_ArrVal_2180) |v_ULTIMATE.start_new_~p~0#1.base_94| v_ArrVal_2181) |v_ULTIMATE.start_new_~p~0#1.base_93| v_ArrVal_2182) |v_ULTIMATE.start_new_~p~0#1.base_92| v_ArrVal_2183) |v_ULTIMATE.start_new_~p~0#1.base_91| v_ArrVal_2184) |v_ULTIMATE.start_new_~p~0#1.base_90| v_ArrVal_2185) |v_ULTIMATE.start_new_~p~0#1.base_89| v_ArrVal_2186))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_104| 1)) (not (= (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_90|) 1)) (not (= (select .cse1 |v_ULTIMATE.start_new_~p~0#1.base_102|) 1)) (= (select (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_85| v_ArrVal_2191) |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_89| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_92| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_98| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_91| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_100| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_95| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_96| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_94| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_101| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_93| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_85| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_97| 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_103| 1)))))) is different from false [2023-11-29 06:54:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 409 not checked. [2023-11-29 06:54:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532200200] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:54:28,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:54:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 24] total 37 [2023-11-29 06:54:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521810705] [2023-11-29 06:54:28,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:54:28,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 06:54:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 06:54:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=471, Unknown=18, NotChecked=826, Total=1482 [2023-11-29 06:54:31,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 06:54:31,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 74 [2023-11-29 06:54:31,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 76 transitions, 443 flow. Second operand has 39 states, 39 states have (on average 13.461538461538462) internal successors, (525), 39 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 06:54:31,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:54:31,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 74 [2023-11-29 06:54:31,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:54:32,030 INFO L124 PetriNetUnfolderBase]: 207/602 cut-off events. [2023-11-29 06:54:32,030 INFO L125 PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES. [2023-11-29 06:54:32,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 602 events. 207/602 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2500 event pairs, 155 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 1303. Up to 399 conditions per place. [2023-11-29 06:54:32,035 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 66 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2023-11-29 06:54:32,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 92 transitions, 643 flow [2023-11-29 06:54:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:54:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:54:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2023-11-29 06:54:32,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2023-11-29 06:54:32,036 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 104 transitions. [2023-11-29 06:54:32,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 104 transitions. [2023-11-29 06:54:32,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:54:32,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 104 transitions. [2023-11-29 06:54:32,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 06:54:32,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 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 06:54:32,038 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 0 states have call successors, (0), 0 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 06:54:32,038 INFO L175 Difference]: Start difference. First operand has 114 places, 76 transitions, 443 flow. Second operand 4 states and 104 transitions. [2023-11-29 06:54:32,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 92 transitions, 643 flow [2023-11-29 06:54:32,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 92 transitions, 606 flow, removed 4 selfloop flow, removed 11 redundant places. [2023-11-29 06:54:32,044 INFO L231 Difference]: Finished difference. Result has 105 places, 75 transitions, 440 flow [2023-11-29 06:54:32,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=105, PETRI_TRANSITIONS=75} [2023-11-29 06:54:32,045 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 29 predicate places. [2023-11-29 06:54:32,045 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 75 transitions, 440 flow [2023-11-29 06:54:32,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 13.461538461538462) internal successors, (525), 39 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 06:54:32,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:54:32,045 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2023-11-29 06:54:32,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:54:32,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 06:54:32,246 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:54:32,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2119080923, now seen corresponding path program 1 times [2023-11-29 06:54:32,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:32,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093762259] [2023-11-29 06:54:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 40 proven. 251 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2023-11-29 06:54:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093762259] [2023-11-29 06:54:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093762259] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:54:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172717044] [2023-11-29 06:54:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:37,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:54:37,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:54:37,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:54:37,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:54:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:38,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 06:54:38,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:54:38,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:54:38,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:54:38,751 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 06:54:38,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 06:54:38,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:38,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:38,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:38,847 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 06:54:38,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 06:54:38,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:38,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:38,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:38,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:38,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:38,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:54:39,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:54:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-11-29 06:54:39,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:54:43,760 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_107| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_107| 1)) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_106| Int) (v_ArrVal_3141 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_106| 1)) (forall ((v_ArrVal_3142 Int)) (<= (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_107| v_ArrVal_3141) |v_ULTIMATE.start_new_~p~0#1.base_106| v_ArrVal_3142) |c_ULTIMATE.start_main_~#t1~0#1.base|)))))))) is different from false [2023-11-29 06:55:00,430 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_110| Int)) (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_106| Int) (v_ArrVal_3138 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_106| 1)) (forall ((v_ArrVal_3142 Int)) (<= (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_3138) |v_ULTIMATE.start_new_~p~0#1.base_106| v_ArrVal_3142) |c_ULTIMATE.start_main_~#t1~0#1.base|))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_110| 1))))) is different from false [2023-11-29 06:55:13,562 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_116| Int)) (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_106| Int) (v_ArrVal_3132 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_106| 1)) (forall ((v_ArrVal_3142 Int)) (<= (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_116| v_ArrVal_3132) |v_ULTIMATE.start_new_~p~0#1.base_106| v_ArrVal_3142) |c_ULTIMATE.start_main_~#t1~0#1.base|))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_116| 1))))) is different from false [2023-11-29 06:55:17,624 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_117| Int)) (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_116| Int) (v_ArrVal_3131 Int)) (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_106| Int) (v_ArrVal_3132 Int)) (or (forall ((v_ArrVal_3142 Int)) (<= (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 4) (select (store (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_117| v_ArrVal_3131) |v_ULTIMATE.start_new_~p~0#1.base_116| v_ArrVal_3132) |v_ULTIMATE.start_new_~p~0#1.base_106| v_ArrVal_3142) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_106| 1)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_116| 1)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_117| 1))))) is different from false [2023-11-29 06:55:30,586 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_121| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_121| 1)) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_106| Int) (v_ArrVal_3127 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_new_~p~0#1.base_106| 1)) (forall ((v_ArrVal_3142 Int)) (<= (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_121| v_ArrVal_3127) |v_ULTIMATE.start_new_~p~0#1.base_106| v_ArrVal_3142) |c_ULTIMATE.start_main_~#t1~0#1.base|)))))))) is different from false [2023-11-29 06:55:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 168 trivial. 222 not checked. [2023-11-29 06:55:43,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172717044] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:55:43,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:55:43,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4, 9] total 31 [2023-11-29 06:55:43,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798779406] [2023-11-29 06:55:43,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:55:43,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 06:55:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 06:55:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=493, Unknown=6, NotChecked=280, Total=1056 [2023-11-29 06:55:43,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 74 [2023-11-29 06:55:43,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 75 transitions, 440 flow. Second operand has 33 states, 33 states have (on average 5.96969696969697) internal successors, (197), 33 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 06:55:43,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:55:43,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 74 [2023-11-29 06:55:43,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:55:44,316 INFO L124 PetriNetUnfolderBase]: 311/769 cut-off events. [2023-11-29 06:55:44,316 INFO L125 PetriNetUnfolderBase]: For 347/347 co-relation queries the response was YES. [2023-11-29 06:55:44,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 769 events. 311/769 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3350 event pairs, 244 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 1735. Up to 521 conditions per place. [2023-11-29 06:55:44,321 INFO L140 encePairwiseOnDemand]: 64/74 looper letters, 65 selfloop transitions, 30 changer transitions 0/96 dead transitions. [2023-11-29 06:55:44,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 96 transitions, 672 flow [2023-11-29 06:55:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:55:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:55:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2023-11-29 06:55:44,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.14114114114114115 [2023-11-29 06:55:44,323 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 94 transitions. [2023-11-29 06:55:44,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 94 transitions. [2023-11-29 06:55:44,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:55:44,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 94 transitions. [2023-11-29 06:55:44,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 06:55:44,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 74.0) internal successors, (740), 10 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:55:44,326 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 74.0) internal successors, (740), 10 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:55:44,326 INFO L175 Difference]: Start difference. First operand has 105 places, 75 transitions, 440 flow. Second operand 9 states and 94 transitions. [2023-11-29 06:55:44,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 96 transitions, 672 flow [2023-11-29 06:55:44,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 96 transitions, 636 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:55:44,334 INFO L231 Difference]: Finished difference. Result has 109 places, 74 transitions, 462 flow [2023-11-29 06:55:44,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=462, PETRI_PLACES=109, PETRI_TRANSITIONS=74} [2023-11-29 06:55:44,335 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 33 predicate places. [2023-11-29 06:55:44,335 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 74 transitions, 462 flow [2023-11-29 06:55:44,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.96969696969697) internal successors, (197), 33 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 06:55:44,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:55:44,335 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2023-11-29 06:55:44,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 06:55:44,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:44,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-29 06:55:44,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -622225849, now seen corresponding path program 3 times [2023-11-29 06:55:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663196437] [2023-11-29 06:55:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:55:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663196437] [2023-11-29 06:55:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663196437] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:55:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544523771] [2023-11-29 06:55:45,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:55:45,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:45,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:55:45,181 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:55:45,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b130fcf-53f7-4910-8bec-9dac0924715b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process