./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:02:40,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:02:40,996 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:02:41,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:02:41,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:02:41,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:02:41,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:02:41,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:02:41,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:02:41,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:02:41,036 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:02:41,037 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:02:41,037 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:02:41,038 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:02:41,038 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:02:41,039 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:02:41,039 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:02:41,040 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:02:41,040 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:02:41,041 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:02:41,041 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:02:41,042 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:02:41,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:02:41,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:02:41,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:02:41,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:02:41,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:02:41,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:02:41,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:02:41,050 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:02:41,050 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:02:41,050 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:02:41,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:02:41,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:02:41,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:02:41,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:02:41,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:02:41,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:02:41,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:02:41,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:02:41,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:02:41,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:02:41,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:02:41,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:02:41,059 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:02:41,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:02:41,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:02:41,060 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:02:41,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:02:41,061 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/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_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-09 06:02:41,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:02:41,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:02:41,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:02:41,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:02:41,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:02:41,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i Unable to find full path for "g++" [2024-11-09 06:02:43,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:02:44,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:02:44,094 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-09 06:02:44,106 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/data/e19d447ba/9d97192620d9489bab35428097c7ae9a/FLAG208b588d5 [2024-11-09 06:02:44,322 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/data/e19d447ba/9d97192620d9489bab35428097c7ae9a [2024-11-09 06:02:44,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:02:44,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:02:44,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:02:44,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:02:44,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:02:44,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:44,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327298af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44, skipping insertion in model container [2024-11-09 06:02:44,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:44,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:02:44,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:02:44,839 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:02:44,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:02:44,915 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:02:44,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44 WrapperNode [2024-11-09 06:02:44,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:02:44,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:02:44,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:02:44,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:02:44,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:44,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:44,968 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2024-11-09 06:02:44,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:02:44,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:02:44,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:02:44,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:02:44,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:44,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:44,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:44,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:44,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:45,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:45,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:45,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:45,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:02:45,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:02:45,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:02:45,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:02:45,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (1/1) ... [2024-11-09 06:02:45,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:02:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:45,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:02:45,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:02:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 06:02:45,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 06:02:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:02:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:02:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:02:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:02:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:02:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:02:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:02:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:02:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:02:45,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:02:45,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:02:45,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:02:45,779 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-11-09 06:02:45,780 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:02:45,869 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:02:45,870 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-09 06:02:45,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:02:45 BoogieIcfgContainer [2024-11-09 06:02:45,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:02:45,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:02:45,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:02:45,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:02:45,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:02:44" (1/3) ... [2024-11-09 06:02:45,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f6a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:02:45, skipping insertion in model container [2024-11-09 06:02:45,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:02:44" (2/3) ... [2024-11-09 06:02:45,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f6a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:02:45, skipping insertion in model container [2024-11-09 06:02:45,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:02:45" (3/3) ... [2024-11-09 06:02:45,888 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-09 06:02:45,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:02:45,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-11-09 06:02:45,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:02:45,988 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@479fe9bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:02:45,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-09 06:02:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 73 states have (on average 2.315068493150685) internal successors, (169), 138 states have internal predecessors, (169), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 06:02:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 06:02:46,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:46,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 06:02:46,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:46,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash 11266, now seen corresponding path program 1 times [2024-11-09 06:02:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:46,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396686941] [2024-11-09 06:02:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:46,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:46,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396686941] [2024-11-09 06:02:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396686941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:02:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269910743] [2024-11-09 06:02:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:46,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:02:46,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:02:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:02:46,378 INFO L87 Difference]: Start difference. First operand has 147 states, 73 states have (on average 2.315068493150685) internal successors, (169), 138 states have internal predecessors, (169), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:46,619 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2024-11-09 06:02:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:02:46,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-11-09 06:02:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:46,634 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:02:46,634 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 06:02:46,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:02:46,640 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 107 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:46,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 85 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 06:02:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-09 06:02:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 68 states have (on average 2.088235294117647) internal successors, (142), 131 states have internal predecessors, (142), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2024-11-09 06:02:46,686 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 2 [2024-11-09 06:02:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:46,687 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2024-11-09 06:02:46,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2024-11-09 06:02:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 06:02:46,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:46,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 06:02:46,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:02:46,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:46,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash 11267, now seen corresponding path program 1 times [2024-11-09 06:02:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661892997] [2024-11-09 06:02:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:46,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:46,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661892997] [2024-11-09 06:02:46,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661892997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:46,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:46,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:02:46,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289481444] [2024-11-09 06:02:46,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:46,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:02:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:02:46,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:02:46,832 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:47,042 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2024-11-09 06:02:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:02:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-11-09 06:02:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:47,044 INFO L225 Difference]: With dead ends: 135 [2024-11-09 06:02:47,045 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 06:02:47,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:02:47,050 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 101 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:47,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 97 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 06:02:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 06:02:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9726027397260273) internal successors, (144), 133 states have internal predecessors, (144), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2024-11-09 06:02:47,069 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 2 [2024-11-09 06:02:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:47,073 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2024-11-09 06:02:47,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2024-11-09 06:02:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:02:47,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:47,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:47,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:02:47,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:47,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 408637020, now seen corresponding path program 1 times [2024-11-09 06:02:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:47,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716740573] [2024-11-09 06:02:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:47,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716740573] [2024-11-09 06:02:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716740573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:47,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:02:47,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764388695] [2024-11-09 06:02:47,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:47,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:02:47,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:47,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:02:47,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:02:47,373 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:47,682 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2024-11-09 06:02:47,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:02:47,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-09 06:02:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:47,686 INFO L225 Difference]: With dead ends: 123 [2024-11-09 06:02:47,686 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 06:02:47,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:47,690 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 141 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:47,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 68 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:02:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 06:02:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 06:02:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 121 states have internal predecessors, (135), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2024-11-09 06:02:47,707 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 7 [2024-11-09 06:02:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:47,708 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2024-11-09 06:02:47,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2024-11-09 06:02:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:02:47,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:47,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:47,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:02:47,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:47,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 408637021, now seen corresponding path program 1 times [2024-11-09 06:02:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965071335] [2024-11-09 06:02:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:48,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:48,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965071335] [2024-11-09 06:02:48,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965071335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:48,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:48,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:02:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379160148] [2024-11-09 06:02:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:48,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:02:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:02:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:02:48,070 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:48,526 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2024-11-09 06:02:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:02:48,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-09 06:02:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:48,528 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:02:48,528 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:02:48,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:02:48,532 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:48,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 137 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:02:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:02:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2024-11-09 06:02:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.7176470588235293) internal successors, (146), 129 states have internal predecessors, (146), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2024-11-09 06:02:48,549 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 7 [2024-11-09 06:02:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2024-11-09 06:02:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2024-11-09 06:02:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:02:48,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:48,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:48,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:02:48,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:48,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1858434981, now seen corresponding path program 1 times [2024-11-09 06:02:48,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:48,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660821614] [2024-11-09 06:02:48,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:48,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:48,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660821614] [2024-11-09 06:02:48,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660821614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:48,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:02:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494151985] [2024-11-09 06:02:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:48,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:02:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:48,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:02:48,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:48,764 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:48,983 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2024-11-09 06:02:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:02:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-09 06:02:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:48,985 INFO L225 Difference]: With dead ends: 130 [2024-11-09 06:02:48,985 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 06:02:48,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:02:48,987 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:48,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 312 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 06:02:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 06:02:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.6941176470588235) internal successors, (144), 128 states have internal predecessors, (144), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2024-11-09 06:02:49,006 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 9 [2024-11-09 06:02:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:49,007 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2024-11-09 06:02:49,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2024-11-09 06:02:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:02:49,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:49,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:49,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:02:49,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:49,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1858434982, now seen corresponding path program 1 times [2024-11-09 06:02:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218197973] [2024-11-09 06:02:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:49,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:49,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218197973] [2024-11-09 06:02:49,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218197973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:49,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:49,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:02:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902716368] [2024-11-09 06:02:49,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:49,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:02:49,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:02:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:49,264 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:49,500 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2024-11-09 06:02:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:02:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-09 06:02:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:49,502 INFO L225 Difference]: With dead ends: 129 [2024-11-09 06:02:49,502 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 06:02:49,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:02:49,504 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:49,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 295 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 06:02:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-09 06:02:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 127 states have internal predecessors, (142), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2024-11-09 06:02:49,512 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 9 [2024-11-09 06:02:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:49,512 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2024-11-09 06:02:49,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2024-11-09 06:02:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:02:49,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:49,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:49,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:02:49,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:49,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -971107473, now seen corresponding path program 1 times [2024-11-09 06:02:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:49,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971700905] [2024-11-09 06:02:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:49,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:49,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971700905] [2024-11-09 06:02:49,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971700905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:49,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:49,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:02:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079996680] [2024-11-09 06:02:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:49,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:02:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:02:49,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:02:49,587 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:49,769 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2024-11-09 06:02:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:02:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:02:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:49,770 INFO L225 Difference]: With dead ends: 133 [2024-11-09 06:02:49,770 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 06:02:49,771 INFO L431 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 [2024-11-09 06:02:49,772 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 114 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:49,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 154 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 06:02:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2024-11-09 06:02:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.611764705882353) internal successors, (137), 126 states have internal predecessors, (137), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2024-11-09 06:02:49,785 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 11 [2024-11-09 06:02:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:49,785 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2024-11-09 06:02:49,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2024-11-09 06:02:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:02:49,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:49,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:49,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:02:49,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:49,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:49,787 INFO L85 PathProgramCache]: Analyzing trace with hash -750092403, now seen corresponding path program 1 times [2024-11-09 06:02:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513164879] [2024-11-09 06:02:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:50,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:50,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513164879] [2024-11-09 06:02:50,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513164879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:50,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:50,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:02:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225881625] [2024-11-09 06:02:50,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:50,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:02:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:50,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:02:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:02:50,246 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:50,830 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2024-11-09 06:02:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:02:50,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 06:02:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:50,831 INFO L225 Difference]: With dead ends: 140 [2024-11-09 06:02:50,831 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 06:02:50,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:02:50,833 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 173 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:50,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 227 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:02:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 06:02:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2024-11-09 06:02:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 128 states have internal predecessors, (142), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2024-11-09 06:02:50,838 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 11 [2024-11-09 06:02:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:50,839 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2024-11-09 06:02:50,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2024-11-09 06:02:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:02:50,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:50,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:50,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:02:50,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:50,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash -750092404, now seen corresponding path program 1 times [2024-11-09 06:02:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333748845] [2024-11-09 06:02:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:51,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:51,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333748845] [2024-11-09 06:02:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333748845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:02:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384606105] [2024-11-09 06:02:51,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:02:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:51,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:02:51,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:02:51,121 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:51,460 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2024-11-09 06:02:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:02:51,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 06:02:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:51,461 INFO L225 Difference]: With dead ends: 129 [2024-11-09 06:02:51,461 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 06:02:51,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:02:51,463 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 126 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:51,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 142 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:02:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 06:02:51,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-09 06:02:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 127 states have internal predecessors, (141), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2024-11-09 06:02:51,469 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 11 [2024-11-09 06:02:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:51,469 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2024-11-09 06:02:51,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2024-11-09 06:02:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 06:02:51,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:51,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:51,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:02:51,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:51,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash -10736158, now seen corresponding path program 1 times [2024-11-09 06:02:51,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:51,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211087661] [2024-11-09 06:02:51,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:51,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211087661] [2024-11-09 06:02:51,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211087661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:51,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:51,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:02:51,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785160888] [2024-11-09 06:02:51,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:51,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:02:51,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:02:51,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:51,568 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:51,809 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2024-11-09 06:02:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:02:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 06:02:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:51,811 INFO L225 Difference]: With dead ends: 171 [2024-11-09 06:02:51,811 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 06:02:51,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:02:51,812 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 69 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:51,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 241 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 06:02:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2024-11-09 06:02:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 100 states have (on average 1.49) internal successors, (149), 134 states have internal predecessors, (149), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2024-11-09 06:02:51,821 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 14 [2024-11-09 06:02:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:51,821 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2024-11-09 06:02:51,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2024-11-09 06:02:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:02:51,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:51,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:51,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:02:51,823 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:51,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:51,826 INFO L85 PathProgramCache]: Analyzing trace with hash 910325400, now seen corresponding path program 1 times [2024-11-09 06:02:51,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:51,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152355852] [2024-11-09 06:02:51,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:52,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:52,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152355852] [2024-11-09 06:02:52,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152355852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:52,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:52,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:02:52,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5910754] [2024-11-09 06:02:52,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:52,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:02:52,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:52,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:02:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:52,027 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:52,207 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2024-11-09 06:02:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:02:52,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-09 06:02:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:52,209 INFO L225 Difference]: With dead ends: 135 [2024-11-09 06:02:52,209 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 06:02:52,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:02:52,210 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:52,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 288 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 06:02:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 06:02:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 100 states have (on average 1.48) internal successors, (148), 133 states have internal predecessors, (148), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2024-11-09 06:02:52,215 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 16 [2024-11-09 06:02:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:52,215 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2024-11-09 06:02:52,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2024-11-09 06:02:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:02:52,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:52,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:52,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:02:52,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:52,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash 910325401, now seen corresponding path program 1 times [2024-11-09 06:02:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:52,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902107213] [2024-11-09 06:02:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:52,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902107213] [2024-11-09 06:02:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902107213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:02:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491199803] [2024-11-09 06:02:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:52,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:02:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:52,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:02:52,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:52,488 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:52,755 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2024-11-09 06:02:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:02:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-09 06:02:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:52,757 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:02:52,757 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:02:52,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:02:52,758 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:52,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 276 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:02:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 06:02:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 100 states have (on average 1.47) internal successors, (147), 132 states have internal predecessors, (147), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2024-11-09 06:02:52,765 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 16 [2024-11-09 06:02:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:52,768 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2024-11-09 06:02:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2024-11-09 06:02:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:02:52,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:52,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:52,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:02:52,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:52,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash -704171131, now seen corresponding path program 1 times [2024-11-09 06:02:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:52,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31906826] [2024-11-09 06:02:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:52,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:52,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31906826] [2024-11-09 06:02:52,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31906826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:52,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:52,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:02:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663132862] [2024-11-09 06:02:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:52,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:02:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:02:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:02:52,886 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:53,042 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2024-11-09 06:02:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:02:53,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 06:02:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:53,045 INFO L225 Difference]: With dead ends: 133 [2024-11-09 06:02:53,045 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 06:02:53,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:53,046 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:53,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 206 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:02:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 06:02:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-09 06:02:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.45) internal successors, (145), 131 states have internal predecessors, (145), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2024-11-09 06:02:53,053 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 18 [2024-11-09 06:02:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:53,054 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2024-11-09 06:02:53,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2024-11-09 06:02:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:02:53,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:53,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:53,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:02:53,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1350367713, now seen corresponding path program 1 times [2024-11-09 06:02:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621155281] [2024-11-09 06:02:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:53,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621155281] [2024-11-09 06:02:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621155281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:53,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:02:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277740917] [2024-11-09 06:02:53,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:53,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:02:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:53,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:02:53,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:02:53,357 INFO L87 Difference]: Start difference. First operand 133 states and 150 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:53,641 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2024-11-09 06:02:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:02:53,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 06:02:53,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:53,643 INFO L225 Difference]: With dead ends: 132 [2024-11-09 06:02:53,643 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 06:02:53,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:02:53,644 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:53,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 216 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:02:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 06:02:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 06:02:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 100 states have (on average 1.44) internal successors, (144), 130 states have internal predecessors, (144), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2024-11-09 06:02:53,648 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 18 [2024-11-09 06:02:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:53,649 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2024-11-09 06:02:53,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2024-11-09 06:02:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:02:53,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:53,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:53,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:02:53,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1350367712, now seen corresponding path program 1 times [2024-11-09 06:02:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789196403] [2024-11-09 06:02:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:54,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789196403] [2024-11-09 06:02:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789196403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 06:02:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340708400] [2024-11-09 06:02:54,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:54,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:02:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:54,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:02:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:02:54,346 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:55,174 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2024-11-09 06:02:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 06:02:55,175 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 06:02:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:55,176 INFO L225 Difference]: With dead ends: 128 [2024-11-09 06:02:55,176 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 06:02:55,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-11-09 06:02:55,177 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 128 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:55,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 384 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:02:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 06:02:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 111. [2024-11-09 06:02:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 109 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2024-11-09 06:02:55,181 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 18 [2024-11-09 06:02:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:55,182 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2024-11-09 06:02:55,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:02:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2024-11-09 06:02:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:02:55,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:55,184 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:55,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:02:55,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:02:55,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:55,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1806491293, now seen corresponding path program 1 times [2024-11-09 06:02:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:55,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605822157] [2024-11-09 06:02:55,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:55,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:55,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605822157] [2024-11-09 06:02:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605822157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8718192] [2024-11-09 06:02:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:55,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:55,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:55,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:02:55,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:02:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:55,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 06:02:55,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:55,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:02:55,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:02:55,666 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 19 treesize of output 18 [2024-11-09 06:02:55,689 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 23 treesize of output 11 [2024-11-09 06:02:55,733 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 23 treesize of output 11 [2024-11-09 06:02:55,747 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:02:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:55,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:02:56,392 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 10 treesize of output 8 [2024-11-09 06:02:56,399 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 14 treesize of output 12 [2024-11-09 06:02:56,410 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 10 treesize of output 8 [2024-11-09 06:02:56,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:02:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8718192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:02:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [998731928] [2024-11-09 06:02:56,447 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 06:02:56,447 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:02:56,451 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:02:56,457 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:02:56,458 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:02:56,962 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:03:24,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [998731928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:24,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:03:24,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 6, 5] total 20 [2024-11-09 06:03:24,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425055446] [2024-11-09 06:03:24,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:24,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:03:24,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:24,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:03:24,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=250, Unknown=1, NotChecked=0, Total=380 [2024-11-09 06:03:24,155 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:25,304 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-11-09 06:03:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:03:25,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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 [2024-11-09 06:03:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:25,306 INFO L225 Difference]: With dead ends: 130 [2024-11-09 06:03:25,306 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 06:03:25,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=129, Invalid=250, Unknown=1, NotChecked=0, Total=380 [2024-11-09 06:03:25,307 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:25,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 166 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:03:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 06:03:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2024-11-09 06:03:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 116 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-11-09 06:03:25,313 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 20 [2024-11-09 06:03:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:25,313 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-11-09 06:03:25,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-11-09 06:03:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:03:25,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:25,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:25,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:03:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 06:03:25,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:03:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash 731767291, now seen corresponding path program 1 times [2024-11-09 06:03:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301948982] [2024-11-09 06:03:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:25,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:25,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301948982] [2024-11-09 06:03:25,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301948982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:25,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:03:25,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081956125] [2024-11-09 06:03:25,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:25,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:25,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:25,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:25,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:25,691 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:25,861 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2024-11-09 06:03:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 06:03:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:25,862 INFO L225 Difference]: With dead ends: 118 [2024-11-09 06:03:25,862 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 06:03:25,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:03:25,863 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 10 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:25,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 202 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:03:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 06:03:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-09 06:03:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 115 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-11-09 06:03:25,867 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 21 [2024-11-09 06:03:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:25,868 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-11-09 06:03:25,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-11-09 06:03:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:03:25,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:25,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:25,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:03:25,869 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:03:25,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1200466320, now seen corresponding path program 1 times [2024-11-09 06:03:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603419253] [2024-11-09 06:03:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:26,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:26,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603419253] [2024-11-09 06:03:26,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603419253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:26,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:26,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:03:26,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819191601] [2024-11-09 06:03:26,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:26,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:03:26,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:26,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:03:26,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:03:26,134 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:26,624 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2024-11-09 06:03:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:03:26,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 06:03:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:26,626 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:03:26,626 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:03:26,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:03:26,627 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 138 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:26,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 185 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:03:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:03:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 124. [2024-11-09 06:03:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.34) internal successors, (134), 122 states have internal predecessors, (134), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2024-11-09 06:03:26,631 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 23 [2024-11-09 06:03:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:26,632 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2024-11-09 06:03:26,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2024-11-09 06:03:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:03:26,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:26,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:26,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:03:26,633 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:03:26,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 517170238, now seen corresponding path program 1 times [2024-11-09 06:03:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950601706] [2024-11-09 06:03:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:03:26,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950601706] [2024-11-09 06:03:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950601706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:03:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568040248] [2024-11-09 06:03:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:26,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:03:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:03:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:03:26,712 INFO L87 Difference]: Start difference. First operand 124 states and 138 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 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) [2024-11-09 06:03:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:26,813 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2024-11-09 06:03:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:03:26,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 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 [2024-11-09 06:03:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:26,814 INFO L225 Difference]: With dead ends: 126 [2024-11-09 06:03:26,814 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 06:03:26,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:03:26,815 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:26,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 88 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:03:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 06:03:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 06:03:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 124 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2024-11-09 06:03:26,819 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 25 [2024-11-09 06:03:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:26,820 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2024-11-09 06:03:26,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 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) [2024-11-09 06:03:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2024-11-09 06:03:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 06:03:26,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:26,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:26,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:03:26,821 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:03:26,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1215597951, now seen corresponding path program 1 times [2024-11-09 06:03:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706822489] [2024-11-09 06:03:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:26,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:26,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706822489] [2024-11-09 06:03:26,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706822489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:26,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518771729] [2024-11-09 06:03:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:26,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:26,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:26,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:26,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:03:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:27,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:03:27,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:27,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 06:03:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:03:27,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:03:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518771729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:27,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:03:27,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-09 06:03:27,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582528344] [2024-11-09 06:03:27,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:27,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:03:27,162 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:27,297 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2024-11-09 06:03:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 [2024-11-09 06:03:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:27,299 INFO L225 Difference]: With dead ends: 133 [2024-11-09 06:03:27,299 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 06:03:27,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:03:27,300 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:27,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 206 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:03:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 06:03:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-09 06:03:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.320754716981132) internal successors, (140), 128 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2024-11-09 06:03:27,304 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 27 [2024-11-09 06:03:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:27,304 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2024-11-09 06:03:27,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2024-11-09 06:03:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:03:27,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:27,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:27,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:03:27,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:27,506 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:03:27,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash 491355387, now seen corresponding path program 1 times [2024-11-09 06:03:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761476121] [2024-11-09 06:03:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:27,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:27,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761476121] [2024-11-09 06:03:27,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761476121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:27,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:27,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:03:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172774691] [2024-11-09 06:03:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:27,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:03:27,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:27,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:03:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:03:27,773 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:28,135 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2024-11-09 06:03:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:03:28,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 06:03:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:28,137 INFO L225 Difference]: With dead ends: 139 [2024-11-09 06:03:28,137 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 06:03:28,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:03:28,138 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 42 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:28,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 256 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:03:28,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 06:03:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 122. [2024-11-09 06:03:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 120 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-09 06:03:28,143 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 29 [2024-11-09 06:03:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:28,144 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-09 06:03:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-09 06:03:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:03:28,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:28,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:28,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:03:28,145 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:03:28,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash 664543384, now seen corresponding path program 1 times [2024-11-09 06:03:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953469924] [2024-11-09 06:03:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:03:28,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953469924] [2024-11-09 06:03:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953469924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:28,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938968180] [2024-11-09 06:03:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:28,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:28,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:28,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:28,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:03:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:28,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 06:03:28,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:28,444 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 13 treesize of output 9 [2024-11-09 06:03:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:03:28,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:03:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938968180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:03:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212959311] [2024-11-09 06:03:28,544 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 06:03:28,545 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:03:28,545 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:03:28,545 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:03:28,545 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:03:29,230 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:03:45,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [212959311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:45,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:03:45,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [2, 2, 2] total 19 [2024-11-09 06:03:45,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790870151] [2024-11-09 06:03:45,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:03:45,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:45,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:03:45,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=298, Unknown=1, NotChecked=0, Total=420 [2024-11-09 06:03:45,481 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:48,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:03:54,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:03:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:57,201 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-11-09 06:03:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:03:57,202 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 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 [2024-11-09 06:03:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:57,202 INFO L225 Difference]: With dead ends: 73 [2024-11-09 06:03:57,203 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 06:03:57,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=129, Invalid=332, Unknown=1, NotChecked=0, Total=462 [2024-11-09 06:03:57,204 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:57,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 157 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 3 Unknown, 0 Unchecked, 11.4s Time] [2024-11-09 06:03:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 06:03:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 06:03:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-09 06:03:57,209 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2024-11-09 06:03:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:57,209 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-09 06:03:57,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:03:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-09 06:03:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:03:57,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:57,210 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 06:03:57,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:03:57,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:57,411 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:03:57,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:57,411 INFO L85 PathProgramCache]: Analyzing trace with hash -886753150, now seen corresponding path program 1 times [2024-11-09 06:03:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154081846] [2024-11-09 06:03:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:57,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:58,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:58,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154081846] [2024-11-09 06:03:58,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154081846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882487426] [2024-11-09 06:03:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:58,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:58,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:58,285 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:58,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:03:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:58,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:03:58,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:58,430 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 [2024-11-09 06:03:58,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:03:58,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:03:58,568 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 [2024-11-09 06:03:58,642 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 15 treesize of output 1 [2024-11-09 06:03:58,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:03:58,655 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 [2024-11-09 06:03:58,822 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:03:58,822 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 41 treesize of output 38 [2024-11-09 06:03:58,837 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 [2024-11-09 06:03:58,874 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 16 treesize of output 8 [2024-11-09 06:03:58,896 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 16 treesize of output 11 [2024-11-09 06:03:58,927 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 16 treesize of output 11 [2024-11-09 06:03:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:59,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:59,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-09 06:03:59,147 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_905) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-09 06:03:59,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_903) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_905) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-09 06:03:59,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_903) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_902) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_905)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-09 06:03:59,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:03:59,181 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 33 treesize of output 34 [2024-11-09 06:03:59,191 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 60 treesize of output 52 [2024-11-09 06:03:59,198 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 24 treesize of output 22 [2024-11-09 06:03:59,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse3 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_901 (Array Int Int))) (or (not (= v_ArrVal_901 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_903) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (or .cse3 (forall ((v_ArrVal_901 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (or (not (= v_ArrVal_901 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (or (forall ((v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (or (not (= v_ArrVal_901 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_903) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))) (not .cse3)))) is different from false [2024-11-09 06:03:59,636 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 183 treesize of output 179 [2024-11-09 06:03:59,648 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 163 treesize of output 159 [2024-11-09 06:03:59,656 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 159 treesize of output 147 [2024-11-09 06:03:59,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:03:59,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:03:59,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 178 [2024-11-09 06:03:59,722 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 127 treesize of output 123 [2024-11-09 06:03:59,739 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 123 treesize of output 119 [2024-11-09 06:03:59,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:03:59,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:03:59,830 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 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-09 06:03:59,839 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:03:59,840 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 11 [2024-11-09 06:03:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882487426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:03:59,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1853169896] [2024-11-09 06:03:59,896 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 06:03:59,897 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:03:59,897 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:03:59,897 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:03:59,897 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:04:01,041 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 23 for LOIs [2024-11-09 06:04:01,048 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:04:58,297 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6582#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1|) 1) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1|) 8) 1)) (not (= |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1| 0)) (<= 12 (select |#length| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1|)))))' at error location [2024-11-09 06:04:58,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:04:58,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:04:58,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24 [2024-11-09 06:04:58,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479254591] [2024-11-09 06:04:58,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:04:58,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 06:04:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:04:58,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 06:04:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1365, Unknown=20, NotChecked=400, Total=1980 [2024-11-09 06:04:58,300 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:04:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:59,912 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2024-11-09 06:04:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 06:04:59,913 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 06:04:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:59,914 INFO L225 Difference]: With dead ends: 69 [2024-11-09 06:04:59,914 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 06:04:59,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=365, Invalid=2390, Unknown=21, NotChecked=530, Total=3306 [2024-11-09 06:04:59,916 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 150 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 36 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:59,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 189 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 304 Invalid, 8 Unknown, 328 Unchecked, 0.6s Time] [2024-11-09 06:04:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 06:04:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2024-11-09 06:04:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:04:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-11-09 06:04:59,918 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2024-11-09 06:04:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:59,918 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-09 06:04:59,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:04:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-11-09 06:04:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 06:04:59,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:59,920 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:04:59,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:05:00,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:05:00,124 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:05:00,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:05:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash 312386573, now seen corresponding path program 1 times [2024-11-09 06:05:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:05:00,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605049429] [2024-11-09 06:05:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:05:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:05:01,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:05:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605049429] [2024-11-09 06:05:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605049429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:05:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122213823] [2024-11-09 06:05:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:01,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:05:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:05:01,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:05:01,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:05:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:01,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:05:01,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:05:01,626 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 [2024-11-09 06:05:01,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:05:01,758 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:05:01,758 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 [2024-11-09 06:05:01,824 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 15 treesize of output 1 [2024-11-09 06:05:01,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:01,841 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 [2024-11-09 06:05:01,990 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:05:01,991 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 41 treesize of output 38 [2024-11-09 06:05:01,999 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 [2024-11-09 06:05:02,015 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 16 treesize of output 8 [2024-11-09 06:05:02,032 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 16 treesize of output 11 [2024-11-09 06:05:02,096 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 16 treesize of output 11 [2024-11-09 06:05:02,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:05:02,110 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 11 treesize of output 11 [2024-11-09 06:05:02,172 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 15 treesize of output 1 [2024-11-09 06:05:02,180 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 16 treesize of output 11 [2024-11-09 06:05:02,189 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 [2024-11-09 06:05:02,328 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:05:02,328 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 06:05:02,335 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 24 treesize of output 11 [2024-11-09 06:05:02,367 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-09 06:05:02,367 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 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 06:05:02,447 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 31 treesize of output 19 [2024-11-09 06:05:02,461 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 7 treesize of output 3 [2024-11-09 06:05:02,536 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:05:02,536 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 20 treesize of output 19 [2024-11-09 06:05:02,572 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 06:05:02,573 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 23 treesize of output 26 [2024-11-09 06:05:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:05:02,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:05:02,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:02,850 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 17 treesize of output 21 [2024-11-09 06:05:02,982 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select v_arrayElimArr_4 (+ .cse0 8)) 1)) (< .cse0 0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1065) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)))) is different from false [2024-11-09 06:05:03,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:03,113 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 33 treesize of output 34 [2024-11-09 06:05:03,123 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 60 treesize of output 52 [2024-11-09 06:05:03,132 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 24 treesize of output 22 [2024-11-09 06:05:03,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:03,145 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 42 treesize of output 34 [2024-11-09 06:05:03,155 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 62 treesize of output 50 [2024-11-09 06:05:03,166 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 40 treesize of output 36 [2024-11-09 06:05:03,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:03,954 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 88 treesize of output 106 [2024-11-09 06:05:04,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1062))) (or (not (= (select v_arrayElimArr_4 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (forall ((v_prenex_17 Int)) (or (= v_prenex_17 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (not (= (select v_prenex_16 8) 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) is different from false [2024-11-09 06:05:04,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_prenex_17 Int)) (or (forall ((v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (not (= (select v_prenex_16 8) 1)) (= (select (select (store (store |c_#memory_int| .cse0 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (= v_prenex_17 .cse0))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| .cse0 v_ArrVal_1062))) (or (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| .cse0) (not (= (select v_arrayElimArr_4 8) 1))))))) is different from false [2024-11-09 06:05:04,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1055) .cse2 v_ArrVal_1062))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| .cse2) (not (= (select v_arrayElimArr_4 8) 1)) (= 1 (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (forall ((v_prenex_17 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (not (= (select v_prenex_16 8) 1)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1055) .cse3 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (= .cse3 v_prenex_17)))))) is different from false [2024-11-09 06:05:04,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_prenex_17 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1054) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (not (= (select v_prenex_16 8) 1)) (= (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1055) .cse1 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))) (= v_prenex_17 .cse1)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1054) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| .cse0 v_ArrVal_1055) .cse4 v_ArrVal_1062))) (or (= (select (select (store .cse3 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_4 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| .cse4) (= (select (select (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) is different from false [2024-11-09 06:05:04,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:04,411 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 162 treesize of output 131 [2024-11-09 06:05:04,419 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 243 treesize of output 219 [2024-11-09 06:05:04,439 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 205 treesize of output 199 [2024-11-09 06:05:04,449 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 199 treesize of output 195 [2024-11-09 06:05:05,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse0 (not .cse9)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or .cse0 (and (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1062 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062))) (or (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_4 8) 1)) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54)))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1062 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_4 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54)))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_54 Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 8) 1)) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)))))) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062))) (or (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (not (= (select v_arrayElimArr_4 8) 1)) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54))))) (or (and (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_prenex_17 Int) (v_arrayElimCell_55 Int)) (or (forall ((v_prenex_16 (Array Int Int))) (or (not (= (select v_prenex_16 8) 1)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) (= v_prenex_17 v_arrayElimCell_55))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_prenex_17 Int) (v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select v_prenex_16 8) 1)) (= v_prenex_17 v_arrayElimCell_55) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) .cse0) (or .cse9 (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (not (= (select v_arrayElimArr_4 8) 1)) (= (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (forall ((v_arrayElimCell_54 Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 8) 1)) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (let ((.cse12 (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse9 (and (forall ((v_ArrVal_1052 (Array Int Int))) (or (forall ((v_prenex_17 Int)) (or (forall ((v_prenex_16 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select v_prenex_16 8) 1)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_prenex_17 Int)) (or (forall ((v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_prenex_16 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))))))) (or .cse0 (forall ((v_prenex_17 Int) (v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select v_prenex_16 8) 1)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (= v_prenex_17 v_arrayElimCell_55) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17)))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (not (= (select v_arrayElimArr_4 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54)))) .cse0) (or .cse9 (and (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_4 8) 1)) (= (select (select (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (not (= (select v_arrayElimArr_4 8) 1)) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (forall ((v_prenex_17 Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (forall ((v_prenex_16 (Array Int Int))) (or (not (= (select v_prenex_16 8) 1)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) (= v_prenex_17 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)))) (or .cse9 (forall ((v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_prenex_16 8) 1)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))))))) is different from false [2024-11-09 06:05:08,671 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 9855 treesize of output 9839 [2024-11-09 06:05:08,849 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 2019 treesize of output 2007 [2024-11-09 06:05:08,909 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 2007 treesize of output 2003 [2024-11-09 06:05:08,959 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 2003 treesize of output 1999 [2024-11-09 06:05:09,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:09,036 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 1999 treesize of output 1986 [2024-11-09 06:05:09,088 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 1977 treesize of output 1969 [2024-11-09 06:05:09,139 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 1969 treesize of output 1965 [2024-11-09 06:05:09,192 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 1965 treesize of output 1961 [2024-11-09 06:05:09,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:09,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 1961 treesize of output 1952 [2024-11-09 06:05:09,343 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 1943 treesize of output 1935 [2024-11-09 06:05:09,392 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 1935 treesize of output 1927 [2024-11-09 06:05:09,448 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 1927 treesize of output 1919 [2024-11-09 06:05:09,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:09,531 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 1919 treesize of output 1902 [2024-11-09 06:05:09,587 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 1893 treesize of output 1889 [2024-11-09 06:05:09,658 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 1889 treesize of output 1885 [2024-11-09 06:05:09,715 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 1885 treesize of output 1877 [2024-11-09 06:05:09,771 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 1877 treesize of output 1861 [2024-11-09 06:05:09,831 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 1861 treesize of output 1857 [2024-11-09 06:05:09,886 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 1857 treesize of output 1849 [2024-11-09 06:05:09,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:09,986 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 1849 treesize of output 1848 [2024-11-09 06:05:10,034 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 1839 treesize of output 1831 [2024-11-09 06:05:10,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:05:10,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:10,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 1831 treesize of output 2384 [2024-11-09 06:05:10,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:10,593 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 1751 treesize of output 1746 [2024-11-09 06:05:10,889 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 1737 treesize of output 1733 [2024-11-09 06:05:11,115 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 1733 treesize of output 1729 [2024-11-09 06:05:11,286 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 1729 treesize of output 1717 [2024-11-09 06:05:11,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:11,507 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 1717 treesize of output 1704 [2024-11-09 06:05:11,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:11,719 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 1695 treesize of output 1662 [2024-11-09 06:05:11,890 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 1653 treesize of output 1645 [2024-11-09 06:05:12,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:12,153 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 1645 treesize of output 1648 [2024-11-09 06:05:12,302 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 1639 treesize of output 1635 [2024-11-09 06:05:12,447 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 1635 treesize of output 1631 [2024-11-09 06:05:12,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:12,644 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 1631 treesize of output 1634 [2024-11-09 06:05:12,833 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 1625 treesize of output 1621 [2024-11-09 06:05:13,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:13,031 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 1621 treesize of output 1616 [2024-11-09 06:05:13,238 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 1607 treesize of output 1603 [2024-11-09 06:05:13,432 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 1603 treesize of output 1599 [2024-11-09 06:05:13,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:13,702 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 1599 treesize of output 1594 [2024-11-09 06:05:13,843 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 1585 treesize of output 1581 [2024-11-09 06:05:14,012 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 1581 treesize of output 1573 [2024-11-09 06:05:14,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:14,213 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 1573 treesize of output 1556 [2024-11-09 06:05:14,386 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 1547 treesize of output 1545 [2024-11-09 06:05:14,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:14,593 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 1545 treesize of output 1548 [2024-11-09 06:05:14,769 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 1539 treesize of output 1535 [2024-11-09 06:05:14,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 1535 treesize of output 1531 [2024-11-09 06:05:15,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:15,124 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 1531 treesize of output 1530 [2024-11-09 06:05:15,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:15,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 1521 treesize of output 1516 [2024-11-09 06:05:21,806 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 6 [2024-11-09 06:05:21,833 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 6 [2024-11-09 06:05:21,867 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 6 [2024-11-09 06:05:21,899 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 6 [2024-11-09 06:05:21,920 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 6 [2024-11-09 06:05:21,947 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 6 [2024-11-09 06:05:21,978 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 6 [2024-11-09 06:05:22,020 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 6 [2024-11-09 06:05:22,108 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 6 [2024-11-09 06:05:22,132 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 6 [2024-11-09 06:05:22,179 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 6 [2024-11-09 06:05:22,223 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 6 [2024-11-09 06:05:22,243 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 6 [2024-11-09 06:05:22,405 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 6 [2024-11-09 06:05:23,063 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 6 [2024-11-09 06:05:23,126 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 6 [2024-11-09 06:05:23,160 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 6 [2024-11-09 06:05:23,253 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 6 [2024-11-09 06:05:23,277 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 6 [2024-11-09 06:05:23,306 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 6 [2024-11-09 06:05:23,399 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 6 [2024-11-09 06:05:23,424 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 6 [2024-11-09 06:05:23,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:05:23,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:23,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:23,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:23,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:23,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:23,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:23,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 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 93 treesize of output 275 [2024-11-09 06:05:24,026 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 6 [2024-11-09 06:05:24,052 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 6 [2024-11-09 06:05:24,077 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 6 [2024-11-09 06:05:24,097 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 6 [2024-11-09 06:05:24,112 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 6 [2024-11-09 06:05:24,141 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 6 [2024-11-09 06:05:24,162 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 6 [2024-11-09 06:05:24,184 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 6 [2024-11-09 06:05:24,236 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 6 [2024-11-09 06:05:24,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 8 treesize of output 6 [2024-11-09 06:05:24,283 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 6 [2024-11-09 06:05:24,310 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 6 [2024-11-09 06:05:24,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 8 treesize of output 6 [2024-11-09 06:05:24,353 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 6 [2024-11-09 06:05:24,387 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 6 [2024-11-09 06:05:24,413 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 6 [2024-11-09 06:05:24,440 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 6 [2024-11-09 06:05:24,461 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 6 [2024-11-09 06:05:24,826 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 6 [2024-11-09 06:05:24,856 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 6 [2024-11-09 06:05:24,873 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 6 [2024-11-09 06:05:24,891 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 6 [2024-11-09 06:05:24,905 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 6 [2024-11-09 06:05:24,923 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 6 [2024-11-09 06:05:24,940 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 6 [2024-11-09 06:05:24,971 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 6 [2024-11-09 06:05:24,990 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 6 [2024-11-09 06:05:25,015 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 6 [2024-11-09 06:05:25,050 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 6 [2024-11-09 06:05:25,067 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 6 [2024-11-09 06:05:25,089 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 6 [2024-11-09 06:05:25,106 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 6 [2024-11-09 06:05:25,125 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 6 [2024-11-09 06:05:25,144 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 6 [2024-11-09 06:05:25,158 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 6 [2024-11-09 06:05:25,182 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 6 [2024-11-09 06:05:25,209 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 6 [2024-11-09 06:05:25,232 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 6 [2024-11-09 06:05:25,280 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 6 [2024-11-09 06:05:25,293 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 6 [2024-11-09 06:05:25,312 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 6 [2024-11-09 06:05:25,330 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 6 [2024-11-09 06:05:25,350 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 6 [2024-11-09 06:05:25,413 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 6 [2024-11-09 06:05:25,428 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 6 [2024-11-09 06:05:25,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 8 treesize of output 6 [2024-11-09 06:05:25,476 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 6 [2024-11-09 06:05:25,492 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 6 [2024-11-09 06:05:25,507 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 6 [2024-11-09 06:05:25,548 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 6 [2024-11-09 06:05:25,567 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 6 [2024-11-09 06:05:25,581 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 6 [2024-11-09 06:05:25,612 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 6 [2024-11-09 06:05:25,642 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 6 [2024-11-09 06:05:25,661 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 6 [2024-11-09 06:05:25,934 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 6 [2024-11-09 06:05:25,952 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 6 [2024-11-09 06:05:25,964 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 6 [2024-11-09 06:05:25,975 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 6 [2024-11-09 06:05:25,987 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 6 [2024-11-09 06:05:25,999 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 6 [2024-11-09 06:05:26,019 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 6 [2024-11-09 06:05:26,054 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 6 [2024-11-09 06:05:26,068 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 6 [2024-11-09 06:05:26,080 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 6 [2024-11-09 06:05:26,094 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 6 [2024-11-09 06:05:26,120 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 6 [2024-11-09 06:05:26,138 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 6 [2024-11-09 06:05:26,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 8 treesize of output 6 [2024-11-09 06:05:26,166 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 6 [2024-11-09 06:05:26,189 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 6 [2024-11-09 06:05:26,202 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 6 [2024-11-09 06:05:26,223 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 6 [2024-11-09 06:05:26,245 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 6 [2024-11-09 06:05:26,264 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 6 [2024-11-09 06:05:26,284 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 6 [2024-11-09 06:05:26,293 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 6 [2024-11-09 06:05:26,316 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 6 [2024-11-09 06:05:26,330 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 6 [2024-11-09 06:05:26,347 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 6 [2024-11-09 06:05:26,360 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 6 [2024-11-09 06:05:26,377 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 6 [2024-11-09 06:05:26,394 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 6 [2024-11-09 06:05:26,420 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 6 [2024-11-09 06:05:26,437 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 6 [2024-11-09 06:05:26,453 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 6 [2024-11-09 06:05:26,467 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 6 [2024-11-09 06:05:26,486 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 6 [2024-11-09 06:05:26,503 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 6 [2024-11-09 06:05:26,516 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 6 [2024-11-09 06:05:26,533 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 6 [2024-11-09 06:05:26,550 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 6 [2024-11-09 06:05:26,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 8 treesize of output 6 [2024-11-09 06:05:26,582 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 6 [2024-11-09 06:05:26,759 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 6 [2024-11-09 06:05:26,772 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 6 [2024-11-09 06:05:26,786 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 6 [2024-11-09 06:05:26,799 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 6 [2024-11-09 06:05:26,812 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 6 [2024-11-09 06:05:26,819 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 6 [2024-11-09 06:05:26,834 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 6 [2024-11-09 06:05:26,850 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 6 [2024-11-09 06:05:26,863 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 6 [2024-11-09 06:05:26,876 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 6 [2024-11-09 06:05:26,883 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 6 [2024-11-09 06:05:26,914 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 6 [2024-11-09 06:05:26,922 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 6 [2024-11-09 06:05:26,940 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 6 [2024-11-09 06:05:26,958 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 6 [2024-11-09 06:05:26,963 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 6 [2024-11-09 06:05:26,975 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 6 [2024-11-09 06:05:26,987 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 6 [2024-11-09 06:05:27,004 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 6 [2024-11-09 06:05:27,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:05:27,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:27,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 23 [2024-11-09 06:05:27,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:05:27,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:27,217 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 23 treesize of output 4 [2024-11-09 06:05:27,220 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 [2024-11-09 06:05:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:05:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122213823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:05:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290556293] [2024-11-09 06:05:28,067 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2024-11-09 06:05:28,067 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:05:28,067 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:05:28,068 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:05:28,068 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:05:29,901 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 23 for LOIs [2024-11-09 06:05:29,905 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:07:16,227 WARN L286 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 187 DAG size of output: 170 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:07:51,888 WARN L286 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 198 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:08:14,176 WARN L286 SmtUtils]: Spent 9.13s on a formula simplification. DAG size of input: 202 DAG size of output: 180 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:08:42,937 WARN L286 SmtUtils]: Spent 9.40s on a formula simplification. DAG size of input: 201 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:09:09,559 WARN L286 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 207 DAG size of output: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:09:45,345 WARN L286 SmtUtils]: Spent 10.84s on a formula simplification. DAG size of input: 205 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:10:28,210 WARN L286 SmtUtils]: Spent 12.41s on a formula simplification. DAG size of input: 210 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:10:31,653 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7013#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2|) 1) (<= 12 (select |#length| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2|)) (not (= |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2| 0)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2|) 8) 1)))))' at error location [2024-11-09 06:10:31,653 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:10:31,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:10:31,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 43 [2024-11-09 06:10:31,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674466231] [2024-11-09 06:10:31,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:10:31,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 06:10:31,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:10:31,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 06:10:31,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3937, Unknown=88, NotChecked=810, Total=5256 [2024-11-09 06:10:31,657 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:10:42,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:10:58,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:00,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:03,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:14,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:17,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:18,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse0 (not .cse9)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or .cse0 (and (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1062 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062))) (or (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_4 8) 1)) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54)))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1062 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_4 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54)))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_54 Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 8) 1)) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) 1) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062))) (or (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (not (= (select v_arrayElimArr_4 8) 1)) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54))))) (or (and (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_prenex_17 Int) (v_arrayElimCell_55 Int)) (or (forall ((v_prenex_16 (Array Int Int))) (or (not (= (select v_prenex_16 8) 1)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) (= v_prenex_17 v_arrayElimCell_55))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_prenex_17 Int) (v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select v_prenex_16 8) 1)) (= v_prenex_17 v_arrayElimCell_55) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) .cse0) (or .cse9 (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (not (= (select v_arrayElimArr_4 8) 1)) (= (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (forall ((v_arrayElimCell_54 Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 8) 1)) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (let ((.cse12 (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse9 (and (forall ((v_ArrVal_1052 (Array Int Int))) (or (forall ((v_prenex_17 Int)) (or (forall ((v_prenex_16 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select v_prenex_16 8) 1)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((v_prenex_17 Int)) (or (forall ((v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_prenex_16 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))))))) (or .cse0 (forall ((v_prenex_17 Int) (v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select v_prenex_16 8) 1)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (= v_prenex_17 v_arrayElimCell_55) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17)))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1065 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (not (= (select v_arrayElimArr_4 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_54)))) .cse0) (or .cse9 (and (forall ((v_ArrVal_1052 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_4 8) 1)) (= (select (select (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_54 Int)) (or (not (= (select v_arrayElimArr_4 8) 1)) (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1062))) (or (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1055) v_arrayElimCell_54 v_ArrVal_1062) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1065) v_arrayElimCell_47 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)))))) (forall ((v_ArrVal_1052 (Array Int Int))) (or (forall ((v_prenex_17 Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (forall ((v_prenex_16 (Array Int Int))) (or (not (= (select v_prenex_16 8) 1)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) v_arrayElimCell_55 v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))) (= v_prenex_17 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)))) (or .cse9 (forall ((v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1052) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_17 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_prenex_16 8) 1)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1052 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1052)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17)))) (let ((.cse19 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse19 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 (+ .cse19 8)) 1)) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))))) is different from false [2024-11-09 06:11:33,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:43,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:57,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:11:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:11:58,740 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2024-11-09 06:11:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-09 06:11:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 06:11:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:11:58,742 INFO L225 Difference]: With dead ends: 195 [2024-11-09 06:11:58,742 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 06:11:58,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 357.3s TimeCoverageRelationStatistics Valid=1135, Invalid=9379, Unknown=226, NotChecked=1470, Total=12210 [2024-11-09 06:11:58,746 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 374 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 122 mSolverCounterUnsat, 167 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 167 IncrementalHoareTripleChecker+Unknown, 1112 IncrementalHoareTripleChecker+Unchecked, 34.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:11:58,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 409 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 628 Invalid, 167 Unknown, 1112 Unchecked, 34.6s Time] [2024-11-09 06:11:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 06:11:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-09 06:11:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.0596026490066226) internal successors, (160), 151 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2024-11-09 06:11:58,752 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 37 [2024-11-09 06:11:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:11:58,752 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2024-11-09 06:11:58,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:11:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2024-11-09 06:11:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 06:11:58,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:11:58,754 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2024-11-09 06:11:58,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:11:58,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 06:11:58,956 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 06:11:58,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:11:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1495368265, now seen corresponding path program 1 times [2024-11-09 06:11:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:11:58,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57566302] [2024-11-09 06:11:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:11:58,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:11:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:01,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:12:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57566302] [2024-11-09 06:12:01,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57566302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:12:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295045217] [2024-11-09 06:12:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:12:01,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:12:01,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:12:01,234 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:12:01,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85db4ba1-ecbf-4b24-aad0-ddc044bdcc76/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:12:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:12:01,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-09 06:12:01,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:12:01,444 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 [2024-11-09 06:12:01,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:12:01,572 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:12:01,572 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 [2024-11-09 06:12:01,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:12:01,649 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 [2024-11-09 06:12:01,666 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 15 treesize of output 1 [2024-11-09 06:12:01,905 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:12:01,906 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 41 treesize of output 38 [2024-11-09 06:12:01,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 24 treesize of output 11 [2024-11-09 06:12:01,950 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 16 treesize of output 8 [2024-11-09 06:12:02,033 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 16 treesize of output 11 [2024-11-09 06:12:02,096 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 06:12:02,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 06:12:02,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-09 06:12:02,189 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:12:02,215 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 16 treesize of output 11 [2024-11-09 06:12:02,226 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 15 treesize of output 1 [2024-11-09 06:12:02,425 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:12:02,425 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2024-11-09 06:12:02,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2024-11-09 06:12:02,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2024-11-09 06:12:02,470 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 12 [2024-11-09 06:12:02,482 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 15 treesize of output 7 [2024-11-09 06:12:02,556 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 16 treesize of output 11 [2024-11-09 06:12:02,628 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 19 treesize of output 18 [2024-11-09 06:12:02,904 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:12:02,904 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 11 treesize of output 11 [2024-11-09 06:12:02,986 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 15 treesize of output 1 [2024-11-09 06:12:03,000 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 [2024-11-09 06:12:03,007 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:12:03,219 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:12:03,220 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 06:12:03,245 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-09 06:12:03,245 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2024-11-09 06:12:03,262 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 24 treesize of output 11 [2024-11-09 06:12:03,391 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 31 treesize of output 19 [2024-11-09 06:12:03,405 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 7 treesize of output 3 [2024-11-09 06:12:03,552 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:12:03,553 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2024-11-09 06:12:03,630 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 06:12:03,630 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2024-11-09 06:12:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:12:03,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:12:04,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:04,112 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 17 treesize of output 21 [2024-11-09 06:12:04,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1287 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1289) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1287) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_16) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1) (not (= (select v_arrayElimArr_16 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1288) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 8)) 1)))) is different from false [2024-11-09 06:12:04,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1287 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1289) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1287) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_16) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1) (not (= (select v_arrayElimArr_16 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1288) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) 1))))) is different from false [2024-11-09 06:12:04,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:04,305 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 33 treesize of output 34 [2024-11-09 06:12:04,315 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 60 treesize of output 52 [2024-11-09 06:12:04,328 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 24 treesize of output 22 [2024-11-09 06:12:04,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:04,346 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 23 treesize of output 24 [2024-11-09 06:12:04,361 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 41 treesize of output 33 [2024-11-09 06:12:04,372 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 26 [2024-11-09 06:12:06,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:06,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 116 treesize of output 134 [2024-11-09 06:12:06,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:06,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 105 treesize of output 112 [2024-11-09 06:12:06,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:06,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 95 treesize of output 102 [2024-11-09 06:12:07,179 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 6 [2024-11-09 06:12:07,265 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 [2024-11-09 06:12:07,301 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 6 [2024-11-09 06:12:07,345 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 [2024-11-09 06:12:08,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_147| Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1278) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_147|) (< |v_ULTIMATE.start_main_~end~0#1.offset_147| 0) (forall ((v_arrayElimArr_20 (Array Int Int))) (or (forall ((v_prenex_562 Int) (v_prenex_563 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1279) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= v_prenex_562 .cse1) (= (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1280) .cse1 v_arrayElimArr_20) v_prenex_562 v_prenex_563) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_563 8) 1))))) (not (= (select v_arrayElimArr_20 (+ |v_ULTIMATE.start_main_~end~0#1.offset_147| 8)) 1)))))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_147| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_26| Int) (v_ArrVal_1289 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_arrayElimCell_290 Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1279) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| .cse0 v_ArrVal_1280) .cse4 v_arrayElimArr_19))) (or (= (select (select (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1289) v_arrayElimCell_290 v_arrayElimArr_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_26|) (not (= (select v_arrayElimArr_16 8) 1)) (not (= (select v_arrayElimArr_19 (+ |v_ULTIMATE.start_main_~end~0#1.offset_147| 8)) 1)) (= (select (select (store .cse3 |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_arrayElimArr_16) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1278) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_147|) (< |v_ULTIMATE.start_main_~end~0#1.offset_147| 0))))) is different from false [2024-11-09 06:12:08,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:08,521 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 220 treesize of output 189 [2024-11-09 06:12:08,530 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 301 treesize of output 277 [2024-11-09 06:12:08,540 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 263 treesize of output 257 [2024-11-09 06:12:08,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:08,559 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 257 treesize of output 250 [2024-11-09 06:12:08,570 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 271 treesize of output 259 [2024-11-09 06:12:08,582 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 263 treesize of output 261 [2024-11-09 06:12:08,591 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 261 treesize of output 257 [2024-11-09 06:12:08,602 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 257 treesize of output 255 [2024-11-09 06:12:39,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:12:39,115 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 793 treesize of output 650 [2024-11-09 06:12:39,137 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 1177 treesize of output 1097 [2024-11-09 06:12:39,165 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 1053 treesize of output 1045 [2024-11-09 06:12:39,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 1045 treesize of output 1037 [2024-11-09 06:12:43,667 INFO L349 Elim1Store]: treesize reduction 4, result has 99.5 percent of original size [2024-11-09 06:12:43,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 1044 treesize of output 1826 [2024-11-09 06:12:44,079 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 1070 treesize of output 1040 [2024-11-09 06:12:44,222 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 1064 treesize of output 1034 [2024-11-09 06:12:44,349 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 1058 treesize of output 1030 [2024-11-09 06:12:44,487 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 1054 treesize of output 1024