./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/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_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/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_39577ea9-6349-4f26-bd6a-716fef928c38/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 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:18:08,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:18:09,045 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:18:09,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:18:09,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:18:09,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:18:09,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:18:09,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:18:09,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:18:09,077 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:18:09,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:18:09,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:18:09,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:18:09,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:18:09,080 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:18:09,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:18:09,081 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:18:09,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:18:09,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:18:09,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:18:09,083 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:18:09,084 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:18:09,084 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:18:09,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:18:09,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:18:09,086 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:18:09,086 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:18:09,086 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:18:09,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:18:09,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:18:09,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:18:09,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:18:09,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:18:09,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:18:09,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:18:09,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:18:09,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:18:09,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:18:09,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:18:09,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:18:09,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:18:09,090 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_39577ea9-6349-4f26-bd6a-716fef928c38/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_39577ea9-6349-4f26-bd6a-716fef928c38/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 -> 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c [2023-11-29 05:18:09,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:18:09,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:18:09,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:18:09,344 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:18:09,344 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:18:09,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2023-11-29 05:18:12,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:18:12,554 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:18:12,555 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2023-11-29 05:18:12,570 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/data/29d213bfb/2a418c4eb0e74f65a34e6a2d26ad8f16/FLAG023dd835e [2023-11-29 05:18:12,586 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/data/29d213bfb/2a418c4eb0e74f65a34e6a2d26ad8f16 [2023-11-29 05:18:12,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:18:12,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:18:12,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:18:12,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:18:12,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:18:12,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:12,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572c3055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12, skipping insertion in model container [2023-11-29 05:18:12,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:12,648 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:18:12,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:18:12,927 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:18:12,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:18:12,999 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:18:12,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12 WrapperNode [2023-11-29 05:18:12,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:18:13,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:18:13,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:18:13,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:18:13,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,042 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 144 [2023-11-29 05:18:13,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:18:13,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:18:13,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:18:13,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:18:13,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,081 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 8, 17]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2023-11-29 05:18:13,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:18:13,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:18:13,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:18:13,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:18:13,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (1/1) ... [2023-11-29 05:18:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:18:13,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:13,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:18:13,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:18:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 05:18:13,168 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 05:18:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:18:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:18:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:18:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:18:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:18:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:18:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:18:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:18:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:18:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:18:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:18:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:18:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:18:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:18:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:18:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:18:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:18:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:18:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:18:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:18:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:18:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:18:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:18:13,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:18:13,313 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:18:13,315 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:18:13,337 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 05:18:13,656 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:18:13,703 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:18:13,703 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 05:18:13,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:18:13 BoogieIcfgContainer [2023-11-29 05:18:13,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:18:13,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:18:13,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:18:13,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:18:13,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:18:12" (1/3) ... [2023-11-29 05:18:13,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41821fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:18:13, skipping insertion in model container [2023-11-29 05:18:13,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:12" (2/3) ... [2023-11-29 05:18:13,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41821fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:18:13, skipping insertion in model container [2023-11-29 05:18:13,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:18:13" (3/3) ... [2023-11-29 05:18:13,730 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2023-11-29 05:18:13,762 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:18:13,762 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-11-29 05:18:13,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:18:13,828 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;@53dc7a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:18:13,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-29 05:18:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 51 states have (on average 2.372549019607843) internal successors, (121), 105 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:18:13,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:13,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:18:13,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:13,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 7672370, now seen corresponding path program 1 times [2023-11-29 05:18:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:13,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863966007] [2023-11-29 05:18:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:13,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:14,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:14,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863966007] [2023-11-29 05:18:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863966007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:14,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:14,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:18:14,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054414599] [2023-11-29 05:18:14,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:14,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:14,118 INFO L87 Difference]: Start difference. First operand has 107 states, 51 states have (on average 2.372549019607843) internal successors, (121), 105 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:14,265 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-11-29 05:18:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:14,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:18:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:14,276 INFO L225 Difference]: With dead ends: 103 [2023-11-29 05:18:14,276 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 05:18:14,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:14,281 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 12 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:14,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 05:18:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 05:18:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 48 states have (on average 2.2083333333333335) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-29 05:18:14,322 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 4 [2023-11-29 05:18:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:14,323 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-29 05:18:14,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-29 05:18:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:18:14,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:14,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:18:14,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:18:14,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:14,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash 7672371, now seen corresponding path program 1 times [2023-11-29 05:18:14,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:14,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153184691] [2023-11-29 05:18:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:14,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153184691] [2023-11-29 05:18:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153184691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:14,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:14,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:18:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548540930] [2023-11-29 05:18:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:14,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:14,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:14,449 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:14,553 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2023-11-29 05:18:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:14,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:18:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:14,555 INFO L225 Difference]: With dead ends: 95 [2023-11-29 05:18:14,555 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 05:18:14,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:14,558 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:14,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 05:18:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-29 05:18:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 94 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2023-11-29 05:18:14,569 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 4 [2023-11-29 05:18:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:14,570 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2023-11-29 05:18:14,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2023-11-29 05:18:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 05:18:14,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:14,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:18:14,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:18:14,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:14,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash 237983771, now seen corresponding path program 1 times [2023-11-29 05:18:14,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033887130] [2023-11-29 05:18:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:14,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033887130] [2023-11-29 05:18:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033887130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:14,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:18:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147305318] [2023-11-29 05:18:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:14,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:14,648 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:14,685 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-11-29 05:18:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:14,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 05:18:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:14,687 INFO L225 Difference]: With dead ends: 105 [2023-11-29 05:18:14,687 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 05:18:14,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:14,689 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:14,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 179 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 05:18:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2023-11-29 05:18:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 2.122448979591837) internal successors, (104), 95 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 05:18:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2023-11-29 05:18:14,699 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 5 [2023-11-29 05:18:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:14,699 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2023-11-29 05:18:14,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2023-11-29 05:18:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:18:14,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:14,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:14,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:18:14,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:14,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1101312842, now seen corresponding path program 1 times [2023-11-29 05:18:14,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:14,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358522345] [2023-11-29 05:18:14,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:14,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:14,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358522345] [2023-11-29 05:18:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358522345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:14,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:18:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225385987] [2023-11-29 05:18:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:14,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:14,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:14,767 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:14,810 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2023-11-29 05:18:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 05:18:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:14,812 INFO L225 Difference]: With dead ends: 102 [2023-11-29 05:18:14,812 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 05:18:14,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:14,814 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:14,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 05:18:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2023-11-29 05:18:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 2.0185185185185186) internal successors, (109), 100 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2023-11-29 05:18:14,822 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 8 [2023-11-29 05:18:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:14,823 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2023-11-29 05:18:14,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2023-11-29 05:18:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 05:18:14,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:14,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:14,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:18:14,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:14,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1521644016, now seen corresponding path program 1 times [2023-11-29 05:18:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914236782] [2023-11-29 05:18:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914236782] [2023-11-29 05:18:14,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914236782] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:14,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848440842] [2023-11-29 05:18:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:14,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:14,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:14,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:18:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:15,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:18:15,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:15,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848440842] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:15,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:15,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-11-29 05:18:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029308554] [2023-11-29 05:18:15,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:15,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:18:15,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:18:15,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:15,123 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:15,191 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2023-11-29 05:18:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 05:18:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:15,193 INFO L225 Difference]: With dead ends: 103 [2023-11-29 05:18:15,193 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 05:18:15,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:15,194 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:15,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 348 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 05:18:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-29 05:18:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 102 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2023-11-29 05:18:15,201 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 12 [2023-11-29 05:18:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:15,202 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2023-11-29 05:18:15,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2023-11-29 05:18:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 05:18:15,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:15,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 05:18:15,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:18:15,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:15,409 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:15,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1967757631, now seen corresponding path program 1 times [2023-11-29 05:18:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688912810] [2023-11-29 05:18:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688912810] [2023-11-29 05:18:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688912810] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091192026] [2023-11-29 05:18:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:15,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:15,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:15,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:18:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:15,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:18:15,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:15,704 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 05:18:15,747 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 05:18:15,748 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 05:18:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:15,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091192026] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:15,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-11-29 05:18:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570920632] [2023-11-29 05:18:15,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:15,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:18:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:18:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:18:15,882 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:16,125 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2023-11-29 05:18:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:18:16,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 05:18:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:16,127 INFO L225 Difference]: With dead ends: 102 [2023-11-29 05:18:16,127 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 05:18:16,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:18:16,128 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:16,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 310 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:18:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 05:18:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-29 05:18:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 101 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-11-29 05:18:16,135 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 15 [2023-11-29 05:18:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:16,135 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-11-29 05:18:16,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-11-29 05:18:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 05:18:16,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:16,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 05:18:16,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:18:16,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 05:18:16,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:16,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1967757630, now seen corresponding path program 1 times [2023-11-29 05:18:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463938832] [2023-11-29 05:18:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463938832] [2023-11-29 05:18:16,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463938832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694026027] [2023-11-29 05:18:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:16,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:16,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:16,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:18:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:16,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:18:16,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:16,693 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 05:18:16,697 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 05:18:16,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:16,775 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 05:18:16,785 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:18:16,786 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 11 treesize of output 11 [2023-11-29 05:18:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:16,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:17,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694026027] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:17,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:17,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-11-29 05:18:17,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536087594] [2023-11-29 05:18:17,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:17,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:18:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:17,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:18:17,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:18:17,023 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:17,349 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2023-11-29 05:18:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:18:17,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 05:18:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:17,351 INFO L225 Difference]: With dead ends: 101 [2023-11-29 05:18:17,351 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 05:18:17,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:18:17,352 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 13 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:17,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 259 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:18:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 05:18:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-29 05:18:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 100 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2023-11-29 05:18:17,358 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2023-11-29 05:18:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:17,359 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2023-11-29 05:18:17,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2023-11-29 05:18:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:18:17,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:17,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 05:18:17,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:18:17,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 05:18:17,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:17,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash -259289477, now seen corresponding path program 2 times [2023-11-29 05:18:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:17,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87938642] [2023-11-29 05:18:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87938642] [2023-11-29 05:18:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87938642] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498020886] [2023-11-29 05:18:17,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:18:17,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:17,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:17,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:17,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:18:17,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:18:17,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:18:17,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:18:17,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:17,753 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 05:18:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:17,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:18:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498020886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:17,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:18:17,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-29 05:18:17,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698727535] [2023-11-29 05:18:17,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:17,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:17,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:17,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:17,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:17,764 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:17,846 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-11-29 05:18:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:17,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 05:18:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:17,847 INFO L225 Difference]: With dead ends: 98 [2023-11-29 05:18:17,848 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 05:18:17,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:17,849 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:17,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 127 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 05:18:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 05:18:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.8928571428571428) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-29 05:18:17,855 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 19 [2023-11-29 05:18:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:17,855 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-29 05:18:17,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-29 05:18:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:18:17,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:17,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 05:18:17,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:18:18,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:18,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:18,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash -259289476, now seen corresponding path program 1 times [2023-11-29 05:18:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:18,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513870738] [2023-11-29 05:18:18,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:18,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:18,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513870738] [2023-11-29 05:18:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513870738] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680366000] [2023-11-29 05:18:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:18,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:18,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:18:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:18,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:18:18,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:18,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680366000] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:18,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-29 05:18:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910791761] [2023-11-29 05:18:18,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:18,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:18:18,303 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:18,357 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2023-11-29 05:18:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:18:18,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 05:18:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:18,359 INFO L225 Difference]: With dead ends: 98 [2023-11-29 05:18:18,359 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 05:18:18,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:18,360 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:18,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 05:18:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 05:18:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.875) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-11-29 05:18:18,364 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 19 [2023-11-29 05:18:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:18,365 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-11-29 05:18:18,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-11-29 05:18:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 05:18:18,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:18,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:18,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:18:18,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:18,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:18,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 257256453, now seen corresponding path program 1 times [2023-11-29 05:18:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012833902] [2023-11-29 05:18:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:18,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012833902] [2023-11-29 05:18:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012833902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:18,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:18:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513730638] [2023-11-29 05:18:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:18,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:18,699 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:18,767 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2023-11-29 05:18:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:18,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 05:18:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:18,768 INFO L225 Difference]: With dead ends: 95 [2023-11-29 05:18:18,768 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 05:18:18,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:18,769 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:18,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 05:18:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-29 05:18:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2023-11-29 05:18:18,773 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 20 [2023-11-29 05:18:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:18,774 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2023-11-29 05:18:18,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2023-11-29 05:18:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:18:18,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:18,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:18,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:18:18,775 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:18,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1705339265, now seen corresponding path program 1 times [2023-11-29 05:18:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:18,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675605033] [2023-11-29 05:18:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:18,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:18:19,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:19,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675605033] [2023-11-29 05:18:19,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675605033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:19,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103977444] [2023-11-29 05:18:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:19,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:19,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:19,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:19,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:18:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:19,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 05:18:19,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:19,233 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 05:18:19,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:19,247 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 05:18:19,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:19,319 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 05:18:19,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:19,429 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-11-29 05:18:19,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2023-11-29 05:18:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:19,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:49,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103977444] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:49,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:49,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-29 05:18:49,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338543551] [2023-11-29 05:18:49,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:49,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:18:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:49,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:18:49,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=196, Unknown=7, NotChecked=0, Total=272 [2023-11-29 05:18:49,721 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:50,075 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-11-29 05:18:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:18:50,075 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-29 05:18:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:50,076 INFO L225 Difference]: With dead ends: 99 [2023-11-29 05:18:50,076 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 05:18:50,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=119, Invalid=294, Unknown=7, NotChecked=0, Total=420 [2023-11-29 05:18:50,077 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 207 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:50,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 175 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:18:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 05:18:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2023-11-29 05:18:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 87 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-11-29 05:18:50,081 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 23 [2023-11-29 05:18:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:50,081 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-11-29 05:18:50,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-11-29 05:18:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:18:50,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:50,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:50,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:18:50,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:50,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:50,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1705339266, now seen corresponding path program 1 times [2023-11-29 05:18:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025942938] [2023-11-29 05:18:50,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:18:50,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:50,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025942938] [2023-11-29 05:18:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025942938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:50,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160298160] [2023-11-29 05:18:50,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:50,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:50,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:50,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:18:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:50,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 05:18:50,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:50,847 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 05:18:50,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:50,881 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 05:18:50,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:50,936 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 05:18:50,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:50,998 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 05:18:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:51,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:18:51,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160298160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:51,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:18:51,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2023-11-29 05:18:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60119533] [2023-11-29 05:18:51,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:51,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:51,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:51,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:51,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:18:51,029 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:51,133 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-11-29 05:18:51,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:51,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-29 05:18:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:51,135 INFO L225 Difference]: With dead ends: 81 [2023-11-29 05:18:51,135 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 05:18:51,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:18:51,135 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 101 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:51,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 05:18:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-29 05:18:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2023-11-29 05:18:51,139 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2023-11-29 05:18:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:51,139 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2023-11-29 05:18:51,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2023-11-29 05:18:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:18:51,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:51,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:51,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:18:51,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 05:18:51,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:51,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:51,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1846316124, now seen corresponding path program 1 times [2023-11-29 05:18:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:51,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648890542] [2023-11-29 05:18:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:18:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648890542] [2023-11-29 05:18:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648890542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:51,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:51,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:18:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240442322] [2023-11-29 05:18:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:51,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:18:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:51,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:18:51,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:18:51,596 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:51,832 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2023-11-29 05:18:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:18:51,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 05:18:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:51,834 INFO L225 Difference]: With dead ends: 111 [2023-11-29 05:18:51,834 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 05:18:51,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:18:51,835 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 100 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:51,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 173 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:18:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 05:18:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2023-11-29 05:18:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.671875) internal successors, (107), 88 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2023-11-29 05:18:51,839 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 25 [2023-11-29 05:18:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:51,840 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2023-11-29 05:18:51,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2023-11-29 05:18:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:18:51,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:51,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:51,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:18:51,841 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:51,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1846316123, now seen corresponding path program 1 times [2023-11-29 05:18:51,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:51,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928238845] [2023-11-29 05:18:51,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:18:52,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:52,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928238845] [2023-11-29 05:18:52,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928238845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:52,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:52,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:18:52,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259099061] [2023-11-29 05:18:52,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:52,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:18:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:52,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:18:52,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:18:52,189 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:52,416 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-11-29 05:18:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:18:52,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 05:18:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:52,418 INFO L225 Difference]: With dead ends: 109 [2023-11-29 05:18:52,418 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 05:18:52,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:18:52,419 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 95 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:52,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 175 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:18:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 05:18:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2023-11-29 05:18:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.640625) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2023-11-29 05:18:52,422 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 25 [2023-11-29 05:18:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:52,422 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2023-11-29 05:18:52,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2023-11-29 05:18:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:18:52,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:52,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:52,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:18:52,424 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:52,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1401226578, now seen corresponding path program 1 times [2023-11-29 05:18:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:52,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311092157] [2023-11-29 05:18:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311092157] [2023-11-29 05:18:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311092157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:18:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110626339] [2023-11-29 05:18:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:52,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:52,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:52,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:52,485 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:52,520 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-11-29 05:18:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 05:18:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:52,521 INFO L225 Difference]: With dead ends: 85 [2023-11-29 05:18:52,521 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 05:18:52,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:52,522 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:52,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 121 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 05:18:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-11-29 05:18:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 83 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2023-11-29 05:18:52,526 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 26 [2023-11-29 05:18:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:52,526 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2023-11-29 05:18:52,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2023-11-29 05:18:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:18:52,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:52,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:52,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:18:52,528 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:52,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash -488167697, now seen corresponding path program 1 times [2023-11-29 05:18:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:52,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558034285] [2023-11-29 05:18:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:52,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558034285] [2023-11-29 05:18:52,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558034285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:52,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:52,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:18:52,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698524886] [2023-11-29 05:18:52,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:52,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:18:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:18:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:52,661 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:52,708 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-11-29 05:18:52,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:18:52,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 05:18:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:52,710 INFO L225 Difference]: With dead ends: 81 [2023-11-29 05:18:52,710 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 05:18:52,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:18:52,711 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 96 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:52,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 135 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 05:18:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-29 05:18:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2023-11-29 05:18:52,714 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 27 [2023-11-29 05:18:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:52,714 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2023-11-29 05:18:52,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2023-11-29 05:18:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:18:52,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:52,716 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:52,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:18:52,716 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:52,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash -488331034, now seen corresponding path program 1 times [2023-11-29 05:18:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027672337] [2023-11-29 05:18:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:52,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:52,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027672337] [2023-11-29 05:18:52,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027672337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:52,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:52,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:18:52,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660274789] [2023-11-29 05:18:52,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:52,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:52,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:52,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:18:52,802 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:52,892 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2023-11-29 05:18:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:52,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 05:18:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:52,893 INFO L225 Difference]: With dead ends: 78 [2023-11-29 05:18:52,894 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 05:18:52,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:18:52,894 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:52,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 106 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 05:18:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-29 05:18:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-11-29 05:18:52,898 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 27 [2023-11-29 05:18:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:52,898 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-11-29 05:18:52,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-11-29 05:18:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:18:52,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:52,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:52,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:18:52,899 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:52,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -488331033, now seen corresponding path program 1 times [2023-11-29 05:18:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22519347] [2023-11-29 05:18:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22519347] [2023-11-29 05:18:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22519347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:53,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:53,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:18:53,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344341755] [2023-11-29 05:18:53,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:53,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:53,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:53,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:18:53,005 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:53,041 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2023-11-29 05:18:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:53,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 05:18:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:53,043 INFO L225 Difference]: With dead ends: 77 [2023-11-29 05:18:53,043 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 05:18:53,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:53,043 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 66 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:53,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 119 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 05:18:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-29 05:18:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.456140350877193) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-11-29 05:18:53,046 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 27 [2023-11-29 05:18:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:53,047 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-11-29 05:18:53,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-11-29 05:18:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:18:53,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:53,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:53,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:18:53,048 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:53,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2046668995, now seen corresponding path program 1 times [2023-11-29 05:18:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646542490] [2023-11-29 05:18:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:53,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646542490] [2023-11-29 05:18:53,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646542490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:53,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:53,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:18:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748992] [2023-11-29 05:18:53,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:53,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:53,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:53,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:18:53,122 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:53,219 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2023-11-29 05:18:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:18:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 05:18:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:53,220 INFO L225 Difference]: With dead ends: 77 [2023-11-29 05:18:53,220 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 05:18:53,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:53,221 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:53,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 107 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 05:18:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-11-29 05:18:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-11-29 05:18:53,224 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 28 [2023-11-29 05:18:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:53,224 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-11-29 05:18:53,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-11-29 05:18:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:18:53,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:53,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:53,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:18:53,225 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:53,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2046668996, now seen corresponding path program 1 times [2023-11-29 05:18:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844089553] [2023-11-29 05:18:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:18:53,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844089553] [2023-11-29 05:18:53,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844089553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068614832] [2023-11-29 05:18:53,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:53,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:53,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:53,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:53,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:18:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:53,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:18:53,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:53,648 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 7 treesize of output 3 [2023-11-29 05:18:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:18:53,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:18:53,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068614832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:53,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:18:53,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-29 05:18:53,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124841846] [2023-11-29 05:18:53,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:53,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:53,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:53,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:53,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:18:53,691 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:53,773 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2023-11-29 05:18:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:53,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 05:18:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:53,775 INFO L225 Difference]: With dead ends: 75 [2023-11-29 05:18:53,775 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 05:18:53,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:18:53,776 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:53,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 119 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 05:18:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-29 05:18:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-11-29 05:18:53,779 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 28 [2023-11-29 05:18:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:53,779 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-11-29 05:18:53,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-11-29 05:18:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 05:18:53,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:53,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:53,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:18:53,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:53,987 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:53,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash -977770530, now seen corresponding path program 1 times [2023-11-29 05:18:53,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:53,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546773111] [2023-11-29 05:18:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:18:54,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:54,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546773111] [2023-11-29 05:18:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546773111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:54,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:54,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:18:54,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323622687] [2023-11-29 05:18:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:54,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:18:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:18:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:54,135 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:54,214 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2023-11-29 05:18:54,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 05:18:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:54,215 INFO L225 Difference]: With dead ends: 72 [2023-11-29 05:18:54,215 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 05:18:54,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:54,216 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:54,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 05:18:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-29 05:18:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2023-11-29 05:18:54,220 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 29 [2023-11-29 05:18:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:54,220 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2023-11-29 05:18:54,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2023-11-29 05:18:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 05:18:54,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:54,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:54,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:18:54,221 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:54,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:54,221 INFO L85 PathProgramCache]: Analyzing trace with hash -293620857, now seen corresponding path program 1 times [2023-11-29 05:18:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682327864] [2023-11-29 05:18:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:55,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:55,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682327864] [2023-11-29 05:18:55,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682327864] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:55,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595956338] [2023-11-29 05:18:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:55,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:55,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:55,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:55,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:18:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:55,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 05:18:55,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:55,272 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 05:18:55,356 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:18:55,356 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 05:18:55,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:18:55,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-29 05:18:55,534 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:18:55,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 05:18:55,679 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-11-29 05:18:55,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2023-11-29 05:18:55,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 33 [2023-11-29 05:18:55,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 33 [2023-11-29 05:18:55,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 33 [2023-11-29 05:18:55,920 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 66 treesize of output 38 [2023-11-29 05:18:55,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2023-11-29 05:18:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:56,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:56,372 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 34 treesize of output 26 [2023-11-29 05:18:56,376 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 30 treesize of output 22 [2023-11-29 05:18:56,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:18:56,669 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-11-29 05:18:56,673 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 90 treesize of output 78 [2023-11-29 05:18:56,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 34 [2023-11-29 05:18:56,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 62 [2023-11-29 05:18:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595956338] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:57,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:57,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 36 [2023-11-29 05:18:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535022841] [2023-11-29 05:18:57,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:57,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 05:18:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:57,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 05:18:57,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1167, Unknown=4, NotChecked=0, Total=1332 [2023-11-29 05:18:57,057 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 37 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:58,350 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2023-11-29 05:18:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:18:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 05:18:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:58,351 INFO L225 Difference]: With dead ends: 79 [2023-11-29 05:18:58,351 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 05:18:58,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=296, Invalid=1956, Unknown=4, NotChecked=0, Total=2256 [2023-11-29 05:18:58,353 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 133 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:58,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 439 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:18:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 05:18:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2023-11-29 05:18:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-11-29 05:18:58,356 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 32 [2023-11-29 05:18:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:58,356 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-11-29 05:18:58,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:18:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-11-29 05:18:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 05:18:58,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:58,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:58,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:18:58,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 05:18:58,558 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:18:58,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -293620856, now seen corresponding path program 1 times [2023-11-29 05:18:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279341473] [2023-11-29 05:18:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:59,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279341473] [2023-11-29 05:18:59,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279341473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452839504] [2023-11-29 05:18:59,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:59,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:59,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:59,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:59,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:18:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:59,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-29 05:18:59,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:00,009 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 05:19:00,105 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:19:00,106 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 05:19:00,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:19:00,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:19:00,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-29 05:19:00,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2023-11-29 05:19:00,398 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:19:00,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2023-11-29 05:19:00,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 16 [2023-11-29 05:19:00,569 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:19:00,569 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 28 treesize of output 30 [2023-11-29 05:19:00,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-29 05:19:00,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 20 [2023-11-29 05:19:00,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 33 [2023-11-29 05:19:00,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 33 [2023-11-29 05:19:00,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 20 [2023-11-29 05:19:00,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 33 [2023-11-29 05:19:00,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 20 [2023-11-29 05:19:00,800 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 59 treesize of output 35 [2023-11-29 05:19:00,864 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 25 treesize of output 13 [2023-11-29 05:19:00,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:19:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:00,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:01,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (and (forall ((v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1818 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1818) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1819) .cse0) .cse1)))) (forall ((v_ArrVal_1818 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1818) .cse0) .cse1)))))) is different from false [2023-11-29 05:19:01,115 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 76 treesize of output 60 [2023-11-29 05:19:01,119 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 64 treesize of output 48 [2023-11-29 05:19:01,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:01,371 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 121 treesize of output 125 [2023-11-29 05:19:01,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:01,843 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2023-11-29 05:19:01,847 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 140 treesize of output 122 [2023-11-29 05:19:01,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 13 [2023-11-29 05:19:01,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 20 [2023-11-29 05:19:01,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:01,891 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2023-11-29 05:19:01,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:01,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:01,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 32 [2023-11-29 05:19:01,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-11-29 05:19:01,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:01,945 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2023-11-29 05:19:01,949 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:01,952 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 39 treesize of output 27 [2023-11-29 05:19:01,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:19:01,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:01,976 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2023-11-29 05:19:01,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:01,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:01,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 32 [2023-11-29 05:19:01,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-11-29 05:19:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452839504] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:19:02,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:19:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-11-29 05:19:02,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254722082] [2023-11-29 05:19:02,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:19:02,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 05:19:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 05:19:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1133, Unknown=6, NotChecked=68, Total=1332 [2023-11-29 05:19:02,546 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:04,654 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2023-11-29 05:19:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:19:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 05:19:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:04,656 INFO L225 Difference]: With dead ends: 77 [2023-11-29 05:19:04,656 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 05:19:04,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=404, Invalid=2350, Unknown=6, NotChecked=102, Total=2862 [2023-11-29 05:19:04,658 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 111 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:04,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 561 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 998 Invalid, 0 Unknown, 78 Unchecked, 1.1s Time] [2023-11-29 05:19:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 05:19:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2023-11-29 05:19:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-11-29 05:19:04,660 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 32 [2023-11-29 05:19:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:04,660 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-11-29 05:19:04,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-11-29 05:19:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 05:19:04,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:04,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:04,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:19:04,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 05:19:04,862 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:19:04,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 753950314, now seen corresponding path program 1 times [2023-11-29 05:19:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26836841] [2023-11-29 05:19:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:19:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:05,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26836841] [2023-11-29 05:19:05,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26836841] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:05,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717711113] [2023-11-29 05:19:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:05,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:05,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:05,029 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:19:05,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:19:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:05,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:19:05,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:05,330 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 17 treesize of output 9 [2023-11-29 05:19:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:19:05,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:05,377 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-29 05:19:05,377 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 16 treesize of output 15 [2023-11-29 05:19:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:19:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717711113] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:19:05,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:19:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2023-11-29 05:19:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467326528] [2023-11-29 05:19:05,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:19:05,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:19:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:05,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:19:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:19:05,386 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:05,618 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-29 05:19:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:19:05,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-29 05:19:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:05,619 INFO L225 Difference]: With dead ends: 61 [2023-11-29 05:19:05,619 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 05:19:05,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:19:05,620 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:05,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 281 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:19:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 05:19:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 05:19:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.3) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-11-29 05:19:05,622 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 33 [2023-11-29 05:19:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:05,623 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-11-29 05:19:05,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-11-29 05:19:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 05:19:05,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:05,624 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:05,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:19:05,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 05:19:05,824 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:19:05,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1595280701, now seen corresponding path program 1 times [2023-11-29 05:19:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:05,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791542796] [2023-11-29 05:19:05,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:05,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:19:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791542796] [2023-11-29 05:19:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791542796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022055614] [2023-11-29 05:19:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:06,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:06,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:06,015 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:19:06,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:19:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:06,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 05:19:06,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:06,292 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 05:19:06,341 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:19:06,341 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 18 treesize of output 21 [2023-11-29 05:19:06,439 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 17 treesize of output 9 [2023-11-29 05:19:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:19:06,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:19:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022055614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:19:06,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:19:06,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 9 [2023-11-29 05:19:06,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016267118] [2023-11-29 05:19:06,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:19:06,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:19:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:19:06,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:19:06,445 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:06,641 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-11-29 05:19:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:19:06,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-29 05:19:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:06,642 INFO L225 Difference]: With dead ends: 91 [2023-11-29 05:19:06,642 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 05:19:06,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:19:06,643 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 193 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:06,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 107 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:19:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 05:19:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2023-11-29 05:19:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2023-11-29 05:19:06,646 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 35 [2023-11-29 05:19:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:06,646 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2023-11-29 05:19:06,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2023-11-29 05:19:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 05:19:06,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:06,647 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:06,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 05:19:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:06,848 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:19:06,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1595280702, now seen corresponding path program 1 times [2023-11-29 05:19:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:06,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180109490] [2023-11-29 05:19:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:19:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180109490] [2023-11-29 05:19:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180109490] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526598664] [2023-11-29 05:19:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:07,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:07,287 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:19:07,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:19:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:07,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 05:19:07,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:07,553 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 05:19:07,558 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 05:19:07,655 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:19:07,655 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 18 treesize of output 21 [2023-11-29 05:19:07,670 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:19:07,671 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 15 treesize of output 15 [2023-11-29 05:19:07,775 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 17 treesize of output 9 [2023-11-29 05:19:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:19:07,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:19:07,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526598664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:19:07,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:19:07,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2023-11-29 05:19:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933308152] [2023-11-29 05:19:07,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:19:07,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:19:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:19:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:19:07,795 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:07,926 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-11-29 05:19:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:19:07,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-29 05:19:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:07,928 INFO L225 Difference]: With dead ends: 83 [2023-11-29 05:19:07,928 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 05:19:07,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:19:07,928 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 82 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:07,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 116 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:19:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 05:19:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2023-11-29 05:19:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2023-11-29 05:19:07,931 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 35 [2023-11-29 05:19:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:07,931 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2023-11-29 05:19:07,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2023-11-29 05:19:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:19:07,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:07,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:07,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 05:19:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 05:19:08,132 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:19:08,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1193061626, now seen corresponding path program 1 times [2023-11-29 05:19:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:08,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465943468] [2023-11-29 05:19:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:19:08,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:08,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465943468] [2023-11-29 05:19:08,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465943468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:19:08,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:19:08,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:19:08,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245349230] [2023-11-29 05:19:08,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:19:08,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:19:08,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:08,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:19:08,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:19:08,216 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:08,295 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2023-11-29 05:19:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:19:08,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-29 05:19:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:08,296 INFO L225 Difference]: With dead ends: 68 [2023-11-29 05:19:08,296 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 05:19:08,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:19:08,297 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:08,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 150 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:19:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 05:19:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2023-11-29 05:19:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-11-29 05:19:08,299 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 38 [2023-11-29 05:19:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:08,299 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-11-29 05:19:08,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-11-29 05:19:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 05:19:08,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:08,300 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:08,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 05:19:08,300 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:19:08,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1562172498, now seen corresponding path program 1 times [2023-11-29 05:19:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352515001] [2023-11-29 05:19:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:19:09,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:09,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352515001] [2023-11-29 05:19:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352515001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:09,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97897879] [2023-11-29 05:19:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:09,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:09,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:09,141 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:19:09,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:19:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:09,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 05:19:09,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:09,365 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 05:19:09,445 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:19:09,446 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 15 treesize of output 15 [2023-11-29 05:19:09,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-29 05:19:09,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 05:19:09,772 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2023-11-29 05:19:09,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 65 [2023-11-29 05:19:09,842 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 49 treesize of output 33 [2023-11-29 05:19:09,845 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 44 treesize of output 28 [2023-11-29 05:19:09,890 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 31 treesize of output 13 [2023-11-29 05:19:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:19:09,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:10,135 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-29 05:19:10,135 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 29 treesize of output 28 [2023-11-29 05:19:10,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:10,193 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-29 05:19:10,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:10,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 55 [2023-11-29 05:19:10,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 3 [2023-11-29 05:19:10,502 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 15 treesize of output 7 [2023-11-29 05:19:10,505 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 19 treesize of output 11 [2023-11-29 05:19:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:19:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97897879] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:19:10,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:19:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2023-11-29 05:19:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383382279] [2023-11-29 05:19:10,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:19:10,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 05:19:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:10,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 05:19:10,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1368, Unknown=2, NotChecked=0, Total=1482 [2023-11-29 05:19:10,602 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:12,188 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2023-11-29 05:19:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 05:19:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-29 05:19:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:12,189 INFO L225 Difference]: With dead ends: 106 [2023-11-29 05:19:12,189 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 05:19:12,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=299, Invalid=2779, Unknown=2, NotChecked=0, Total=3080 [2023-11-29 05:19:12,191 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 184 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:12,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 394 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:19:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 05:19:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 66. [2023-11-29 05:19:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2023-11-29 05:19:12,194 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 39 [2023-11-29 05:19:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:12,194 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2023-11-29 05:19:12,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2023-11-29 05:19:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 05:19:12,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:12,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:12,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 05:19:12,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 05:19:12,395 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:19:12,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1758041553, now seen corresponding path program 1 times [2023-11-29 05:19:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:12,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534243252] [2023-11-29 05:19:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534243252] [2023-11-29 05:19:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534243252] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946868463] [2023-11-29 05:19:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:13,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:13,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:13,991 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:19:13,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:19:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:14,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-29 05:19:14,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:14,263 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 05:19:14,373 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:19:14,373 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 05:19:14,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:19:14,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-29 05:19:14,573 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:19:14,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 05:19:14,725 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:19:14,725 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 28 treesize of output 30 [2023-11-29 05:19:14,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:19:14,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:19:14,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:19:15,408 INFO L349 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2023-11-29 05:19:15,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 64 [2023-11-29 05:19:15,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-29 05:19:15,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 76 treesize of output 59 [2023-11-29 05:19:15,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 05:19:15,732 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2023-11-29 05:19:15,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 137 [2023-11-29 05:19:15,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 21 [2023-11-29 05:19:15,929 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:19:15,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 122 treesize of output 95 [2023-11-29 05:19:15,950 INFO L349 Elim1Store]: treesize reduction 55, result has 23.6 percent of original size [2023-11-29 05:19:15,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 31 treesize of output 30 [2023-11-29 05:19:15,994 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:19:15,995 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 54 treesize of output 34 [2023-11-29 05:19:20,327 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 193 treesize of output 141 [2023-11-29 05:19:20,333 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 152 treesize of output 120 [2023-11-29 05:19:20,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:20,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 114 treesize of output 86 [2023-11-29 05:19:20,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:20,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 134 [2023-11-29 05:19:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:21,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:21,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:21,663 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 101 treesize of output 105 [2023-11-29 05:19:21,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:21,856 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-11-29 05:19:21,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:21,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 268 treesize of output 282 [2023-11-29 05:19:21,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 286 treesize of output 254 [2023-11-29 05:19:21,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-29 05:19:21,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-29 05:19:22,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:22,010 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 237 treesize of output 217 [2023-11-29 05:19:22,255 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 05:19:22,255 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 1 [2023-11-29 05:19:22,973 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 83 treesize of output 59 [2023-11-29 05:19:22,976 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 69 treesize of output 49 [2023-11-29 05:19:27,753 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:27,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:27,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 60 [2023-11-29 05:19:27,763 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:27,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:27,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 35 [2023-11-29 05:19:27,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:19:27,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-11-29 05:19:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946868463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:19:28,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:19:28,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 61 [2023-11-29 05:19:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005596029] [2023-11-29 05:19:28,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:19:28,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-29 05:19:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:28,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-29 05:19:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3523, Unknown=9, NotChecked=0, Total=3782 [2023-11-29 05:19:28,102 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 62 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:31,727 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2023-11-29 05:19:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:19:31,728 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 62 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-11-29 05:19:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:31,728 INFO L225 Difference]: With dead ends: 102 [2023-11-29 05:19:31,728 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 05:19:31,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=452, Invalid=5545, Unknown=9, NotChecked=0, Total=6006 [2023-11-29 05:19:31,730 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 284 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:31,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 837 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 05:19:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 05:19:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2023-11-29 05:19:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.263157894736842) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-11-29 05:19:31,733 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 40 [2023-11-29 05:19:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:31,733 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-11-29 05:19:31,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 62 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-11-29 05:19:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 05:19:31,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:31,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:31,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 05:19:31,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 05:19:31,935 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:19:31,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:31,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1335275999, now seen corresponding path program 1 times [2023-11-29 05:19:31,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:31,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709050688] [2023-11-29 05:19:31,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:33,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709050688] [2023-11-29 05:19:33,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709050688] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454463255] [2023-11-29 05:19:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:33,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:33,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:33,822 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:19:33,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:19:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:34,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-29 05:19:34,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:34,085 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 05:19:34,202 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:19:34,202 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 05:19:34,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:19:34,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:19:34,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-29 05:19:34,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-29 05:19:34,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-29 05:19:34,487 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:19:34,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:19:34,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2023-11-29 05:19:34,677 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:19:34,677 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 28 treesize of output 30 [2023-11-29 05:19:34,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:19:34,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2023-11-29 05:19:34,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2023-11-29 05:19:34,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:19:34,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:19:34,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2023-11-29 05:19:35,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:35,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2023-11-29 05:19:35,388 INFO L349 Elim1Store]: treesize reduction 37, result has 36.2 percent of original size [2023-11-29 05:19:35,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 51 treesize of output 25 [2023-11-29 05:19:35,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 25 [2023-11-29 05:19:35,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 25 [2023-11-29 05:19:35,727 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:19:35,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 33 [2023-11-29 05:19:35,835 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 28 treesize of output 20 [2023-11-29 05:19:35,838 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 31 treesize of output 19 [2023-11-29 05:19:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:35,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:37,022 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 84 treesize of output 64 [2023-11-29 05:19:37,027 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 74 treesize of output 50 [2023-11-29 05:19:37,433 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2984 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_arrayElimCell_158 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_38| Int)) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2978)) (.cse1 (+ v_arrayElimCell_158 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2985) |v_ULTIMATE.start_node_create_~temp~0#1.base_38| v_ArrVal_2987) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2977) |v_ULTIMATE.start_node_create_~temp~0#1.base_38| v_ArrVal_2984) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_2988) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_arrayElimCell_158)) (< v_arrayElimCell_158 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_arrayElimCell_158) (not (= v_ArrVal_2985 (store (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_38| v_ArrVal_2983) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2985 .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_38|) 0))))) is different from false [2023-11-29 05:19:37,496 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2984 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2975 Int) (v_ArrVal_2974 Int) (v_arrayElimCell_158 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_38| Int)) (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse1 (+ v_arrayElimCell_158 4))) (or (< v_arrayElimCell_158 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_arrayElimCell_158) (not (= v_ArrVal_2985 (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 v_ArrVal_2975)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2978) |v_ULTIMATE.start_node_create_~temp~0#1.base_38| v_ArrVal_2983) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2985 .cse1)))) (= (select (select (store (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2978) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2985) |v_ULTIMATE.start_node_create_~temp~0#1.base_38| v_ArrVal_2987) (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 v_ArrVal_2974)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2977) |v_ULTIMATE.start_node_create_~temp~0#1.base_38| v_ArrVal_2984) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_2988) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_arrayElimCell_158) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_38|) 0))))) is different from false [2023-11-29 05:19:37,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:37,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2023-11-29 05:19:37,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:37,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 134 treesize of output 130 [2023-11-29 05:19:37,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 56 [2023-11-29 05:19:37,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 114 treesize of output 106 [2023-11-29 05:19:39,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:39,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:39,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 118 [2023-11-29 05:19:39,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:39,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 43 [2023-11-29 05:19:39,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 30 [2023-11-29 05:19:39,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 44 [2023-11-29 05:19:39,972 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-29 05:19:39,972 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2023-11-29 05:19:39,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:39,988 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-29 05:19:40,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-11-29 05:19:40,047 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 05:19:40,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,060 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 24 treesize of output 28 [2023-11-29 05:19:40,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 55 [2023-11-29 05:19:40,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 20 [2023-11-29 05:19:40,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,169 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 12 treesize of output 16 [2023-11-29 05:19:40,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:19:40,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:19:40,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-11-29 05:19:40,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:19:40,221 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 88 [2023-11-29 05:19:40,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:19:40,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,248 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 22 treesize of output 18 [2023-11-29 05:19:40,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2023-11-29 05:19:40,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 15 [2023-11-29 05:19:40,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:19:40,288 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 69 [2023-11-29 05:19:40,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:19:40,308 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 18 [2023-11-29 05:19:40,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:19:40,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-11-29 05:19:40,339 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 107 [2023-11-29 05:19:40,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,369 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 47 treesize of output 43 [2023-11-29 05:19:40,406 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-29 05:19:40,406 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2023-11-29 05:19:40,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,421 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-29 05:19:40,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 22 [2023-11-29 05:19:40,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-11-29 05:19:40,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-29 05:19:40,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,514 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 24 treesize of output 28 [2023-11-29 05:19:40,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 69 [2023-11-29 05:19:40,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 20 [2023-11-29 05:19:40,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 05:19:40,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 7 [2023-11-29 05:19:40,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,613 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 88 [2023-11-29 05:19:40,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 20 [2023-11-29 05:19:40,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-11-29 05:19:40,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 15 [2023-11-29 05:19:40,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 88 [2023-11-29 05:19:40,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 43 [2023-11-29 05:19:40,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,739 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2023-11-29 05:19:40,772 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-29 05:19:40,772 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 48 [2023-11-29 05:19:40,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 15 [2023-11-29 05:19:40,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-11-29 05:19:40,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-29 05:19:40,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-29 05:19:40,875 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 88 [2023-11-29 05:19:40,898 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:40,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 43 [2023-11-29 05:19:40,935 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-29 05:19:40,935 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2023-11-29 05:19:40,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,948 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-29 05:19:40,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 15 [2023-11-29 05:19:40,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-11-29 05:19:40,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-11-29 05:19:41,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:41,009 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 24 treesize of output 28 [2023-11-29 05:19:41,044 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:41,048 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 05:19:41,053 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:41,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:41,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 107 [2023-11-29 05:19:41,075 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:41,078 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 47 treesize of output 43 [2023-11-29 05:19:41,111 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-29 05:19:41,112 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2023-11-29 05:19:41,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:41,126 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-29 05:19:41,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28 treesize of output 22 [2023-11-29 05:19:41,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-11-29 05:19:41,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2023-11-29 05:19:41,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-11-29 05:19:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 05:19:42,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454463255] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:19:42,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:19:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 56 [2023-11-29 05:19:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211511427] [2023-11-29 05:19:42,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:19:42,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-29 05:19:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-29 05:19:42,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2735, Unknown=35, NotChecked=214, Total=3192 [2023-11-29 05:19:42,581 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 57 states, 57 states have (on average 2.017543859649123) internal successors, (115), 56 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:49,260 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2023-11-29 05:19:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 05:19:49,261 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.017543859649123) internal successors, (115), 56 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-29 05:19:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:49,262 INFO L225 Difference]: With dead ends: 74 [2023-11-29 05:19:49,262 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 05:19:49,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=513, Invalid=4861, Unknown=36, NotChecked=290, Total=5700 [2023-11-29 05:19:49,264 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 143 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:49,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 733 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1301 Invalid, 1 Unknown, 142 Unchecked, 3.7s Time] [2023-11-29 05:19:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 05:19:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2023-11-29 05:19:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-11-29 05:19:49,265 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 41 [2023-11-29 05:19:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:49,266 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-11-29 05:19:49,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.017543859649123) internal successors, (115), 56 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:19:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-11-29 05:19:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 05:19:49,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:49,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:49,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 05:19:49,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:49,467 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:19:49,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash -985899415, now seen corresponding path program 1 times [2023-11-29 05:19:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711560107] [2023-11-29 05:19:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:49,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:19:50,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:50,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711560107] [2023-11-29 05:19:50,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711560107] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:50,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746183458] [2023-11-29 05:19:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:50,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:50,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:50,870 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:19:50,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:19:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:51,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 05:19:51,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:51,148 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 05:19:51,245 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:19:51,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 05:19:51,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-29 05:19:51,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 21 [2023-11-29 05:19:51,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 21 [2023-11-29 05:19:51,632 INFO L349 Elim1Store]: treesize reduction 55, result has 23.6 percent of original size [2023-11-29 05:19:51,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 68 treesize of output 39 [2023-11-29 05:19:59,717 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 45 treesize of output 33 [2023-11-29 05:19:59,721 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 34 treesize of output 22 [2023-11-29 05:19:59,810 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-29 05:19:59,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 15 [2023-11-29 05:19:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:19:59,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:20:00,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:00,079 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2023-11-29 05:20:00,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:00,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 401 treesize of output 405 [2023-11-29 05:20:00,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 276 treesize of output 244 [2023-11-29 05:20:00,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-29 05:20:00,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 4 [2023-11-29 05:20:00,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:00,230 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 74 treesize of output 66 [2023-11-29 05:20:00,552 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 15 treesize of output 7 [2023-11-29 05:20:00,556 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 26 treesize of output 14 [2023-11-29 05:20:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:20:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746183458] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:20:00,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:20:00,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 15] total 43 [2023-11-29 05:20:00,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533205847] [2023-11-29 05:20:00,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:20:00,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 05:20:00,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:20:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 05:20:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1663, Unknown=4, NotChecked=0, Total=1806 [2023-11-29 05:20:00,658 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 43 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:20:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:20:02,127 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-11-29 05:20:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:20:02,128 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-29 05:20:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:20:02,128 INFO L225 Difference]: With dead ends: 79 [2023-11-29 05:20:02,129 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 05:20:02,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=330, Invalid=3206, Unknown=4, NotChecked=0, Total=3540 [2023-11-29 05:20:02,130 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 227 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:20:02,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 485 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:20:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 05:20:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2023-11-29 05:20:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:20:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-11-29 05:20:02,133 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 43 [2023-11-29 05:20:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:20:02,133 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-11-29 05:20:02,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.6511627906976742) internal successors, (114), 43 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:20:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-11-29 05:20:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 05:20:02,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:20:02,134 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:20:02,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 05:20:02,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 05:20:02,335 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-29 05:20:02,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:20:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash -390488033, now seen corresponding path program 1 times [2023-11-29 05:20:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:20:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847006254] [2023-11-29 05:20:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:20:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:20:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:20:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:20:03,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:20:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847006254] [2023-11-29 05:20:03,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847006254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:20:03,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55361955] [2023-11-29 05:20:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:20:03,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:20:03,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:20:03,851 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:20:03,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39577ea9-6349-4f26-bd6a-716fef928c38/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 05:20:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:20:04,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-29 05:20:04,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:20:04,165 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 05:20:04,263 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:20:04,263 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 05:20:04,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:20:04,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2023-11-29 05:20:04,430 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:20:04,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 05:20:04,562 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:20:04,562 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 28 treesize of output 30 [2023-11-29 05:20:04,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:20:04,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:20:04,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 26 [2023-11-29 05:20:05,133 INFO L349 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2023-11-29 05:20:05,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 64 [2023-11-29 05:20:05,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-29 05:20:05,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 05:20:05,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 76 treesize of output 59 [2023-11-29 05:20:05,345 INFO L349 Elim1Store]: treesize reduction 90, result has 24.4 percent of original size [2023-11-29 05:20:05,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 89 [2023-11-29 05:20:05,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 21 [2023-11-29 05:20:05,540 INFO L349 Elim1Store]: treesize reduction 74, result has 37.3 percent of original size [2023-11-29 05:20:05,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 161 [2023-11-29 05:20:05,560 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-29 05:20:05,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-29 05:20:05,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 3 [2023-11-29 05:20:05,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 67 treesize of output 59 [2023-11-29 05:20:05,710 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:20:05,710 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 112 treesize of output 78 [2023-11-29 05:20:06,060 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 358 treesize of output 250 [2023-11-29 05:20:06,065 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 261 treesize of output 209 [2023-11-29 05:20:06,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:06,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 212 treesize of output 198 [2023-11-29 05:20:06,881 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:20:06,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2023-11-29 05:20:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:20:06,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:20:07,268 INFO L349 Elim1Store]: treesize reduction 5, result has 90.2 percent of original size [2023-11-29 05:20:07,268 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 55 treesize of output 54 [2023-11-29 05:20:07,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:07,513 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 64 [2023-11-29 05:20:07,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:07,638 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 109 [2023-11-29 05:20:07,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:07,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 425 treesize of output 410 [2023-11-29 05:20:07,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 395 treesize of output 363 [2023-11-29 05:20:07,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 189 treesize of output 173 [2023-11-29 05:22:34,243 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse0 0) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse129 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse18 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse3))) (let ((.cse23 (not .cse18)) (.cse4 (+ .cse0 4)) (.cse8 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse7 (+ .cse129 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse68 (forall ((v_arrayElimCell_273 Int) (v_ArrVal_3370 (Array Int Int))) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimCell_271 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse198 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse195 (select .cse198 .cse7))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse196 (let ((.cse197 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse198 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse195 v_ArrVal_3379))) (select .cse197 (select (select .cse197 .cse3) .cse4))))) (or (= .cse195 (select .cse196 (+ v_arrayElimCell_273 4))) (= .cse195 (select .cse196 (+ v_arrayElimCell_271 4)))))) (not (= .cse195 (select v_arrayElimArr_32 .cse8))))))) (< v_arrayElimCell_271 0)))))) (.cse67 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse194 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse191 (select .cse194 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int) (v_arrayElimCell_274 Int)) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse192 (let ((.cse193 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse194 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse191 v_ArrVal_3379))) (select .cse193 (select (select .cse193 .cse3) .cse4))))) (or (= .cse191 (select .cse192 (+ v_arrayElimCell_273 4))) (= .cse191 (select .cse192 (+ v_arrayElimCell_274 4))) (= .cse191 (select .cse192 (+ v_arrayElimCell_271 4)))))) (not (= .cse191 (select v_arrayElimArr_32 .cse8))))))) (not (= .cse191 .cse3))))))) (.cse128 (or .cse18 (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse190 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse187 (select .cse190 .cse7))) (let ((.cse188 (let ((.cse189 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse190 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse187 v_ArrVal_3379))) (select .cse189 (select (select .cse189 .cse3) .cse4))))) (or (= .cse187 (select .cse188 (+ v_arrayElimCell_273 4))) (< v_arrayElimCell_273 0) (not (= .cse187 (select v_arrayElimArr_32 .cse8))) (not (= .cse187 .cse3)) (= .cse187 (select .cse188 (+ v_arrayElimCell_271 4)))))))))) (.cse69 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse186 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse184 (select .cse186 .cse7))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int) (v_ArrVal_3379 (Array Int Int))) (or (not (= .cse184 (select v_arrayElimArr_32 .cse8))) (< v_arrayElimCell_271 0) (= .cse184 (select (let ((.cse185 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse186 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse184 v_ArrVal_3379))) (select .cse185 (select (select .cse185 .cse3) .cse4))) (+ v_arrayElimCell_271 4))))) (= .cse184 .cse3)))))) (.cse82 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse183 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse180 (select .cse183 .cse7))) (or (= .cse180 .cse3) (forall ((v_arrayElimCell_271 Int) (v_arrayElimCell_273 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse181 (let ((.cse182 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse183 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse180 v_ArrVal_3379))) (select .cse182 (select (select .cse182 .cse3) .cse4))))) (or (= .cse180 (select .cse181 (+ v_arrayElimCell_273 4))) (= .cse180 (select .cse181 (+ v_arrayElimCell_271 4)))))) (not (= .cse180 (select v_arrayElimArr_32 .cse8))))) (< v_arrayElimCell_271 0)))))))) (.cse118 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse179 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse176 (select .cse179 .cse7))) (or (= .cse176 .cse3) (forall ((v_arrayElimCell_274 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int)) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse177 (let ((.cse178 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse179 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse176 v_ArrVal_3379))) (select .cse178 (select (select .cse178 .cse3) .cse4))))) (or (= .cse176 (select .cse177 (+ v_arrayElimCell_274 4))) (= .cse176 (select .cse177 (+ v_arrayElimCell_271 4)))))) (not (= .cse176 (select v_arrayElimArr_32 .cse8))))) (< v_arrayElimCell_274 0)))))))) (.cse119 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse175 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse173 (select .cse175 .cse7))) (or (forall ((v_arrayElimCell_274 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (or (not (= .cse173 (select v_arrayElimArr_32 .cse8))) (= .cse173 (select (let ((.cse174 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse175 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse173 v_ArrVal_3379))) (select .cse174 (select (select .cse174 .cse3) .cse4))) (+ v_arrayElimCell_274 4))))))) (= .cse173 .cse3)))))) (.cse11 (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse172 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse169 (select .cse172 .cse7))) (let ((.cse170 (let ((.cse171 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse172 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse169 v_ArrVal_3379))) (select .cse171 (select (select .cse171 .cse3) .cse4))))) (or (< v_arrayElimCell_274 0) (= .cse169 (select .cse170 (+ v_arrayElimCell_273 4))) (not (= .cse169 (select v_arrayElimArr_32 .cse8))) (= .cse169 .cse3) (= .cse169 (select .cse170 (+ v_arrayElimCell_274 4)))))))) .cse23)) (.cse105 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse168 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse165 (select .cse168 .cse7))) (or (forall ((v_arrayElimCell_274 Int)) (or (forall ((v_arrayElimCell_271 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse166 (let ((.cse167 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse168 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse165 v_ArrVal_3379))) (select .cse167 (select (select .cse167 .cse3) .cse4))))) (or (= .cse165 (select .cse166 (+ v_arrayElimCell_274 4))) (= .cse165 (select .cse166 (+ v_arrayElimCell_271 4)))))) (not (= .cse165 (select v_arrayElimArr_32 .cse8))))) (< v_arrayElimCell_271 0))) (< v_arrayElimCell_274 0))) (= .cse165 .cse3)))))) (.cse16 (or .cse23 (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse164 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse162 (select .cse164 .cse7))) (or (< v_arrayElimCell_274 0) (not (= .cse162 (select v_arrayElimArr_32 .cse8))) (= .cse162 .cse3) (= .cse162 (select (let ((.cse163 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse164 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse162 v_ArrVal_3379))) (select .cse163 (select (select .cse163 .cse3) .cse4))) (+ v_arrayElimCell_274 4)))))))))) (let ((.cse10 (= .cse3 .cse5)) (.cse19 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse161 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse158 (select .cse161 .cse7))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_273 Int)) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse159 (let ((.cse160 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse161 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse158 v_ArrVal_3379))) (select .cse160 (select (select .cse160 .cse3) .cse4))))) (or (= .cse158 (select .cse159 .cse8)) (= .cse158 (select .cse159 (+ v_arrayElimCell_273 4)))))) (not (= .cse158 (select v_arrayElimArr_32 .cse8))))) (= .cse158 .cse3)))))) (.cse24 (and (or .cse18 (and .cse69 .cse82)) (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse149 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse146 (select .cse149 .cse7))) (or (forall ((v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimCell_271 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse147 (let ((.cse148 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse149 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse146 v_ArrVal_3379))) (select .cse148 (select (select .cse148 .cse3) .cse4))))) (or (= .cse146 (select .cse147 (+ v_arrayElimCell_273 4))) (= .cse146 (select .cse147 (+ v_arrayElimCell_274 4))) (= .cse146 (select .cse147 (+ v_arrayElimCell_271 4)))))) (not (= .cse146 (select v_arrayElimArr_32 .cse8))))) (< v_arrayElimCell_271 0))))) (= .cse146 .cse3))))) (or (and .cse118 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse153 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse150 (select .cse153 .cse7))) (or (forall ((v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int)) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse151 (let ((.cse152 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse153 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse150 v_ArrVal_3379))) (select .cse152 (select (select .cse152 .cse3) .cse4))))) (or (= .cse150 (select .cse151 (+ v_arrayElimCell_273 4))) (= .cse150 (select .cse151 (+ v_arrayElimCell_274 4))) (= .cse150 (select .cse151 (+ v_arrayElimCell_271 4)))))) (not (= .cse150 (select v_arrayElimArr_32 .cse8))))))) (= .cse150 .cse3))))) .cse119 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse157 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse154 (select .cse157 .cse7))) (or (forall ((v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (let ((.cse155 (let ((.cse156 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse157 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse154 v_ArrVal_3379))) (select .cse156 (select (select .cse156 .cse3) .cse4))))) (or (= .cse154 (select .cse155 (+ v_arrayElimCell_273 4))) (not (= .cse154 (select v_arrayElimArr_32 .cse8))) (= .cse154 (select .cse155 (+ v_arrayElimCell_274 4)))))))) (= .cse154 .cse3)))))) .cse23) .cse11 .cse105 .cse16)) (.cse22 (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse145 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse142 (select .cse145 .cse7))) (let ((.cse143 (let ((.cse144 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse145 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse142 v_ArrVal_3379))) (select .cse144 (select (select .cse144 .cse3) .cse4))))) (or (< v_arrayElimCell_274 0) (= .cse142 (select .cse143 .cse8)) (= .cse142 (select .cse143 (+ v_arrayElimCell_273 4))) (< v_arrayElimCell_273 0) (not (= .cse142 (select v_arrayElimArr_32 .cse8))) (= .cse142 (select .cse143 (+ v_arrayElimCell_274 4))))))))) (.cse17 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse141 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse138 (select .cse141 .cse7))) (or (forall ((v_arrayElimCell_274 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse139 (let ((.cse140 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse141 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse138 v_ArrVal_3379))) (select .cse140 (select (select .cse140 .cse3) .cse4))))) (or (= .cse138 (select .cse139 .cse8)) (= .cse138 (select .cse139 (+ v_arrayElimCell_274 4)))))) (not (= .cse138 (select v_arrayElimArr_32 .cse8))))))) (= .cse138 .cse3)))))) (.cse21 (and .cse23 (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 1) 0))) (.cse9 (and .cse67 (or .cse18 (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse133 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse130 (select .cse133 .cse7))) (let ((.cse131 (let ((.cse132 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse133 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse130 v_ArrVal_3379))) (select .cse132 (select (select .cse132 .cse3) .cse4))))) (or (= .cse130 (select .cse131 (+ v_arrayElimCell_273 4))) (< v_arrayElimCell_273 0) (not (= .cse130 (select v_arrayElimArr_32 .cse8))) (< v_arrayElimCell_271 0) (not (= .cse130 .cse3)) (= .cse130 (select .cse131 (+ v_arrayElimCell_271 4))))))))) .cse128 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse137 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse134 (select .cse137 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (forall ((v_arrayElimCell_271 Int) (v_arrayElimCell_274 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse135 (let ((.cse136 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse137 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse134 v_ArrVal_3379))) (select .cse136 (select (select .cse136 .cse3) .cse4))))) (or (= .cse134 (select .cse135 (+ v_arrayElimCell_273 4))) (= .cse134 (select .cse135 (+ v_arrayElimCell_274 4))) (= .cse134 (select .cse135 (+ v_arrayElimCell_271 4)))))) (not (= .cse134 (select v_arrayElimArr_32 .cse8))))) (< v_arrayElimCell_271 0))) (< v_arrayElimCell_273 0))) (not (= .cse134 .cse3)))))))) (.cse51 (= .cse0 .cse129)) (.cse41 (and .cse105 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse109 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse106 (select .cse109 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimCell_274 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int)) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse107 (let ((.cse108 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse109 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse106 v_ArrVal_3379))) (select .cse108 (select (select .cse108 .cse3) .cse4))))) (or (= .cse106 (select .cse107 (+ v_arrayElimCell_273 4))) (= .cse106 (select .cse107 (+ v_arrayElimCell_274 4))) (= .cse106 (select .cse107 (+ v_arrayElimCell_271 4)))))) (not (= .cse106 (select v_arrayElimArr_32 .cse8))))))))) (not (= .cse106 .cse3)))))) (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse113 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse110 (select .cse113 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (forall ((v_arrayElimCell_274 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (let ((.cse111 (let ((.cse112 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse113 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse110 v_ArrVal_3379))) (select .cse112 (select (select .cse112 .cse3) .cse4))))) (or (= .cse110 (select .cse111 (+ v_arrayElimCell_273 4))) (not (= .cse110 (select v_arrayElimArr_32 .cse8))) (= .cse110 (select .cse111 (+ v_arrayElimCell_274 4)))))))) (< v_arrayElimCell_273 0))) (not (= .cse110 .cse3)))))) .cse16 (forall ((v_arrayElimCell_273 Int) (v_ArrVal_3370 (Array Int Int))) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimCell_274 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimCell_271 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse117 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse114 (select .cse117 .cse7))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse115 (let ((.cse116 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse117 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse114 v_ArrVal_3379))) (select .cse116 (select (select .cse116 .cse3) .cse4))))) (or (= .cse114 (select .cse115 (+ v_arrayElimCell_273 4))) (= .cse114 (select .cse115 (+ v_arrayElimCell_274 4))) (= .cse114 (select .cse115 (+ v_arrayElimCell_271 4)))))) (not (= .cse114 (select v_arrayElimArr_32 .cse8))))))) (< v_arrayElimCell_271 0))))))) (or (and .cse118 .cse119 (forall ((v_arrayElimCell_273 Int) (v_ArrVal_3370 (Array Int Int))) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimCell_274 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int)) (let ((.cse123 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse120 (select .cse123 .cse7))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse121 (let ((.cse122 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse123 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse120 v_ArrVal_3379))) (select .cse122 (select (select .cse122 .cse3) .cse4))))) (or (= .cse120 (select .cse121 (+ v_arrayElimCell_273 4))) (= .cse120 (select .cse121 (+ v_arrayElimCell_274 4))) (= .cse120 (select .cse121 (+ v_arrayElimCell_271 4)))))) (not (= .cse120 (select v_arrayElimArr_32 .cse8))))))))))) (forall ((v_arrayElimCell_273 Int) (v_ArrVal_3370 (Array Int Int))) (or (forall ((v_arrayElimCell_274 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (let ((.cse127 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse124 (select .cse127 .cse7))) (let ((.cse125 (let ((.cse126 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse127 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse124 v_ArrVal_3379))) (select .cse126 (select (select .cse126 .cse3) .cse4))))) (or (= .cse124 (select .cse125 (+ v_arrayElimCell_273 4))) (not (= .cse124 (select v_arrayElimArr_32 .cse8))) (= .cse124 (select .cse125 (+ v_arrayElimCell_274 4)))))))))) (< v_arrayElimCell_273 0)))) .cse23) .cse128 (or .cse18 (and .cse68 .cse69)))) (.cse50 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse104 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse101 (select .cse104 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse102 (let ((.cse103 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse104 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse101 v_ArrVal_3379))) (select .cse103 (select (select .cse103 .cse3) .cse4))))) (or (= .cse101 (select .cse102 .cse8)) (= .cse101 (select .cse102 (+ v_arrayElimCell_273 4)))))) (not (= .cse101 (select v_arrayElimArr_32 .cse8))))))) (not (= .cse101 .cse3))))))) (.cse53 (< |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse58 (forall ((v_arrayElimCell_273 Int) (v_ArrVal_3370 (Array Int Int))) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse100 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse97 (select .cse100 .cse7))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse98 (let ((.cse99 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse100 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse97 v_ArrVal_3379))) (select .cse99 (select (select .cse99 .cse3) .cse4))))) (or (= .cse97 (select .cse98 .cse8)) (= .cse97 (select .cse98 (+ v_arrayElimCell_273 4)))))) (not (= .cse97 (select v_arrayElimArr_32 .cse8)))))))))) (.cse20 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse96 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse94 (select .cse96 .cse7))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (or (= .cse94 (select (let ((.cse95 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse96 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse94 v_ArrVal_3379))) (select .cse95 (select (select .cse95 .cse3) .cse4))) .cse8)) (not (= .cse94 (select v_arrayElimArr_32 .cse8))))) (= .cse94 .cse3))))))) (and (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse1 (select .cse6 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (or (= .cse1 (select (let ((.cse2 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse6 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse1 v_ArrVal_3379))) (select .cse2 (select (select .cse2 .cse3) .cse4))) (+ v_arrayElimCell_273 4))) (not (= .cse1 (select v_arrayElimArr_32 .cse8))))))) (not (= .cse1 .cse3)))))) (or .cse9 .cse10) (or (and .cse11 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse12 (select .cse15 .cse7))) (or (forall ((v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse15 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse12 v_ArrVal_3379))) (select .cse14 (select (select .cse14 .cse3) .cse4))))) (or (= .cse12 (select .cse13 .cse8)) (= .cse12 (select .cse13 (+ v_arrayElimCell_273 4))) (= .cse12 (select .cse13 (+ v_arrayElimCell_274 4)))))) (not (= .cse12 (select v_arrayElimArr_32 .cse8))))) (< v_arrayElimCell_274 0))) (= .cse12 .cse3))))) .cse16 .cse17 (or .cse18 (and .cse19 .cse20))) .cse21) (or .cse22 .cse23) (or .cse24 .cse10) (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse25 (select .cse28 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int)) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse26 (let ((.cse27 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse28 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse25 v_ArrVal_3379))) (select .cse27 (select (select .cse27 .cse3) .cse4))))) (or (= .cse25 (select .cse26 .cse8)) (= .cse25 (select .cse26 (+ v_arrayElimCell_273 4))) (= .cse25 (select .cse26 (+ v_arrayElimCell_274 4)))))) (not (= .cse25 (select v_arrayElimArr_32 .cse8))))) (< v_arrayElimCell_273 0))) (not (= .cse25 .cse3)))))) (or .cse23 (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse29 (select .cse32 .cse7))) (let ((.cse30 (let ((.cse31 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse32 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse29 v_ArrVal_3379))) (select .cse31 (select (select .cse31 .cse3) .cse4))))) (or (< v_arrayElimCell_274 0) (= .cse29 (select .cse30 (+ v_arrayElimCell_273 4))) (< v_arrayElimCell_273 0) (not (= .cse29 (select v_arrayElimArr_32 .cse8))) (= .cse29 (select .cse30 (+ v_arrayElimCell_274 4))))))))) (forall ((v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimCell_274 Int)) (or (< v_arrayElimCell_274 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse33 (select .cse36 .cse7))) (let ((.cse34 (let ((.cse35 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse36 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse33 v_ArrVal_3379))) (select .cse35 (select (select .cse35 .cse3) .cse4))))) (or (= .cse33 (select .cse34 .cse8)) (= .cse33 (select .cse34 (+ v_arrayElimCell_273 4))) (not (= .cse33 (select v_arrayElimArr_32 .cse8))) (= .cse33 (select .cse34 (+ v_arrayElimCell_274 4))) (not (= .cse33 .cse3))))))))))) (or .cse18 (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse37 (select .cse40 .cse7))) (let ((.cse38 (let ((.cse39 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse40 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse37 v_ArrVal_3379))) (select .cse39 (select (select .cse39 .cse3) .cse4))))) (or (= .cse37 (select .cse38 .cse8)) (= .cse37 (select .cse38 (+ v_arrayElimCell_273 4))) (< v_arrayElimCell_273 0) (not (= .cse37 (select v_arrayElimArr_32 .cse8))) (not (= .cse37 .cse3)))))))) (or .cse41 .cse10) (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse42 (select .cse45 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_ArrVal_3379 (Array Int Int))) (let ((.cse43 (let ((.cse44 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse45 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse42 v_ArrVal_3379))) (select .cse44 (select (select .cse44 .cse3) .cse4))))) (or (= .cse42 (select .cse43 (+ v_arrayElimCell_273 4))) (not (= .cse42 (select v_arrayElimArr_32 .cse8))) (= .cse42 (select .cse43 (+ v_arrayElimCell_274 4)))))))) (not (= .cse42 .cse3)))))) (or (let ((.cse52 (and .cse67 .cse68 .cse69 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse73 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse70 (select .cse73 .cse7))) (or (forall ((v_arrayElimCell_273 Int)) (or (< v_arrayElimCell_273 0) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int) (v_ArrVal_3379 (Array Int Int))) (let ((.cse71 (let ((.cse72 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse73 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse70 v_ArrVal_3379))) (select .cse72 (select (select .cse72 .cse3) .cse4))))) (or (= .cse70 (select .cse71 (+ v_arrayElimCell_273 4))) (not (= .cse70 (select v_arrayElimArr_32 .cse8))) (= .cse70 (select .cse71 (+ v_arrayElimCell_271 4)))))))) (not (= .cse70 .cse3)))))) (forall ((v_arrayElimCell_273 Int) (v_ArrVal_3370 (Array Int Int))) (or (forall ((v_arrayElimCell_271 Int) (v_arrayElimCell_274 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (let ((.cse77 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse74 (select .cse77 .cse7))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse75 (let ((.cse76 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse77 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse74 v_ArrVal_3379))) (select .cse76 (select (select .cse76 .cse3) .cse4))))) (or (= .cse74 (select .cse75 (+ v_arrayElimCell_273 4))) (= .cse74 (select .cse75 (+ v_arrayElimCell_274 4))) (= .cse74 (select .cse75 (+ v_arrayElimCell_271 4)))))) (not (= .cse74 (select v_arrayElimArr_32 .cse8))))))) (< v_arrayElimCell_271 0))) (< v_arrayElimCell_273 0))) (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse81 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse78 (select .cse81 .cse7))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_271 Int) (v_arrayElimCell_274 Int) (v_ArrVal_3379 (Array Int Int))) (let ((.cse79 (let ((.cse80 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse81 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse78 v_ArrVal_3379))) (select .cse80 (select (select .cse80 .cse3) .cse4))))) (or (not (= .cse78 (select v_arrayElimArr_32 .cse8))) (= .cse78 (select .cse79 (+ v_arrayElimCell_274 4))) (< v_arrayElimCell_271 0) (= .cse78 (select .cse79 (+ v_arrayElimCell_271 4)))))) (= .cse78 .cse3))))) .cse82 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse86 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse83 (select .cse86 .cse7))) (or (forall ((v_arrayElimCell_271 Int) (v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int)) (or (forall ((v_arrayElimArr_32 (Array Int Int))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse84 (let ((.cse85 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse86 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse83 v_ArrVal_3379))) (select .cse85 (select (select .cse85 .cse3) .cse4))))) (or (= .cse83 (select .cse84 (+ v_arrayElimCell_273 4))) (= .cse83 (select .cse84 (+ v_arrayElimCell_274 4))) (= .cse83 (select .cse84 (+ v_arrayElimCell_271 4)))))) (not (= .cse83 (select v_arrayElimArr_32 .cse8))))) (< v_arrayElimCell_271 0))) (= .cse83 .cse3)))))))) (and (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse46 (select .cse49 .cse7))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int))) (let ((.cse47 (let ((.cse48 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse49 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse46 v_ArrVal_3379))) (select .cse48 (select (select .cse48 .cse3) .cse4))))) (or (= .cse46 (select .cse47 (+ v_arrayElimCell_273 4))) (< v_arrayElimCell_273 0) (not (= .cse46 (select v_arrayElimArr_32 .cse8))) (= .cse46 (select .cse47 (+ v_arrayElimCell_274 4)))))) (not (= .cse46 .cse3)))))) .cse50 (or .cse51 .cse52) (or .cse10 .cse52) (or .cse53 (and .cse19 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse57 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse54 (select .cse57 .cse7))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int)) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse55 (let ((.cse56 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse57 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse54 v_ArrVal_3379))) (select .cse56 (select (select .cse56 .cse3) .cse4))))) (or (= .cse54 (select .cse55 .cse8)) (= .cse54 (select .cse55 (+ v_arrayElimCell_273 4))) (= .cse54 (select .cse55 (+ v_arrayElimCell_274 4)))))) (not (= .cse54 (select v_arrayElimArr_32 .cse8))))) (= .cse54 .cse3))))) .cse58 .cse20 (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse62 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse59 (select .cse62 .cse7))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_ArrVal_3379 (Array Int Int))) (let ((.cse60 (let ((.cse61 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse62 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse59 v_ArrVal_3379))) (select .cse61 (select (select .cse61 .cse3) .cse4))))) (or (= .cse59 (select .cse60 .cse8)) (not (= .cse59 (select v_arrayElimArr_32 .cse8))) (= .cse59 (select .cse60 (+ v_arrayElimCell_274 4)))))) (= .cse59 .cse3))))) (forall ((v_arrayElimCell_273 Int) (v_ArrVal_3370 (Array Int Int))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int)) (let ((.cse66 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse63 (select .cse66 .cse7))) (or (forall ((v_ArrVal_3379 (Array Int Int))) (let ((.cse64 (let ((.cse65 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse66 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse63 v_ArrVal_3379))) (select .cse65 (select (select .cse65 .cse3) .cse4))))) (or (= .cse63 (select .cse64 .cse8)) (= .cse63 (select .cse64 (+ v_arrayElimCell_273 4))) (= .cse63 (select .cse64 (+ v_arrayElimCell_274 4)))))) (not (= .cse63 (select v_arrayElimArr_32 .cse8))))))) (< v_arrayElimCell_273 0))))))) .cse18) (or .cse51 .cse24) (or .cse22 .cse53) (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse89 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse87 (select .cse89 .cse7))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int))) (or (= .cse87 (select (let ((.cse88 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse89 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse87 v_ArrVal_3379))) (select .cse88 (select (select .cse88 .cse3) .cse4))) (+ v_arrayElimCell_273 4))) (< v_arrayElimCell_273 0) (not (= .cse87 (select v_arrayElimArr_32 .cse8))))) (not (= .cse87 .cse3)))))) (or (and .cse16 .cse17) .cse21) (forall ((v_ArrVal_3370 (Array Int Int))) (let ((.cse93 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3370) .cse5))) (let ((.cse90 (select .cse93 .cse7))) (or (not (= .cse90 .cse3)) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_274 Int) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int))) (let ((.cse91 (let ((.cse92 (store (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse93 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_32) .cse90 v_ArrVal_3379))) (select .cse92 (select (select .cse92 .cse3) .cse4))))) (or (< v_arrayElimCell_274 0) (= .cse90 (select .cse91 (+ v_arrayElimCell_273 4))) (< v_arrayElimCell_273 0) (not (= .cse90 (select v_arrayElimArr_32 .cse8))) (= .cse90 (select .cse91 (+ v_arrayElimCell_274 4)))))))))) (or .cse51 .cse9) (or .cse51 .cse41) (or .cse18 (and .cse50 (or .cse53 (and .cse58 .cse20)))))))))))) is different from true [2023-11-29 05:22:48,733 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 8311 treesize of output 6343 [2023-11-29 05:22:48,778 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 6353 treesize of output 4909 [2023-11-29 05:22:50,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 89 treesize of output 61 [2023-11-29 05:22:50,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 96 treesize of output 64 [2023-11-29 05:22:50,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 37 [2023-11-29 05:22:55,492 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse53 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)))) (and (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_572 Int) (v_prenex_570 (Array Int Int)) (v_prenex_571 Int) (v_prenex_573 (Array Int Int)) (v_prenex_574 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_574) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (+ v_arrayElimCell_276 4))) (let ((.cse1 (select .cse4 .cse3))) (let ((.cse0 (let ((.cse2 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_570) .cse1 v_prenex_573))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))))) (or (< v_prenex_571 0) (= (select .cse0 (+ v_prenex_571 4)) .cse1) (< v_prenex_572 0) (not (= (select v_prenex_570 4) .cse1)) (= (select .cse0 (+ v_prenex_572 4)) .cse1) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse1 (select .cse0 4))))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_518 (Array Int Int)) (v_prenex_520 (Array Int Int)) (v_prenex_519 Int) (v_prenex_521 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_521) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (+ v_arrayElimCell_276 4))) (let ((.cse5 (select .cse9 .cse8))) (let ((.cse6 (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse8 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_518) .cse5 v_prenex_520))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8))))) (or (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse5 (select .cse6 4)) (not (= .cse5 (select v_prenex_518 4))) (= .cse5 (select .cse6 (+ v_prenex_519 4)))))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_533 Int) (v_prenex_532 (Array Int Int)) (v_prenex_534 (Array Int Int)) (v_prenex_535 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_535) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse13 (+ v_arrayElimCell_276 4))) (let ((.cse10 (select .cse14 .cse13))) (let ((.cse11 (let ((.cse12 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse14 .cse13 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_532) .cse10 v_prenex_534))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse13))))) (or (= .cse10 (select .cse11 4)) (= .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse10 (select .cse11 (+ v_prenex_533 4))) (not (= .cse10 (select v_prenex_532 4)))))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_527 (Array Int Int)) (v_prenex_529 Int) (v_prenex_530 (Array Int Int)) (v_prenex_531 (Array Int Int)) (v_prenex_528 Int)) (let ((.cse19 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_531) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse18 (+ v_arrayElimCell_276 4))) (let ((.cse15 (select .cse19 .cse18))) (let ((.cse16 (let ((.cse17 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse19 .cse18 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_527) .cse15 v_prenex_530))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse18))))) (or (= .cse15 (select .cse16 (+ v_prenex_529 4))) (= .cse15 (select .cse16 (+ v_prenex_528 4))) (not (= .cse15 (select v_prenex_527 4))) (= (select .cse16 4) .cse15) (= .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_536 (Array Int Int)) (v_prenex_537 (Array Int Int)) (v_prenex_538 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_538) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse22 (+ v_arrayElimCell_276 4))) (let ((.cse20 (select .cse23 .cse22))) (or (= .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (let ((.cse21 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse23 .cse22 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_536) .cse20 v_prenex_537))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22))) 4) .cse20) (not (= (select v_prenex_536 4) .cse20)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_578 Int) (v_prenex_511 Int) (v_prenex_510 (Array Int Int)) (v_prenex_512 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_513) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse27 (+ v_arrayElimCell_276 4))) (let ((.cse25 (select .cse28 .cse27))) (let ((.cse24 (let ((.cse26 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse28 .cse27 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_510) .cse25 v_prenex_512))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse27))))) (or (< v_prenex_511 0) (= (select .cse24 (+ v_prenex_511 4)) .cse25) (not (= (select v_prenex_510 4) .cse25)) (= .cse25 (select .cse24 4)) (= (select .cse24 (+ v_prenex_578 4)) .cse25)))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_580 (Array Int Int)) (v_prenex_581 Int) (v_prenex_583 (Array Int Int)) (v_prenex_582 Int) (v_prenex_584 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_584) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse32 (+ v_arrayElimCell_276 4))) (let ((.cse30 (select .cse33 .cse32))) (let ((.cse29 (let ((.cse31 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse33 .cse32 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_580) .cse30 v_prenex_583))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse32))))) (or (= (select .cse29 (+ v_prenex_582 4)) .cse30) (= .cse30 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse29 (+ v_prenex_581 4)) .cse30) (< v_prenex_581 0) (not (= .cse30 (select v_prenex_580 4))) (= (select .cse29 4) .cse30)))))))))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (forall ((v_prenex_552 Int) (v_prenex_553 Int) (v_prenex_551 (Array Int Int)) (v_prenex_554 (Array Int Int)) (v_prenex_555 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_555) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse37 (+ v_arrayElimCell_276 4))) (let ((.cse35 (select .cse38 .cse37))) (let ((.cse34 (let ((.cse36 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse38 .cse37 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_551) .cse35 v_prenex_554))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse37))))) (or (= (select .cse34 (+ v_prenex_553 4)) .cse35) (not (= .cse35 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select v_prenex_551 4) .cse35)) (< v_prenex_553 0) (= (select .cse34 (+ v_prenex_552 4)) .cse35)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)))))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_599 Int) (v_prenex_598 (Array Int Int)) (v_prenex_600 (Array Int Int)) (v_prenex_601 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_601) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse42 (+ v_arrayElimCell_276 4))) (let ((.cse39 (select .cse43 .cse42))) (let ((.cse40 (let ((.cse41 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse43 .cse42 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_598) .cse39 v_prenex_600))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse42))))) (or (not (= .cse39 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse39 (select .cse40 (+ v_prenex_599 4))) (= .cse39 (select .cse40 4)) (< v_prenex_599 0) (not (= .cse39 (select v_prenex_598 4)))))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_514 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_517 (Array Int Int)) (v_prenex_515 Int)) (let ((.cse48 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_517) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse47 (+ v_arrayElimCell_276 4))) (let ((.cse44 (select .cse48 .cse47))) (let ((.cse45 (let ((.cse46 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse48 .cse47 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_514) .cse44 v_prenex_516))) (select .cse46 (select (select .cse46 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse47))))) (or (not (= .cse44 (select v_prenex_514 4))) (= .cse44 (select .cse45 4)) (< v_prenex_515 0) (= .cse44 (select .cse45 (+ v_prenex_515 4)))))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_507 (Array Int Int)) (v_prenex_508 (Array Int Int)) (v_prenex_509 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_509) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse51 (+ v_arrayElimCell_276 4))) (let ((.cse49 (select .cse52 .cse51))) (or (= .cse49 (select (let ((.cse50 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse52 .cse51 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_507) .cse49 v_prenex_508))) (select .cse50 (select (select .cse50 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse51))) 4)) (= .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse49 (select v_prenex_507 4))))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (or .cse53 (forall ((v_prenex_591 (Array Int Int)) (v_arrayElimCell_276 Int) (v_prenex_590 Int) (v_prenex_589 (Array Int Int))) (let ((.cse54 (select v_prenex_589 4))) (or (= .cse54 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< v_prenex_590 0) (< v_arrayElimCell_276 0) (= .cse54 (select (let ((.cse55 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_589) .cse54 v_prenex_591))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_276 4)))) (+ v_prenex_590 4))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_525 (Array Int Int)) (v_prenex_523 Int) (v_prenex_526 (Array Int Int)) (v_prenex_524 Int) (v_prenex_522 (Array Int Int))) (let ((.cse60 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_526) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse59 (+ v_arrayElimCell_276 4))) (let ((.cse56 (select .cse60 .cse59))) (let ((.cse57 (let ((.cse58 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse60 .cse59 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_522) .cse56 v_prenex_525))) (select .cse58 (select (select .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse59))))) (or (not (= (select v_prenex_522 4) .cse56)) (< v_prenex_524 0) (= (select .cse57 (+ v_prenex_523 4)) .cse56) (= (select .cse57 (+ v_prenex_524 4)) .cse56) (not (= .cse56 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_586 Int) (v_prenex_585 (Array Int Int)) (v_prenex_587 (Array Int Int)) (v_prenex_588 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_588) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse63 (+ v_arrayElimCell_276 4))) (let ((.cse61 (select .cse64 .cse63))) (or (not (= .cse61 (select v_prenex_585 4))) (not (= .cse61 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< v_prenex_586 0) (= (select (let ((.cse62 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse64 .cse63 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_585) .cse61 v_prenex_587))) (select .cse62 (select (select .cse62 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse63))) (+ v_prenex_586 4)) .cse61))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_arrayElimCell_273 Int) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3370 (Array Int Int))) (let ((.cse69 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_ArrVal_3370) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse68 (+ v_arrayElimCell_276 4))) (let ((.cse65 (select .cse69 .cse68))) (let ((.cse66 (let ((.cse67 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse69 .cse68 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_arrayElimArr_32) .cse65 v_ArrVal_3379))) (select .cse67 (select (select .cse67 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse68))))) (or (not (= .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse65 (select .cse66 (+ v_arrayElimCell_273 4))) (= .cse65 (select .cse66 4)) (< v_arrayElimCell_273 0) (not (= .cse65 (select v_arrayElimArr_32 4)))))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_503 (Array Int Int)) (v_prenex_501 Int) (v_prenex_500 (Array Int Int)) (v_prenex_502 (Array Int Int))) (let ((.cse74 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_503) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse73 (+ v_arrayElimCell_276 4))) (let ((.cse70 (select .cse74 .cse73))) (let ((.cse71 (let ((.cse72 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse74 .cse73 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_500) .cse70 v_prenex_502))) (select .cse72 (select (select .cse72 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse73))))) (or (= .cse70 (select .cse71 (+ v_prenex_501 4))) (= .cse70 (select .cse71 4)) (< v_prenex_501 0) (not (= .cse70 (select v_prenex_500 4)))))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (forall ((v_prenex_594 Int) (v_prenex_593 (Array Int Int)) (v_prenex_595 Int) (v_prenex_596 (Array Int Int)) (v_prenex_597 (Array Int Int))) (let ((.cse79 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_597) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse78 (+ v_arrayElimCell_276 4))) (let ((.cse75 (select .cse79 .cse78))) (let ((.cse76 (let ((.cse77 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse79 .cse78 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_593) .cse75 v_prenex_596))) (select .cse77 (select (select .cse77 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse78))))) (or (< v_prenex_594 0) (not (= .cse75 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse75 (select .cse76 (+ v_prenex_595 4))) (= (select .cse76 (+ v_prenex_594 4)) .cse75) (< v_prenex_595 0) (not (= (select v_prenex_593 4) .cse75))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (or (forall ((v_prenex_567 Int) (v_prenex_566 Int) (v_arrayElimCell_276 Int) (v_prenex_565 (Array Int Int)) (v_prenex_568 (Array Int Int))) (let ((.cse80 (select v_prenex_565 4))) (let ((.cse81 (let ((.cse82 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_565) .cse80 v_prenex_568))) (select .cse82 (select (select .cse82 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_276 4)))))) (or (< v_prenex_566 0) (< v_arrayElimCell_276 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse80) (= (select .cse81 (+ v_prenex_567 4)) .cse80) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276) (= (select .cse81 (+ v_prenex_566 4)) .cse80))))) .cse53) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_602 (Array Int Int)) (v_prenex_605 (Array Int Int)) (v_prenex_606 (Array Int Int)) (v_prenex_604 Int) (v_prenex_603 Int)) (let ((.cse87 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_606) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse86 (+ v_arrayElimCell_276 4))) (let ((.cse84 (select .cse87 .cse86))) (let ((.cse83 (let ((.cse85 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse87 .cse86 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_602) .cse84 v_prenex_605))) (select .cse85 (select (select .cse85 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse86))))) (or (= (select .cse83 (+ v_prenex_603 4)) .cse84) (not (= .cse84 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< v_prenex_604 0) (= (select .cse83 (+ v_prenex_604 4)) .cse84) (not (= (select v_prenex_602 4) .cse84)) (= (select .cse83 4) .cse84)))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_562 Int) (v_prenex_561 (Array Int Int)) (v_prenex_563 (Array Int Int)) (v_prenex_564 (Array Int Int))) (let ((.cse92 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_564) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse91 (+ v_arrayElimCell_276 4))) (let ((.cse88 (select .cse92 .cse91))) (let ((.cse89 (let ((.cse90 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse92 .cse91 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_561) .cse88 v_prenex_563))) (select .cse90 (select (select .cse90 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse91))))) (or (not (= (select v_prenex_561 4) .cse88)) (= .cse88 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse89 4) .cse88) (= .cse88 (select .cse89 (+ v_prenex_562 4)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_543 Int) (v_prenex_542 (Array Int Int)) (v_prenex_544 (Array Int Int)) (v_prenex_545 (Array Int Int))) (let ((.cse96 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_545) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse95 (+ v_arrayElimCell_276 4))) (let ((.cse93 (select .cse96 .cse95))) (or (not (= .cse93 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse93 (select v_prenex_542 4))) (= .cse93 (select (let ((.cse94 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse96 .cse95 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_542) .cse93 v_prenex_544))) (select .cse94 (select (select .cse94 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse95))) (+ v_prenex_543 4))) (< v_prenex_543 0))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_579 Int) (v_prenex_575 (Array Int Int)) (v_prenex_576 (Array Int Int)) (v_prenex_577 (Array Int Int))) (let ((.cse101 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_575) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse100 (+ v_arrayElimCell_276 4))) (let ((.cse97 (select .cse101 .cse100))) (let ((.cse98 (let ((.cse99 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse101 .cse100 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_577) .cse97 v_prenex_576))) (select .cse99 (select (select .cse99 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse100))))) (or (not (= .cse97 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse98 (+ v_prenex_579 4)) .cse97) (= (select .cse98 4) .cse97) (not (= .cse97 (select v_prenex_577 4))) (< v_prenex_579 0)))))))))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (forall ((v_prenex_539 (Array Int Int)) (v_arrayElimCell_274 Int) (v_prenex_540 (Array Int Int)) (v_prenex_541 (Array Int Int))) (let ((.cse106 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_541) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse105 (+ v_arrayElimCell_276 4))) (let ((.cse103 (select .cse106 .cse105))) (let ((.cse102 (let ((.cse104 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse106 .cse105 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_539) .cse103 v_prenex_540))) (select .cse104 (select (select .cse104 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse105))))) (or (= (select .cse102 4) .cse103) (< v_arrayElimCell_274 0) (= .cse103 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse103 (select .cse102 (+ v_arrayElimCell_274 4))) (not (= (select v_prenex_539 4) .cse103))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (< v_arrayElimCell_276 0) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_549 (Array Int Int)) (v_prenex_550 (Array Int Int)) (v_prenex_547 Int) (v_prenex_546 (Array Int Int)) (v_prenex_548 Int)) (let ((.cse111 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_550) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse110 (+ v_arrayElimCell_276 4))) (let ((.cse108 (select .cse111 .cse110))) (let ((.cse107 (let ((.cse109 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse111 .cse110 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_546) .cse108 v_prenex_549))) (select .cse109 (select (select .cse109 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse110))))) (or (= (select .cse107 (+ v_prenex_547 4)) .cse108) (< v_prenex_547 0) (not (= (select v_prenex_546 4) .cse108)) (= (select .cse107 (+ v_prenex_548 4)) .cse108) (< v_prenex_548 0) (= (select .cse107 4) .cse108)))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (forall ((v_arrayElimCell_276 Int)) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_42| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) 0)) (forall ((v_prenex_504 (Array Int Int)) (v_prenex_505 (Array Int Int)) (v_prenex_506 (Array Int Int))) (let ((.cse115 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_506) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse114 (+ v_arrayElimCell_276 4))) (let ((.cse112 (select .cse115 .cse114))) (or (not (= .cse112 (select v_prenex_504 4))) (= .cse112 (select (let ((.cse113 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse115 .cse114 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_prenex_504) .cse112 v_prenex_505))) (select .cse113 (select (select .cse113 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse114))) 4)) (= .cse112 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (< v_arrayElimCell_276 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276))) (or (forall ((v_prenex_559 (Array Int Int)) (v_prenex_557 Int) (v_arrayElimCell_276 Int) (v_prenex_558 Int) (v_prenex_556 (Array Int Int))) (let ((.cse117 (select v_prenex_556 4))) (let ((.cse116 (let ((.cse118 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_556) .cse117 v_prenex_559))) (select .cse118 (select (select .cse118 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_276 4)))))) (or (= (select .cse116 (+ v_prenex_557 4)) .cse117) (< v_prenex_557 0) (< v_arrayElimCell_276 0) (< v_prenex_558 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_276) (= (select .cse116 (+ v_prenex_558 4)) .cse117))))) .cse53))) is different from true [2023-11-29 05:27:39,757 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:39,767 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:40,213 INFO L349 Elim1Store]: treesize reduction 307, result has 37.6 percent of original size [2023-11-29 05:27:40,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 318665 treesize of output 182411 [2023-11-29 05:27:40,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:40,611 INFO L349 Elim1Store]: treesize reduction 31, result has 74.8 percent of original size [2023-11-29 05:27:40,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 431 treesize of output 434 [2023-11-29 05:27:40,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:40,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 345 treesize of output 315 [2023-11-29 05:27:40,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 207 treesize of output 171 [2023-11-29 05:27:40,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:27:41,655 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:41,656 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:41,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:41,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 439 treesize of output 427 [2023-11-29 05:27:41,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:41,697 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 419 treesize of output 395 [2023-11-29 05:27:41,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:41,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 392 treesize of output 246 [2023-11-29 05:27:41,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:41,826 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 101 treesize of output 101 [2023-11-29 05:27:42,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:42,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:42,185 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:42,596 INFO L349 Elim1Store]: treesize reduction 307, result has 37.6 percent of original size [2023-11-29 05:27:42,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 95030 treesize of output 52892 [2023-11-29 05:27:42,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:42,972 INFO L349 Elim1Store]: treesize reduction 31, result has 74.8 percent of original size [2023-11-29 05:27:42,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1491 treesize of output 1296 [2023-11-29 05:27:43,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:43,125 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 885 treesize of output 841 [2023-11-29 05:27:43,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:43,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1165 treesize of output 1095 [2023-11-29 05:27:43,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 961 treesize of output 793 [2023-11-29 05:27:46,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:46,319 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:46,546 INFO L349 Elim1Store]: treesize reduction 174, result has 35.1 percent of original size [2023-11-29 05:27:46,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 821271 treesize of output 472870 [2023-11-29 05:27:47,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:47,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:47,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1658 treesize of output 1574 [2023-11-29 05:27:47,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:47,577 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 1565 treesize of output 1413 [2023-11-29 05:27:47,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:47,634 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 419 treesize of output 391 [2023-11-29 05:27:47,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:47,714 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 1358 treesize of output 1042 [2023-11-29 05:27:49,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:49,105 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 112 treesize of output 108 [2023-11-29 05:27:49,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:49,750 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 31 treesize of output 31 [2023-11-29 05:27:49,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:49,814 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:50,057 INFO L349 Elim1Store]: treesize reduction 152, result has 43.3 percent of original size [2023-11-29 05:27:50,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 234206 treesize of output 132355 [2023-11-29 05:27:50,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:50,321 INFO L349 Elim1Store]: treesize reduction 23, result has 70.1 percent of original size [2023-11-29 05:27:50,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 298 [2023-11-29 05:27:50,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:50,396 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 217 treesize of output 195 [2023-11-29 05:27:50,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 158 treesize of output 130 [2023-11-29 05:27:50,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:27:50,808 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:50,818 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:50,824 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:51,201 INFO L349 Elim1Store]: treesize reduction 337, result has 31.5 percent of original size [2023-11-29 05:27:51,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 40474 treesize of output 22962 [2023-11-29 05:27:51,528 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:51,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:51,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2598 treesize of output 2468 [2023-11-29 05:27:51,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:51,665 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 887 treesize of output 843 [2023-11-29 05:27:51,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:51,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2378 treesize of output 2154 [2023-11-29 05:27:52,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:52,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2148 treesize of output 1648 [2023-11-29 05:27:56,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:56,776 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 206 treesize of output 206 [2023-11-29 05:27:57,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:57,128 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 120 treesize of output 124 [2023-11-29 05:27:58,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:58,501 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 31 treesize of output 31 [2023-11-29 05:27:58,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:58,562 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:58,742 INFO L349 Elim1Store]: treesize reduction 174, result has 35.1 percent of original size [2023-11-29 05:27:58,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 28867 treesize of output 16338 [2023-11-29 05:27:58,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:27:59,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:59,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1932 treesize of output 1828 [2023-11-29 05:27:59,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:59,125 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 1819 treesize of output 1627 [2023-11-29 05:27:59,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:59,214 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 1604 treesize of output 1248 [2023-11-29 05:27:59,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:27:59,293 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 708 treesize of output 680 [2023-11-29 05:28:02,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:02,209 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 191 treesize of output 180 [2023-11-29 05:28:02,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:02,437 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 31 treesize of output 31 [2023-11-29 05:28:02,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:02,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:02,555 INFO L349 Elim1Store]: treesize reduction 35, result has 61.1 percent of original size [2023-11-29 05:28:02,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 7793 treesize of output 4343 [2023-11-29 05:28:02,583 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:02,647 INFO L349 Elim1Store]: treesize reduction 15, result has 61.5 percent of original size [2023-11-29 05:28:02,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 219 treesize of output 192 [2023-11-29 05:28:02,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 139 treesize of output 115 [2023-11-29 05:28:02,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:02,701 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 117 treesize of output 111 [2023-11-29 05:28:02,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:28:02,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:02,890 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:03,114 INFO L349 Elim1Store]: treesize reduction 152, result has 43.3 percent of original size [2023-11-29 05:28:03,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 115902 treesize of output 64539 [2023-11-29 05:28:03,320 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:03,451 INFO L349 Elim1Store]: treesize reduction 23, result has 70.1 percent of original size [2023-11-29 05:28:03,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 298 [2023-11-29 05:28:03,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:03,533 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 217 treesize of output 195 [2023-11-29 05:28:03,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 158 treesize of output 130 [2023-11-29 05:28:03,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:28:03,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:03,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:04,232 INFO L349 Elim1Store]: treesize reduction 174, result has 35.1 percent of original size [2023-11-29 05:28:04,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 836445 treesize of output 482884 [2023-11-29 05:28:05,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:05,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:05,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1734 treesize of output 1644 [2023-11-29 05:28:05,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:05,278 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 471 treesize of output 443 [2023-11-29 05:28:05,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:05,361 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 1548 treesize of output 1224 [2023-11-29 05:28:05,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:05,460 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 1263 treesize of output 1099 [2023-11-29 05:28:08,299 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 05:28:08,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:08,421 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 63 treesize of output 59 [2023-11-29 05:28:09,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:09,192 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 31 treesize of output 31 [2023-11-29 05:28:09,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:09,271 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:09,604 INFO L349 Elim1Store]: treesize reduction 152, result has 43.3 percent of original size [2023-11-29 05:28:09,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 457950 treesize of output 259818 [2023-11-29 05:28:16,346 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 776 DAG size of output: 383 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:28:16,583 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:16,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:16,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24294 treesize of output 23030 [2023-11-29 05:28:17,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:17,142 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 23001 treesize of output 20429 [2023-11-29 05:28:17,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:17,644 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 20448 treesize of output 16284 [2023-11-29 05:28:18,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:18,280 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 10478 treesize of output 9786 [2023-11-29 05:28:19,040 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:28:19,040 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 15 treesize of output 9 [2023-11-29 05:28:54,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:54,873 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 30 treesize of output 26 [2023-11-29 05:28:54,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:54,913 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 05:28:54,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:54,926 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:55,044 INFO L349 Elim1Store]: treesize reduction 79, result has 48.4 percent of original size [2023-11-29 05:28:55,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 7124 treesize of output 4045 [2023-11-29 05:28:55,104 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:55,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:55,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1051 treesize of output 1007 [2023-11-29 05:28:55,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:55,165 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 924 treesize of output 896 [2023-11-29 05:28:55,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:55,214 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 938 treesize of output 834 [2023-11-29 05:28:55,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:55,266 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 831 treesize of output 627 [2023-11-29 05:28:55,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-29 05:28:56,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:56,599 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 56 treesize of output 52 [2023-11-29 05:28:56,650 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:56,656 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:56,660 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:56,873 INFO L349 Elim1Store]: treesize reduction 152, result has 43.3 percent of original size [2023-11-29 05:28:56,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 15554 treesize of output 8683 [2023-11-29 05:28:56,950 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:57,082 INFO L349 Elim1Store]: treesize reduction 23, result has 70.1 percent of original size [2023-11-29 05:28:57,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 923 treesize of output 796 [2023-11-29 05:28:57,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:57,157 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 456 treesize of output 428 [2023-11-29 05:28:57,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 644 treesize of output 540 [2023-11-29 05:28:57,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:57,253 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 609 treesize of output 563 [2023-11-29 05:28:58,420 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:58,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:58,667 INFO L349 Elim1Store]: treesize reduction 152, result has 43.3 percent of original size [2023-11-29 05:28:58,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 63254 treesize of output 35170 [2023-11-29 05:28:59,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:28:59,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:59,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6756 treesize of output 6368 [2023-11-29 05:28:59,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:59,425 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 6330 treesize of output 5250 [2023-11-29 05:28:59,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:59,571 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 2463 treesize of output 2395 [2023-11-29 05:28:59,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:28:59,735 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 5247 treesize of output 4457 [2023-11-29 05:29:00,118 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:29:00,119 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 15 treesize of output 9 [2023-11-29 05:29:15,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:15,176 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 30 treesize of output 26 [2023-11-29 05:29:15,212 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:15,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:15,215 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 05:29:15,222 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:15,229 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:15,301 INFO L349 Elim1Store]: treesize reduction 35, result has 61.1 percent of original size [2023-11-29 05:29:15,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 3843 treesize of output 2160 [2023-11-29 05:29:15,320 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:15,383 INFO L349 Elim1Store]: treesize reduction 15, result has 61.5 percent of original size [2023-11-29 05:29:15,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 219 treesize of output 192 [2023-11-29 05:29:15,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 139 treesize of output 115 [2023-11-29 05:29:15,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:15,434 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 117 treesize of output 111 [2023-11-29 05:29:15,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:29:15,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:15,893 INFO L349 Elim1Store]: treesize reduction 196, result has 40.8 percent of original size [2023-11-29 05:29:15,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 127337 treesize of output 70889 [2023-11-29 05:29:16,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:16,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:16,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2679 treesize of output 2537 [2023-11-29 05:29:16,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:16,185 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 2491 treesize of output 2203 [2023-11-29 05:29:16,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:16,301 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 2217 treesize of output 1725 [2023-11-29 05:29:16,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:16,422 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 831 treesize of output 787 [2023-11-29 05:29:16,696 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:29:16,696 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 17 treesize of output 9 [2023-11-29 05:29:20,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:20,931 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 55 treesize of output 51 [2023-11-29 05:29:20,987 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:20,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:21,310 INFO L349 Elim1Store]: treesize reduction 196, result has 40.8 percent of original size [2023-11-29 05:29:21,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 457403 treesize of output 260579 [2023-11-29 05:29:22,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:22,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:22,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1923 treesize of output 1837 [2023-11-29 05:29:22,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:22,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 887 treesize of output 843 [2023-11-29 05:29:22,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:22,919 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 1723 treesize of output 1547 [2023-11-29 05:29:23,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:23,017 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 1565 treesize of output 1185 [2023-11-29 05:29:23,363 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:29:23,363 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 17 treesize of output 9 [2023-11-29 05:29:26,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:26,245 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 31 treesize of output 31 [2023-11-29 05:29:26,290 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:26,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:26,683 INFO L349 Elim1Store]: treesize reduction 196, result has 40.8 percent of original size [2023-11-29 05:29:26,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 843839 treesize of output 488247 [2023-11-29 05:29:29,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:29,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:29,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1923 treesize of output 1837 [2023-11-29 05:29:30,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:30,045 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 1791 treesize of output 1615 [2023-11-29 05:29:30,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:30,151 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 1629 treesize of output 1249 [2023-11-29 05:29:30,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:30,281 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 683 treesize of output 639 [2023-11-29 05:29:30,676 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:29:30,676 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 17 treesize of output 9 [2023-11-29 05:29:36,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:36,215 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 31 treesize of output 31 [2023-11-29 05:29:36,260 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:36,267 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:36,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:36,665 INFO L349 Elim1Store]: treesize reduction 337, result has 31.5 percent of original size [2023-11-29 05:29:36,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 176425 treesize of output 99465 [2023-11-29 05:29:37,838 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:37,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:37,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2631 treesize of output 2497 [2023-11-29 05:29:38,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:38,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2475 treesize of output 2243 [2023-11-29 05:29:38,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:38,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2233 treesize of output 1737 [2023-11-29 05:29:38,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:38,331 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 655 treesize of output 611 [2023-11-29 05:29:42,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:42,720 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 169 treesize of output 173 [2023-11-29 05:29:44,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:44,570 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 31 treesize of output 31 [2023-11-29 05:29:44,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:44,623 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:44,697 INFO L349 Elim1Store]: treesize reduction 35, result has 61.1 percent of original size [2023-11-29 05:29:44,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 7271 treesize of output 4061 [2023-11-29 05:29:44,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:44,795 INFO L349 Elim1Store]: treesize reduction 15, result has 61.5 percent of original size [2023-11-29 05:29:44,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 219 treesize of output 192 [2023-11-29 05:29:44,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 139 treesize of output 115 [2023-11-29 05:29:44,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:44,843 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 117 treesize of output 111 [2023-11-29 05:29:44,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:29:45,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:45,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:45,465 INFO L349 Elim1Store]: treesize reduction 307, result has 37.6 percent of original size [2023-11-29 05:29:45,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 43332 treesize of output 24605 [2023-11-29 05:29:46,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:29:46,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:46,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10073 treesize of output 9491 [2023-11-29 05:29:46,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:46,279 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 6345 treesize of output 6173 [2023-11-29 05:29:46,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:46,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9253 treesize of output 8077 [2023-11-29 05:29:46,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:29:46,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8113 treesize of output 6817 [2023-11-29 05:29:47,779 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 05:29:47,779 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 23 treesize of output 13 [2023-11-29 05:31:09,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:09,201 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 30 treesize of output 26 [2023-11-29 05:31:09,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:09,254 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:09,490 INFO L349 Elim1Store]: treesize reduction 152, result has 43.3 percent of original size [2023-11-29 05:31:09,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 109350 treesize of output 62187 [2023-11-29 05:31:09,575 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:09,710 INFO L349 Elim1Store]: treesize reduction 23, result has 70.1 percent of original size [2023-11-29 05:31:09,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 298 [2023-11-29 05:31:09,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:09,782 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 217 treesize of output 195 [2023-11-29 05:31:09,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 158 treesize of output 130 [2023-11-29 05:31:09,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-11-29 05:31:10,206 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:10,212 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:10,345 INFO L349 Elim1Store]: treesize reduction 79, result has 48.4 percent of original size [2023-11-29 05:31:10,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 223730 treesize of output 128249 [2023-11-29 05:31:10,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:10,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:10,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1159 treesize of output 1107 [2023-11-29 05:31:10,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:10,993 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 1024 treesize of output 996 [2023-11-29 05:31:11,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:11,038 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 1038 treesize of output 918 [2023-11-29 05:31:11,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:11,084 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 915 treesize of output 695 [2023-11-29 05:31:11,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-29 05:31:12,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:12,662 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 56 treesize of output 52 [2023-11-29 05:31:12,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:12,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:12,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:13,162 INFO L349 Elim1Store]: treesize reduction 307, result has 37.6 percent of original size [2023-11-29 05:31:13,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 20819 treesize of output 11810 [2023-11-29 05:31:13,655 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:31:13,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:13,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11890 treesize of output 11152 [2023-11-29 05:31:14,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:14,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 11182 treesize of output 9690 [2023-11-29 05:31:14,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:14,329 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 3531 treesize of output 3423 [2023-11-29 05:31:14,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:31:14,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9594 treesize of output 8578 [2023-11-29 05:31:15,555 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 05:31:15,555 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 23 treesize of output 13