./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/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_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/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_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:36:18,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:36:18,226 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:36:18,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:36:18,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:36:18,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:36:18,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:36:18,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:36:18,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:36:18,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:36:18,266 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:36:18,267 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:36:18,267 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:36:18,268 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:36:18,268 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:36:18,269 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:36:18,269 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:36:18,270 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:36:18,270 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:36:18,271 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:36:18,271 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:36:18,272 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:36:18,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:36:18,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:36:18,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:36:18,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:36:18,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:36:18,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:36:18,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:36:18,276 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:36:18,276 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:36:18,276 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:36:18,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:36:18,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:36:18,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:36:18,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:36:18,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:36:18,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:36:18,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:36:18,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:36:18,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:36:18,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:36:18,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:36:18,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:36:18,282 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:36:18,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:36:18,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:36:18,283 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:36:18,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:36:18,283 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_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/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_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-09 05:36:18,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:36:18,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:36:18,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:36:18,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:36:18,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:36:18,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i Unable to find full path for "g++" [2024-11-09 05:36:20,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:36:20,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:36:20,963 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2024-11-09 05:36:20,995 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/data/a1ec44f48/bb70bbea3e2d4c7e8a47594619ca5d8e/FLAG20346d021 [2024-11-09 05:36:21,027 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/data/a1ec44f48/bb70bbea3e2d4c7e8a47594619ca5d8e [2024-11-09 05:36:21,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:36:21,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:36:21,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:36:21,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:36:21,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:36:21,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:36:21" (1/1) ... [2024-11-09 05:36:21,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd1803a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:21, skipping insertion in model container [2024-11-09 05:36:21,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:36:21" (1/1) ... [2024-11-09 05:36:21,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:36:21,755 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,812 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,820 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,828 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,841 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,888 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,888 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,895 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,895 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:36:21,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:36:21,932 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:36:22,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:36:22,154 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:36:22,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22 WrapperNode [2024-11-09 05:36:22,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:36:22,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:36:22,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:36:22,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:36:22,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,255 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-09 05:36:22,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:36:22,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:36:22,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:36:22,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:36:22,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:36:22,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:36:22,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:36:22,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:36:22,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (1/1) ... [2024-11-09 05:36:22,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:36:22,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:36:22,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:36:22,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:36:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 05:36:22,540 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 05:36:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:36:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:36:22,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:36:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:36:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:36:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:36:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:36:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:36:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:36:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:36:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:36:22,803 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:36:22,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:36:22,809 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 05:36:25,481 INFO L? ?]: Removed 1024 outVars from TransFormulas that were not future-live. [2024-11-09 05:36:25,482 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:36:27,193 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:36:27,194 INFO L316 CfgBuilder]: Removed 50 assume(true) statements. [2024-11-09 05:36:27,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:36:27 BoogieIcfgContainer [2024-11-09 05:36:27,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:36:27,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:36:27,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:36:27,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:36:27,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:36:21" (1/3) ... [2024-11-09 05:36:27,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b5b8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:36:27, skipping insertion in model container [2024-11-09 05:36:27,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:36:22" (2/3) ... [2024-11-09 05:36:27,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b5b8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:36:27, skipping insertion in model container [2024-11-09 05:36:27,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:36:27" (3/3) ... [2024-11-09 05:36:27,206 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-1.i [2024-11-09 05:36:27,259 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:36:27,260 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-09 05:36:27,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:36:27,356 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;@3a86ee56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:36:27,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-09 05:36:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 777 states, 355 states have (on average 2.4704225352112674) internal successors, (877), 772 states have internal predecessors, (877), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:36:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:36:27,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:27,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:36:27,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:36:27,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2017653, now seen corresponding path program 1 times [2024-11-09 05:36:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921061169] [2024-11-09 05:36:27,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:27,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:27,654 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 05:36:27,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:36:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921061169] [2024-11-09 05:36:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921061169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:36:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:36:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:36:27,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844613747] [2024-11-09 05:36:27,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:36:27,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:36:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:36:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:36:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:36:27,711 INFO L87 Difference]: Start difference. First operand has 777 states, 355 states have (on average 2.4704225352112674) internal successors, (877), 772 states have internal predecessors, (877), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 05:36:29,974 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 [] [2024-11-09 05:36:32,019 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 [] [2024-11-09 05:36:34,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:36:34,842 INFO L93 Difference]: Finished difference Result 764 states and 816 transitions. [2024-11-09 05:36:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:36:34,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-09 05:36:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:36:34,858 INFO L225 Difference]: With dead ends: 764 [2024-11-09 05:36:34,859 INFO L226 Difference]: Without dead ends: 763 [2024-11-09 05:36:34,860 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 05:36:34,864 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 708 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:36:34,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 451 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 450 Invalid, 3 Unknown, 0 Unchecked, 7.0s Time] [2024-11-09 05:36:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-09 05:36:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2024-11-09 05:36:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 358 states have (on average 2.2597765363128492) internal successors, (809), 758 states have internal predecessors, (809), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:36:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 815 transitions. [2024-11-09 05:36:34,955 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 815 transitions. Word has length 3 [2024-11-09 05:36:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:36:34,956 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 815 transitions. [2024-11-09 05:36:34,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 05:36:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 815 transitions. [2024-11-09 05:36:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:36:34,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:34,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:36:34,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:36:34,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:36:34,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:34,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2017654, now seen corresponding path program 1 times [2024-11-09 05:36:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:34,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455215390] [2024-11-09 05:36:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:35,120 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 05:36:35,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:36:35,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455215390] [2024-11-09 05:36:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455215390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:36:35,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:36:35,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:36:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281036574] [2024-11-09 05:36:35,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:36:35,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:36:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:36:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:36:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:36:35,126 INFO L87 Difference]: Start difference. First operand 763 states and 815 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 05:36:38,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:40,264 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 [] [2024-11-09 05:36:42,305 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 [] [2024-11-09 05:36:44,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:46,328 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 [] [2024-11-09 05:36:49,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:51,407 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 [] [2024-11-09 05:36:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:36:51,742 INFO L93 Difference]: Finished difference Result 956 states and 1031 transitions. [2024-11-09 05:36:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:36:51,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-09 05:36:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:36:51,746 INFO L225 Difference]: With dead ends: 956 [2024-11-09 05:36:51,747 INFO L226 Difference]: Without dead ends: 956 [2024-11-09 05:36:51,747 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 05:36:51,749 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 216 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 6 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:36:51,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1025 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 576 Invalid, 7 Unknown, 0 Unchecked, 16.6s Time] [2024-11-09 05:36:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-09 05:36:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 870. [2024-11-09 05:36:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 466 states have (on average 2.1931330472103006) internal successors, (1022), 865 states have internal predecessors, (1022), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:36:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1028 transitions. [2024-11-09 05:36:51,776 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1028 transitions. Word has length 3 [2024-11-09 05:36:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:36:51,777 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1028 transitions. [2024-11-09 05:36:51,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 05:36:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1028 transitions. [2024-11-09 05:36:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:36:51,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:51,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:36:51,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:36:51,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:36:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2019630, now seen corresponding path program 1 times [2024-11-09 05:36:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:51,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491203003] [2024-11-09 05:36:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:52,005 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 05:36:52,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:36:52,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491203003] [2024-11-09 05:36:52,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491203003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:36:52,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:36:52,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:36:52,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038263919] [2024-11-09 05:36:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:36:52,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:36:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:36:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:36:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:36:52,009 INFO L87 Difference]: Start difference. First operand 870 states and 1028 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 05:36:55,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:57,054 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 [] [2024-11-09 05:36:59,061 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 [] [2024-11-09 05:37:01,107 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 [] [2024-11-09 05:37:03,111 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 [] [2024-11-09 05:37:05,716 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 [] [2024-11-09 05:37:07,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:09,745 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 [] [2024-11-09 05:37:11,748 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 [] [2024-11-09 05:37:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:12,194 INFO L93 Difference]: Finished difference Result 957 states and 1031 transitions. [2024-11-09 05:37:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:37:12,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-09 05:37:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:12,202 INFO L225 Difference]: With dead ends: 957 [2024-11-09 05:37:12,204 INFO L226 Difference]: Without dead ends: 955 [2024-11-09 05:37:12,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:37:12,207 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 217 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:12,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1415 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 989 Invalid, 9 Unknown, 0 Unchecked, 20.1s Time] [2024-11-09 05:37:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-09 05:37:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 870. [2024-11-09 05:37:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 466 states have (on average 2.188841201716738) internal successors, (1020), 865 states have internal predecessors, (1020), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:37:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1026 transitions. [2024-11-09 05:37:12,244 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1026 transitions. Word has length 3 [2024-11-09 05:37:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:12,244 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1026 transitions. [2024-11-09 05:37:12,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 05:37:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1026 transitions. [2024-11-09 05:37:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:37:12,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:12,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:37:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:37:12,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:37:12,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -21578373, now seen corresponding path program 1 times [2024-11-09 05:37:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:37:12,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040499322] [2024-11-09 05:37:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:12,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:37:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:12,428 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 05:37:12,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:37:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040499322] [2024-11-09 05:37:12,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040499322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:37:12,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:37:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:37:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725524920] [2024-11-09 05:37:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:37:12,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:37:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:12,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:37:12,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:37:12,432 INFO L87 Difference]: Start difference. First operand 870 states and 1026 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 05:37:14,640 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 [] [2024-11-09 05:37:16,682 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 [] [2024-11-09 05:37:18,731 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 [] [2024-11-09 05:37:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:19,818 INFO L93 Difference]: Finished difference Result 859 states and 1014 transitions. [2024-11-09 05:37:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:37:19,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-09 05:37:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:19,826 INFO L225 Difference]: With dead ends: 859 [2024-11-09 05:37:19,827 INFO L226 Difference]: Without dead ends: 859 [2024-11-09 05:37:19,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:37:19,828 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 781 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 17 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:19,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 225 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 657 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2024-11-09 05:37:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-09 05:37:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2024-11-09 05:37:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 466 states have (on average 2.163090128755365) internal successors, (1008), 854 states have internal predecessors, (1008), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:37:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1014 transitions. [2024-11-09 05:37:19,854 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1014 transitions. Word has length 6 [2024-11-09 05:37:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:19,855 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1014 transitions. [2024-11-09 05:37:19,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 05:37:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1014 transitions. [2024-11-09 05:37:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:37:19,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:19,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:37:19,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:37:19,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:37:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash -668929584, now seen corresponding path program 1 times [2024-11-09 05:37:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:37:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305581584] [2024-11-09 05:37:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:37:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:19,931 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 05:37:19,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:37:19,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305581584] [2024-11-09 05:37:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305581584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:37:19,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:37:19,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:37:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109653051] [2024-11-09 05:37:19,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:37:19,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:37:19,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:19,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:37:19,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:37:19,936 INFO L87 Difference]: Start difference. First operand 859 states and 1014 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 05:37:22,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:23,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:25,994 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 [] [2024-11-09 05:37:28,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:30,031 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 [] [2024-11-09 05:37:32,044 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 [] [2024-11-09 05:37:34,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:35,316 INFO L93 Difference]: Finished difference Result 897 states and 969 transitions. [2024-11-09 05:37:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:37:35,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 05:37:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:35,320 INFO L225 Difference]: With dead ends: 897 [2024-11-09 05:37:35,321 INFO L226 Difference]: Without dead ends: 897 [2024-11-09 05:37:35,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:37:35,327 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 676 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:35,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 657 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 574 Invalid, 5 Unknown, 0 Unchecked, 15.3s Time] [2024-11-09 05:37:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-09 05:37:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 812. [2024-11-09 05:37:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 466 states have (on average 2.0622317596566524) internal successors, (961), 807 states have internal predecessors, (961), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:37:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 967 transitions. [2024-11-09 05:37:35,347 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 967 transitions. Word has length 7 [2024-11-09 05:37:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:35,348 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 967 transitions. [2024-11-09 05:37:35,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 05:37:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 967 transitions. [2024-11-09 05:37:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:37:35,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:35,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:37:35,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:37:35,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:37:35,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash -668929583, now seen corresponding path program 1 times [2024-11-09 05:37:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:37:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520413409] [2024-11-09 05:37:35,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:35,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:37:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:35,453 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 05:37:35,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:37:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520413409] [2024-11-09 05:37:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520413409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:37:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:37:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:37:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574888340] [2024-11-09 05:37:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:37:35,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:37:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:37:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:37:35,457 INFO L87 Difference]: Start difference. First operand 812 states and 967 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 05:37:36,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:38,984 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 [] [2024-11-09 05:37:41,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:43,027 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 [] [2024-11-09 05:37:45,037 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 [] [2024-11-09 05:37:47,337 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 [] [2024-11-09 05:37:49,365 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 [] [2024-11-09 05:37:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:49,641 INFO L93 Difference]: Finished difference Result 984 states and 1161 transitions. [2024-11-09 05:37:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:37:49,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 05:37:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:49,644 INFO L225 Difference]: With dead ends: 984 [2024-11-09 05:37:49,645 INFO L226 Difference]: Without dead ends: 984 [2024-11-09 05:37:49,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:37:49,646 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 499 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 26 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:49,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 853 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 519 Invalid, 6 Unknown, 0 Unchecked, 14.1s Time] [2024-11-09 05:37:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-09 05:37:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 787. [2024-11-09 05:37:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 466 states have (on average 2.0085836909871246) internal successors, (936), 782 states have internal predecessors, (936), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:37:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 942 transitions. [2024-11-09 05:37:49,667 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 942 transitions. Word has length 7 [2024-11-09 05:37:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:49,667 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 942 transitions. [2024-11-09 05:37:49,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 05:37:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 942 transitions. [2024-11-09 05:37:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:37:49,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:49,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:37:49,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:37:49,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:37:49,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash 538357402, now seen corresponding path program 1 times [2024-11-09 05:37:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:37:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734047665] [2024-11-09 05:37:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:37:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:49,741 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 05:37:49,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:37:49,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734047665] [2024-11-09 05:37:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734047665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:37:49,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:37:49,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:37:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787615030] [2024-11-09 05:37:49,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:37:49,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:37:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:37:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:37:49,745 INFO L87 Difference]: Start difference. First operand 787 states and 942 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:37:51,925 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 [] [2024-11-09 05:37:53,947 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 [] [2024-11-09 05:37:55,949 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 [] [2024-11-09 05:37:57,985 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 [] [2024-11-09 05:37:59,989 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 [] [2024-11-09 05:38:01,992 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 [] [2024-11-09 05:38:04,004 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 [] [2024-11-09 05:38:06,007 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 [] [2024-11-09 05:38:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:06,491 INFO L93 Difference]: Finished difference Result 772 states and 904 transitions. [2024-11-09 05:38:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:38:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:38:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:06,495 INFO L225 Difference]: With dead ends: 772 [2024-11-09 05:38:06,499 INFO L226 Difference]: Without dead ends: 772 [2024-11-09 05:38:06,499 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 05:38:06,500 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 680 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 29 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:06,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 682 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 719 Invalid, 8 Unknown, 0 Unchecked, 16.7s Time] [2024-11-09 05:38:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-09 05:38:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 764. [2024-11-09 05:38:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 466 states have (on average 1.909871244635193) internal successors, (890), 759 states have internal predecessors, (890), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:38:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 896 transitions. [2024-11-09 05:38:06,517 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 896 transitions. Word has length 14 [2024-11-09 05:38:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:06,518 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 896 transitions. [2024-11-09 05:38:06,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 896 transitions. [2024-11-09 05:38:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:38:06,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:06,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:38:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:38:06,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:38:06,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash 538357403, now seen corresponding path program 1 times [2024-11-09 05:38:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:38:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466876056] [2024-11-09 05:38:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:38:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:06,686 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 05:38:06,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:38:06,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466876056] [2024-11-09 05:38:06,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466876056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:38:06,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:38:06,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:38:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204590065] [2024-11-09 05:38:06,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:38:06,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:38:06,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:38:06,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:38:06,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:38:06,691 INFO L87 Difference]: Start difference. First operand 764 states and 896 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:08,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:10,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:12,810 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 [] [2024-11-09 05:38:14,813 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 [] [2024-11-09 05:38:16,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:18,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:20,845 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 [] [2024-11-09 05:38:24,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:26,416 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 [] [2024-11-09 05:38:28,419 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 [] [2024-11-09 05:38:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:28,752 INFO L93 Difference]: Finished difference Result 805 states and 869 transitions. [2024-11-09 05:38:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:38:28,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 05:38:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:28,756 INFO L225 Difference]: With dead ends: 805 [2024-11-09 05:38:28,756 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 05:38:28,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:38:28,758 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 200 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 15 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:28,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1186 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 899 Invalid, 9 Unknown, 0 Unchecked, 22.0s Time] [2024-11-09 05:38:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 05:38:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 754. [2024-11-09 05:38:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 456 states have (on average 1.8793859649122806) internal successors, (857), 749 states have internal predecessors, (857), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:38:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 863 transitions. [2024-11-09 05:38:28,780 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 863 transitions. Word has length 14 [2024-11-09 05:38:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:28,787 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 863 transitions. [2024-11-09 05:38:28,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:38:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 863 transitions. [2024-11-09 05:38:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:38:28,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:28,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:38:28,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:38:28,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:38:28,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:28,793 INFO L85 PathProgramCache]: Analyzing trace with hash -484018869, now seen corresponding path program 1 times [2024-11-09 05:38:28,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:38:28,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903239688] [2024-11-09 05:38:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:38:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:28,851 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 05:38:28,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:38:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903239688] [2024-11-09 05:38:28,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903239688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:38:28,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:38:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:38:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594270416] [2024-11-09 05:38:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:38:28,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:38:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:38:28,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:38:28,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:38:28,854 INFO L87 Difference]: Start difference. First operand 754 states and 863 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 05:38:31,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:33,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:35,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:37,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:39,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:41,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:43,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:45,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:45,672 INFO L93 Difference]: Finished difference Result 739 states and 834 transitions. [2024-11-09 05:38:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:38:45,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:38:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:45,675 INFO L225 Difference]: With dead ends: 739 [2024-11-09 05:38:45,675 INFO L226 Difference]: Without dead ends: 739 [2024-11-09 05:38:45,675 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 05:38:45,676 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 67 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 16 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:45,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1668 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 16.8s Time] [2024-11-09 05:38:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-09 05:38:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 733. [2024-11-09 05:38:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 442 states have (on average 1.8597285067873304) internal successors, (822), 728 states have internal predecessors, (822), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:38:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 828 transitions. [2024-11-09 05:38:45,691 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 828 transitions. Word has length 15 [2024-11-09 05:38:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:45,691 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 828 transitions. [2024-11-09 05:38:45,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 05:38:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 828 transitions. [2024-11-09 05:38:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:38:45,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:45,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:38:45,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:38:45,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:38:45,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1289790689, now seen corresponding path program 1 times [2024-11-09 05:38:45,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:38:45,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593614348] [2024-11-09 05:38:45,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:45,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:38:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:45,752 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 05:38:45,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:38:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593614348] [2024-11-09 05:38:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593614348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:38:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:38:45,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:38:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607697009] [2024-11-09 05:38:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:38:45,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:38:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:38:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:38:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:38:45,754 INFO L87 Difference]: Start difference. First operand 733 states and 828 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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 05:38:48,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:50,434 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 [] [2024-11-09 05:38:52,437 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 [] [2024-11-09 05:38:53,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:56,502 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 [] [2024-11-09 05:38:58,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:58,353 INFO L93 Difference]: Finished difference Result 754 states and 811 transitions. [2024-11-09 05:38:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:38:58,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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 05:38:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:58,356 INFO L225 Difference]: With dead ends: 754 [2024-11-09 05:38:58,356 INFO L226 Difference]: Without dead ends: 754 [2024-11-09 05:38:58,356 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 05:38:58,357 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 670 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 28 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:58,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 873 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 838 Invalid, 4 Unknown, 0 Unchecked, 12.6s Time] [2024-11-09 05:38:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-09 05:38:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 710. [2024-11-09 05:38:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 442 states have (on average 1.8076923076923077) internal successors, (799), 705 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:38:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 805 transitions. [2024-11-09 05:38:58,371 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 805 transitions. Word has length 16 [2024-11-09 05:38:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:58,371 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 805 transitions. [2024-11-09 05:38:58,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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 05:38:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 805 transitions. [2024-11-09 05:38:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:38:58,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:58,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:38:58,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:38:58,373 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:38:58,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1289790690, now seen corresponding path program 1 times [2024-11-09 05:38:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:38:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562983819] [2024-11-09 05:38:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:38:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:58,453 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 05:38:58,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:38:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562983819] [2024-11-09 05:38:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562983819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:38:58,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:38:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:38:58,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748587905] [2024-11-09 05:38:58,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:38:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:38:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:38:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:38:58,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:38:58,456 INFO L87 Difference]: Start difference. First operand 710 states and 805 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 05:39:00,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:02,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:04,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:06,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:39:07,301 INFO L93 Difference]: Finished difference Result 682 states and 775 transitions. [2024-11-09 05:39:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:39:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 05:39:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:39:07,304 INFO L225 Difference]: With dead ends: 682 [2024-11-09 05:39:07,304 INFO L226 Difference]: Without dead ends: 682 [2024-11-09 05:39:07,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 05:39:07,305 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 51 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:39:07,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1032 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 4 Unknown, 0 Unchecked, 8.8s Time] [2024-11-09 05:39:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-09 05:39:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2024-11-09 05:39:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 426 states have (on average 1.8051643192488263) internal successors, (769), 677 states have internal predecessors, (769), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:39:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 775 transitions. [2024-11-09 05:39:07,319 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 775 transitions. Word has length 16 [2024-11-09 05:39:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:39:07,319 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 775 transitions. [2024-11-09 05:39:07,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 05:39:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 775 transitions. [2024-11-09 05:39:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:39:07,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:39:07,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:39:07,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:39:07,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:39:07,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:39:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1335575306, now seen corresponding path program 1 times [2024-11-09 05:39:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:39:07,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209904939] [2024-11-09 05:39:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:07,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:39:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:07,414 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 05:39:07,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:39:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209904939] [2024-11-09 05:39:07,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209904939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:39:07,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:39:07,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:39:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545720931] [2024-11-09 05:39:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:39:07,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:39:07,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:39:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:39:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:39:07,416 INFO L87 Difference]: Start difference. First operand 682 states and 775 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:39:09,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:11,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:14,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:16,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:18,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:39:18,676 INFO L93 Difference]: Finished difference Result 671 states and 757 transitions. [2024-11-09 05:39:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:39:18,677 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), 0 states have call successors, (0), 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 17 [2024-11-09 05:39:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:39:18,679 INFO L225 Difference]: With dead ends: 671 [2024-11-09 05:39:18,679 INFO L226 Difference]: Without dead ends: 671 [2024-11-09 05:39:18,679 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 05:39:18,680 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 38 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 15 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:39:18,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1513 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 243 Invalid, 5 Unknown, 0 Unchecked, 11.2s Time] [2024-11-09 05:39:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-09 05:39:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 668. [2024-11-09 05:39:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 419 states have (on average 1.7852028639618138) internal successors, (748), 663 states have internal predecessors, (748), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:39:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 754 transitions. [2024-11-09 05:39:18,693 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 754 transitions. Word has length 17 [2024-11-09 05:39:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:39:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 754 transitions. [2024-11-09 05:39:18,693 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), 0 states have call successors, (0), 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 05:39:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 754 transitions. [2024-11-09 05:39:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 05:39:18,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:39:18,694 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 05:39:18,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:39:18,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr339REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:39:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:39:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1008225209, now seen corresponding path program 1 times [2024-11-09 05:39:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:39:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075427091] [2024-11-09 05:39:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:39:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:18,752 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 05:39:18,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:39:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075427091] [2024-11-09 05:39:18,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075427091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:39:18,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:39:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:39:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371957852] [2024-11-09 05:39:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:39:18,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:39:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:39:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:39:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:39:18,754 INFO L87 Difference]: Start difference. First operand 668 states and 754 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 05:39:20,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:22,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:24,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:26,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:39:26,931 INFO L93 Difference]: Finished difference Result 634 states and 716 transitions. [2024-11-09 05:39:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:39:26,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 05:39:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:39:26,933 INFO L225 Difference]: With dead ends: 634 [2024-11-09 05:39:26,933 INFO L226 Difference]: Without dead ends: 634 [2024-11-09 05:39:26,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 05:39:26,934 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 30 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:39:26,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 966 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 8.2s Time] [2024-11-09 05:39:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-09 05:39:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2024-11-09 05:39:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 397 states have (on average 1.7884130982367759) internal successors, (710), 629 states have internal predecessors, (710), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:39:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 716 transitions. [2024-11-09 05:39:26,946 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 716 transitions. Word has length 18 [2024-11-09 05:39:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:39:26,947 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 716 transitions. [2024-11-09 05:39:26,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 05:39:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 716 transitions. [2024-11-09 05:39:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:39:26,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:39:26,948 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, 1, 1] [2024-11-09 05:39:26,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:39:26,948 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:39:26,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:39:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1020829944, now seen corresponding path program 1 times [2024-11-09 05:39:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:39:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195846281] [2024-11-09 05:39:26,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:39:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:27,146 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 05:39:27,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:39:27,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195846281] [2024-11-09 05:39:27,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195846281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:39:27,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:39:27,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:39:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517105608] [2024-11-09 05:39:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:39:27,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:39:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:39:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:39:27,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:39:27,149 INFO L87 Difference]: Start difference. First operand 634 states and 716 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 05:39:29,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:31,225 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 [] [2024-11-09 05:39:33,233 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 [] [2024-11-09 05:39:35,247 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 [] [2024-11-09 05:39:37,251 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 [] [2024-11-09 05:39:39,253 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 [] [2024-11-09 05:39:41,578 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 [] [2024-11-09 05:39:43,581 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 [] [2024-11-09 05:39:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:39:43,936 INFO L93 Difference]: Finished difference Result 766 states and 861 transitions. [2024-11-09 05:39:43,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:39:43,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 05:39:43,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:39:43,939 INFO L225 Difference]: With dead ends: 766 [2024-11-09 05:39:43,939 INFO L226 Difference]: Without dead ends: 766 [2024-11-09 05:39:43,939 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 05:39:43,940 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 361 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 5 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:39:43,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1008 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 734 Invalid, 8 Unknown, 0 Unchecked, 16.8s Time] [2024-11-09 05:39:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-09 05:39:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 630. [2024-11-09 05:39:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.778337531486146) internal successors, (706), 625 states have internal predecessors, (706), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:39:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 712 transitions. [2024-11-09 05:39:43,953 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 712 transitions. Word has length 31 [2024-11-09 05:39:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:39:43,953 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 712 transitions. [2024-11-09 05:39:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 05:39:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 712 transitions. [2024-11-09 05:39:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 05:39:43,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:39:43,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:39:43,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:39:43,955 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:39:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:39:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1327795383, now seen corresponding path program 1 times [2024-11-09 05:39:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:39:43,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680733352] [2024-11-09 05:39:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:39:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:44,059 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 05:39:44,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:39:44,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680733352] [2024-11-09 05:39:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680733352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:39:44,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:39:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:39:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990008073] [2024-11-09 05:39:44,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:39:44,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:39:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:39:44,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:39:44,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:39:44,061 INFO L87 Difference]: Start difference. First operand 630 states and 712 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 05:39:46,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:48,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:50,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:39:50,900 INFO L93 Difference]: Finished difference Result 630 states and 704 transitions. [2024-11-09 05:39:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:39:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 05:39:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:39:50,903 INFO L225 Difference]: With dead ends: 630 [2024-11-09 05:39:50,903 INFO L226 Difference]: Without dead ends: 630 [2024-11-09 05:39:50,903 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 05:39:50,904 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 21 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:39:50,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1417 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 234 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2024-11-09 05:39:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-09 05:39:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-09 05:39:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.7581863979848866) internal successors, (698), 625 states have internal predecessors, (698), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:39:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 704 transitions. [2024-11-09 05:39:50,919 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 704 transitions. Word has length 43 [2024-11-09 05:39:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:39:50,920 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 704 transitions. [2024-11-09 05:39:50,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 05:39:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 704 transitions. [2024-11-09 05:39:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 05:39:50,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:39:50,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:39:50,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 05:39:50,924 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:39:50,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:39:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2019105032, now seen corresponding path program 1 times [2024-11-09 05:39:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:39:50,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854597994] [2024-11-09 05:39:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:39:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:51,075 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 05:39:51,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:39:51,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854597994] [2024-11-09 05:39:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854597994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:39:51,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:39:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:39:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275235341] [2024-11-09 05:39:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:39:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:39:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:39:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:39:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:39:51,079 INFO L87 Difference]: Start difference. First operand 630 states and 704 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 05:39:53,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:56,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:58,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:39:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:39:58,227 INFO L93 Difference]: Finished difference Result 699 states and 733 transitions. [2024-11-09 05:39:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:39:58,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-09 05:39:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:39:58,230 INFO L225 Difference]: With dead ends: 699 [2024-11-09 05:39:58,230 INFO L226 Difference]: Without dead ends: 699 [2024-11-09 05:39:58,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:39:58,231 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 68 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:39:58,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 951 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 3 Unknown, 0 Unchecked, 7.1s Time] [2024-11-09 05:39:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-09 05:39:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 689. [2024-11-09 05:39:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 456 states have (on average 1.5855263157894737) internal successors, (723), 684 states have internal predecessors, (723), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:39:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 729 transitions. [2024-11-09 05:39:58,245 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 729 transitions. Word has length 47 [2024-11-09 05:39:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:39:58,245 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 729 transitions. [2024-11-09 05:39:58,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 05:39:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 729 transitions. [2024-11-09 05:39:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 05:39:58,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:39:58,246 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, 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 05:39:58,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 05:39:58,247 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:39:58,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:39:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash -262803330, now seen corresponding path program 1 times [2024-11-09 05:39:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:39:58,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552117928] [2024-11-09 05:39:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:39:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:58,880 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 05:39:58,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:39:58,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552117928] [2024-11-09 05:39:58,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552117928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:39:58,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:39:58,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:39:58,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847872176] [2024-11-09 05:39:58,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:39:58,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:39:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:39:58,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:39:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:39:58,884 INFO L87 Difference]: Start difference. First operand 689 states and 729 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:40:00,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:02,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:05,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:07,004 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 [] [2024-11-09 05:40:09,006 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 [] [2024-11-09 05:40:11,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:13,183 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 [] [2024-11-09 05:40:15,186 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 [] [2024-11-09 05:40:17,190 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 [] [2024-11-09 05:40:19,194 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 [] [2024-11-09 05:40:21,198 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 [] [2024-11-09 05:40:23,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:25,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:27,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:40:27,371 INFO L93 Difference]: Finished difference Result 777 states and 825 transitions. [2024-11-09 05:40:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:40:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-09 05:40:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:40:27,375 INFO L225 Difference]: With dead ends: 777 [2024-11-09 05:40:27,375 INFO L226 Difference]: Without dead ends: 774 [2024-11-09 05:40:27,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:40:27,376 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 137 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 2 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:40:27,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2849 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 531 Invalid, 13 Unknown, 0 Unchecked, 28.4s Time] [2024-11-09 05:40:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-09 05:40:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 640. [2024-11-09 05:40:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 407 states have (on average 1.651105651105651) internal successors, (672), 635 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:40:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 678 transitions. [2024-11-09 05:40:27,389 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 678 transitions. Word has length 53 [2024-11-09 05:40:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:40:27,389 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 678 transitions. [2024-11-09 05:40:27,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:40:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 678 transitions. [2024-11-09 05:40:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:40:27,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:40:27,391 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, 1, 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 05:40:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:40:27,391 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:40:27,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:40:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1249538531, now seen corresponding path program 1 times [2024-11-09 05:40:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:40:27,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407695110] [2024-11-09 05:40:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:40:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:40:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:40:27,527 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 05:40:27,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:40:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407695110] [2024-11-09 05:40:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407695110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:40:27,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:40:27,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:40:27,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130560288] [2024-11-09 05:40:27,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:40:27,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:40:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:40:27,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:40:27,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:40:27,530 INFO L87 Difference]: Start difference. First operand 640 states and 678 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 05:40:29,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:31,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:34,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:36,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:38,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:40:38,445 INFO L93 Difference]: Finished difference Result 640 states and 670 transitions. [2024-11-09 05:40:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:40:38,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-09 05:40:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:40:38,447 INFO L225 Difference]: With dead ends: 640 [2024-11-09 05:40:38,447 INFO L226 Difference]: Without dead ends: 640 [2024-11-09 05:40:38,447 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 05:40:38,447 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 15 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:40:38,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1411 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2024-11-09 05:40:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-09 05:40:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2024-11-09 05:40:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 407 states have (on average 1.6314496314496314) internal successors, (664), 635 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:40:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 670 transitions. [2024-11-09 05:40:38,459 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 670 transitions. Word has length 54 [2024-11-09 05:40:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:40:38,459 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 670 transitions. [2024-11-09 05:40:38,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 05:40:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 670 transitions. [2024-11-09 05:40:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 05:40:38,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:40:38,460 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, 1, 1, 1, 1, 1, 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 05:40:38,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 05:40:38,461 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:40:38,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:40:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1096741378, now seen corresponding path program 1 times [2024-11-09 05:40:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:40:38,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298054143] [2024-11-09 05:40:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:40:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:40:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:40:38,830 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 05:40:38,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:40:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298054143] [2024-11-09 05:40:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298054143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:40:38,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:40:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:40:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721895304] [2024-11-09 05:40:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:40:38,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:40:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:40:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:40:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:40:38,832 INFO L87 Difference]: Start difference. First operand 640 states and 670 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 05:40:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:40:40,602 INFO L93 Difference]: Finished difference Result 639 states and 669 transitions. [2024-11-09 05:40:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:40:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-09 05:40:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:40:40,604 INFO L225 Difference]: With dead ends: 639 [2024-11-09 05:40:40,604 INFO L226 Difference]: Without dead ends: 639 [2024-11-09 05:40:40,605 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 05:40:40,605 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:40:40,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1306 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 05:40:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-09 05:40:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2024-11-09 05:40:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 407 states have (on average 1.628992628992629) internal successors, (663), 634 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:40:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 669 transitions. [2024-11-09 05:40:40,617 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 669 transitions. Word has length 58 [2024-11-09 05:40:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:40:40,617 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 669 transitions. [2024-11-09 05:40:40,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 05:40:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 669 transitions. [2024-11-09 05:40:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 05:40:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:40:40,619 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, 1, 1, 1, 1, 1, 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 05:40:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 05:40:40,619 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:40:40,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:40:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1096741379, now seen corresponding path program 1 times [2024-11-09 05:40:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:40:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446968549] [2024-11-09 05:40:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:40:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:40:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:40:41,311 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 05:40:41,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:40:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446968549] [2024-11-09 05:40:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446968549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:40:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:40:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:40:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580643797] [2024-11-09 05:40:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:40:41,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:40:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:40:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:40:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:40:41,314 INFO L87 Difference]: Start difference. First operand 639 states and 669 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 05:40:43,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:45,374 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 [] [2024-11-09 05:40:47,381 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 [] [2024-11-09 05:40:48,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:50,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:40:52,924 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 [] [2024-11-09 05:40:54,927 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 [] [2024-11-09 05:40:56,930 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 [] [2024-11-09 05:40:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:40:57,395 INFO L93 Difference]: Finished difference Result 638 states and 668 transitions. [2024-11-09 05:40:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:40:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-09 05:40:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:40:57,398 INFO L225 Difference]: With dead ends: 638 [2024-11-09 05:40:57,398 INFO L226 Difference]: Without dead ends: 638 [2024-11-09 05:40:57,398 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 05:40:57,399 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 1 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:40:57,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1265 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 957 Invalid, 7 Unknown, 0 Unchecked, 16.0s Time] [2024-11-09 05:40:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-09 05:40:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-09 05:40:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 406 states have (on average 1.6305418719211822) internal successors, (662), 633 states have internal predecessors, (662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:40:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 668 transitions. [2024-11-09 05:40:57,410 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 668 transitions. Word has length 58 [2024-11-09 05:40:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:40:57,411 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 668 transitions. [2024-11-09 05:40:57,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 05:40:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 668 transitions. [2024-11-09 05:40:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 05:40:57,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:40:57,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 05:40:57,412 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:40:57,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:40:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -122344952, now seen corresponding path program 1 times [2024-11-09 05:40:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:40:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354150248] [2024-11-09 05:40:57,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:40:57,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:40:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:40:57,782 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 05:40:57,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:40:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354150248] [2024-11-09 05:40:57,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354150248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:40:57,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:40:57,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:40:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748516197] [2024-11-09 05:40:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:40:57,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:40:57,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:40:57,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:40:57,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:40:57,786 INFO L87 Difference]: Start difference. First operand 638 states and 668 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:40:59,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:41:01,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:41:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:41:02,690 INFO L93 Difference]: Finished difference Result 648 states and 681 transitions. [2024-11-09 05:41:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:41:02,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-11-09 05:41:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:41:02,696 INFO L225 Difference]: With dead ends: 648 [2024-11-09 05:41:02,696 INFO L226 Difference]: Without dead ends: 648 [2024-11-09 05:41:02,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:41:02,697 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 5 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:41:02,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1796 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 996 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 05:41:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-09 05:41:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 643. [2024-11-09 05:41:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 410 states have (on average 1.6292682926829267) internal successors, (668), 637 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:41:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 677 transitions. [2024-11-09 05:41:02,718 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 677 transitions. Word has length 64 [2024-11-09 05:41:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:41:02,721 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 677 transitions. [2024-11-09 05:41:02,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:41:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 677 transitions. [2024-11-09 05:41:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 05:41:02,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:41:02,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:02,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 05:41:02,723 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:41:02,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:41:02,723 INFO L85 PathProgramCache]: Analyzing trace with hash -122344951, now seen corresponding path program 1 times [2024-11-09 05:41:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:41:02,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880650666] [2024-11-09 05:41:02,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:41:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:41:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:41:03,563 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 05:41:03,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:41:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880650666] [2024-11-09 05:41:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880650666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:41:03,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:41:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:41:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004586656] [2024-11-09 05:41:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:41:03,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:41:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:41:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:41:03,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:41:03,566 INFO L87 Difference]: Start difference. First operand 643 states and 677 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:41:05,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:41:07,640 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 [] [2024-11-09 05:41:09,644 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 [] [2024-11-09 05:41:11,646 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 [] [2024-11-09 05:41:13,649 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 [] [2024-11-09 05:41:15,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:41:17,988 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 [] [2024-11-09 05:41:19,992 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 [] [2024-11-09 05:41:21,995 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 [] [2024-11-09 05:41:23,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:41:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:41:24,202 INFO L93 Difference]: Finished difference Result 643 states and 676 transitions. [2024-11-09 05:41:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:41:24,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-11-09 05:41:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:41:24,205 INFO L225 Difference]: With dead ends: 643 [2024-11-09 05:41:24,205 INFO L226 Difference]: Without dead ends: 643 [2024-11-09 05:41:24,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:41:24,206 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 1 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:41:24,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1663 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1114 Invalid, 9 Unknown, 0 Unchecked, 20.6s Time] [2024-11-09 05:41:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-09 05:41:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2024-11-09 05:41:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 410 states have (on average 1.6268292682926828) internal successors, (667), 637 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:41:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 676 transitions. [2024-11-09 05:41:24,219 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 676 transitions. Word has length 64 [2024-11-09 05:41:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:41:24,219 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 676 transitions. [2024-11-09 05:41:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:41:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 676 transitions. [2024-11-09 05:41:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 05:41:24,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:41:24,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:24,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 05:41:24,221 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:41:24,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:41:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1646320683, now seen corresponding path program 1 times [2024-11-09 05:41:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:41:24,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261294117] [2024-11-09 05:41:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:41:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:41:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:41:24,954 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 05:41:24,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:41:24,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261294117] [2024-11-09 05:41:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261294117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:41:24,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239755571] [2024-11-09 05:41:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:41:24,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:41:24,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:41:24,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:41:24,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:41:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:41:25,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 05:41:25,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:41:25,273 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 05:41:25,423 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:41:25,424 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 05:41:25,442 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 19 treesize of output 1 [2024-11-09 05:41:25,513 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:41:25,514 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 42 treesize of output 41 [2024-11-09 05:41:25,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 05:41:25,559 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 05:41:25,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:41:25,631 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 05:41:25,631 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 21 treesize of output 20 [2024-11-09 05:41:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239755571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:41:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2119210844] [2024-11-09 05:41:25,706 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2024-11-09 05:41:25,707 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:41:25,711 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:41:25,717 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:41:25,717 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:41:32,785 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 05:41:33,113 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:44:51,356 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33372#(and (<= 1 |#StackHeapBarrier|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_18|))) (exists ((|v_#memory_int_418| (Array Int (Array Int Int))) (|v_#memory_int_423| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_int_420| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_420|) (= (store |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_3|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_423|) (= (store |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_422|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#valid_631| (Array Int Int)) (|v_#length_613| (Array Int Int)) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#valid_631| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (<= 40 (select |v_#length_613| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_#memory_$Pointer$.base_310| (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= (select |v_#valid_631| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= (select |v_#valid_631| |ULTIMATE.start_main_~user~0#1.base|) 1) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_312|) (= (store |v_#length_613| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32))))))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_18|))) (exists ((|v_#memory_int_418| (Array Int (Array Int Int))) (|v_#memory_int_423| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_int_420| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_418| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_420|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_423|) (= (store |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_420| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_422|) (= |v_old(#memory_int)_AFTER_CALL_2| (store |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_423| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#valid_631| (Array Int Int)) (|v_#length_613| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (<= 40 (select |v_#length_613| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_#memory_$Pointer$.base_310| (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= (store |v_#length_613| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (= (select |v_#valid_631| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#valid_631| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_631| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_312|))))) (= |ULTIMATE.start_main_#t~mem56#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-09 05:44:51,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:44:51,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:44:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-09 05:44:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57936509] [2024-11-09 05:44:51,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:44:51,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:44:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:44:51,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:44:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2298, Unknown=104, NotChecked=0, Total=2652 [2024-11-09 05:44:51,360 INFO L87 Difference]: Start difference. First operand 643 states and 676 transitions. Second operand has 14 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:44:53,623 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 [] [2024-11-09 05:44:55,629 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 [] [2024-11-09 05:44:57,632 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 [] [2024-11-09 05:44:59,635 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 [] [2024-11-09 05:45:01,638 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 [] [2024-11-09 05:45:03,641 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 [] [2024-11-09 05:45:05,644 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 [] [2024-11-09 05:45:07,648 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 [] [2024-11-09 05:45:09,651 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 [] [2024-11-09 05:45:11,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:45:16,169 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 [] [2024-11-09 05:45:17,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:45:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:45:20,950 INFO L93 Difference]: Finished difference Result 642 states and 675 transitions. [2024-11-09 05:45:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:45:20,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-11-09 05:45:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:45:20,952 INFO L225 Difference]: With dead ends: 642 [2024-11-09 05:45:20,953 INFO L226 Difference]: Without dead ends: 642 [2024-11-09 05:45:20,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 199.0s TimeCoverageRelationStatistics Valid=312, Invalid=3001, Unknown=109, NotChecked=0, Total=3422 [2024-11-09 05:45:20,954 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 492 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 13 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:45:20,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2266 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2761 Invalid, 10 Unknown, 0 Unchecked, 28.8s Time] [2024-11-09 05:45:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-09 05:45:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-11-09 05:45:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 410 states have (on average 1.6243902439024391) internal successors, (666), 636 states have internal predecessors, (666), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:45:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 675 transitions. [2024-11-09 05:45:20,967 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 675 transitions. Word has length 65 [2024-11-09 05:45:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:45:20,967 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 675 transitions. [2024-11-09 05:45:20,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:45:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 675 transitions. [2024-11-09 05:45:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 05:45:20,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:45:20,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:45:20,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:45:21,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:45:21,170 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:45:21,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:45:21,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1646320684, now seen corresponding path program 1 times [2024-11-09 05:45:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:45:21,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115792856] [2024-11-09 05:45:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:45:21,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:45:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:45:22,579 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 05:45:22,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:45:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115792856] [2024-11-09 05:45:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115792856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:45:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917478557] [2024-11-09 05:45:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:45:22,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:45:22,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:45:22,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:45:22,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:45:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:45:22,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:45:22,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:45:22,845 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 05:45:23,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:45:23,107 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 05:45:23,177 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 19 treesize of output 1 [2024-11-09 05:45:23,185 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 19 treesize of output 1 [2024-11-09 05:45:23,600 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:45:23,601 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 70 treesize of output 65 [2024-11-09 05:45:23,608 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 49 treesize of output 30 [2024-11-09 05:45:23,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-09 05:45:23,737 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 32 treesize of output 14 [2024-11-09 05:45:23,805 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 05:45:23,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:45:24,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:45:24,339 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 48 treesize of output 52 [2024-11-09 05:45:24,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_805 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 25 |c_ULTIMATE.start_main_#t~mem54#1.offset|))) (forall ((v_ArrVal_806 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem54#1.base|)) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:45:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917478557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:45:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1497899563] [2024-11-09 05:45:24,496 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2024-11-09 05:45:24,497 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:45:24,497 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:45:24,498 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:45:24,498 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:45:30,934 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 05:45:31,792 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:48:50,480 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '34933#(and (<= 1 |#StackHeapBarrier|) (or (< (+ 16 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr226_30| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr226_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_30| 4294967296)))) (exists ((|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_329| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_331| (store |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_331| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_329|))) (exists ((|v_#length_618| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_#valid_636| (Array Int Int))) (and (= (select |v_#valid_636| |ULTIMATE.start_main_~user~0#1.base|) 1) (= |#length| (store |v_#length_618| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_618| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#valid_636| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (= (select |v_#valid_636| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)))) (exists ((|v_#memory_int_437| (Array Int (Array Int Int))) (|v_#memory_int_439| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_442| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_6| (store |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_441|) (= |v_#memory_int_439| (store |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_442|)))) (and (exists ((|v_#memory_int_437| (Array Int (Array Int Int))) (|v_#memory_int_439| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_#memory_int_442| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_441|) (= (store |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_5|) (= |v_#memory_int_439| (store |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_437| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_439| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_442| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_442|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#length_618| (Array Int Int)) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_#valid_636| (Array Int Int))) (and (= (select |v_#valid_636| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (select |v_#valid_636| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= 40 (select |v_#length_618| |ULTIMATE.start_main_~user~0#1.base|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= |#length| (store |v_#length_618| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (= (store |v_#valid_636| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_329| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_331| (store |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_331| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_329|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr226_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr226_30|))))) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-09 05:48:50,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:50,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:48:50,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-09 05:48:50,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970879461] [2024-11-09 05:48:50,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:50,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 05:48:50,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 05:48:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2907, Unknown=119, NotChecked=112, Total=3422 [2024-11-09 05:48:50,483 INFO L87 Difference]: Start difference. First operand 642 states and 675 transitions. Second operand has 19 states, 16 states have (on average 6.875) internal successors, (110), 19 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:48:52,905 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 [] [2024-11-09 05:48:54,916 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 [] [2024-11-09 05:48:56,920 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 [] [2024-11-09 05:48:58,923 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 [] [2024-11-09 05:49:00,929 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 [] [2024-11-09 05:49:02,932 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 [] [2024-11-09 05:49:04,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 [] [2024-11-09 05:49:06,942 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 [] [2024-11-09 05:49:08,945 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 [] [2024-11-09 05:49:10,948 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 [] [2024-11-09 05:49:12,951 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 [] [2024-11-09 05:49:14,954 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 [] [2024-11-09 05:49:16,964 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 [] [2024-11-09 05:49:18,967 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 [] [2024-11-09 05:49:20,970 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 [] [2024-11-09 05:49:22,973 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 [] [2024-11-09 05:49:24,979 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 [] [2024-11-09 05:49:30,888 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 [] [2024-11-09 05:49:32,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:34,916 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 [] [2024-11-09 05:49:36,921 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 [] [2024-11-09 05:49:38,925 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 [] [2024-11-09 05:49:40,932 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 [] [2024-11-09 05:49:42,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 [] [2024-11-09 05:49:44,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:51,448 INFO L93 Difference]: Finished difference Result 641 states and 674 transitions. [2024-11-09 05:49:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:49:51,449 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 19 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-09 05:49:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:51,452 INFO L225 Difference]: With dead ends: 641 [2024-11-09 05:49:51,452 INFO L226 Difference]: Without dead ends: 641 [2024-11-09 05:49:51,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 200.2s TimeCoverageRelationStatistics Valid=325, Invalid=3339, Unknown=122, NotChecked=120, Total=3906 [2024-11-09 05:49:51,454 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 490 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 19 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:51,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2340 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3753 Invalid, 24 Unknown, 0 Unchecked, 60.3s Time] [2024-11-09 05:49:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-09 05:49:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 636. [2024-11-09 05:49:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 406 states have (on average 1.625615763546798) internal successors, (660), 631 states have internal predecessors, (660), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:49:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 666 transitions. [2024-11-09 05:49:51,469 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 666 transitions. Word has length 65 [2024-11-09 05:49:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:51,470 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 666 transitions. [2024-11-09 05:49:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 19 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:49:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 666 transitions. [2024-11-09 05:49:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 05:49:51,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:51,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:49:51,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:49:51,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:49:51,672 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:49:51,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1607934952, now seen corresponding path program 1 times [2024-11-09 05:49:51,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:51,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926660900] [2024-11-09 05:49:51,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:53,006 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 05:49:53,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926660900] [2024-11-09 05:49:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926660900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:49:53,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:49:53,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 05:49:53,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729419636] [2024-11-09 05:49:53,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:49:53,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:49:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:49:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:49:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:49:53,009 INFO L87 Difference]: Start difference. First operand 636 states and 666 transitions. Second operand has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:49:55,337 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 [] [2024-11-09 05:50:00,678 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 [] [2024-11-09 05:50:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:50:06,429 INFO L93 Difference]: Finished difference Result 644 states and 677 transitions. [2024-11-09 05:50:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:50:06,429 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2024-11-09 05:50:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:50:06,432 INFO L225 Difference]: With dead ends: 644 [2024-11-09 05:50:06,432 INFO L226 Difference]: Without dead ends: 644 [2024-11-09 05:50:06,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 05:50:06,433 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 504 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:50:06,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2011 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2472 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2024-11-09 05:50:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-09 05:50:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 643. [2024-11-09 05:50:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 412 states have (on average 1.6213592233009708) internal successors, (668), 637 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:50:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 677 transitions. [2024-11-09 05:50:06,448 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 677 transitions. Word has length 66 [2024-11-09 05:50:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:50:06,448 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 677 transitions. [2024-11-09 05:50:06,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:50:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 677 transitions. [2024-11-09 05:50:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 05:50:06,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:50:06,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 05:50:06,450 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:50:06,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:50:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1607934951, now seen corresponding path program 1 times [2024-11-09 05:50:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:50:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100863251] [2024-11-09 05:50:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:50:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:50:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:50:07,981 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 05:50:07,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:50:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100863251] [2024-11-09 05:50:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100863251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:50:07,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:50:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:50:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726031194] [2024-11-09 05:50:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:50:07,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:50:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:50:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:50:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:50:07,984 INFO L87 Difference]: Start difference. First operand 643 states and 677 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:50:10,302 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 [] [2024-11-09 05:50:12,306 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 [] [2024-11-09 05:50:14,311 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 [] [2024-11-09 05:50:16,320 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 [] [2024-11-09 05:50:18,325 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 [] [2024-11-09 05:50:20,328 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 [] [2024-11-09 05:50:22,331 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 [] [2024-11-09 05:50:24,335 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 [] [2024-11-09 05:50:26,343 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 [] [2024-11-09 05:50:31,382 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 [] [2024-11-09 05:50:33,386 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 [] [2024-11-09 05:50:35,390 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 [] [2024-11-09 05:50:37,394 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 [] [2024-11-09 05:50:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:50:43,988 INFO L93 Difference]: Finished difference Result 643 states and 676 transitions. [2024-11-09 05:50:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:50:43,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2024-11-09 05:50:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:50:43,996 INFO L225 Difference]: With dead ends: 643 [2024-11-09 05:50:43,996 INFO L226 Difference]: Without dead ends: 643 [2024-11-09 05:50:43,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-09 05:50:43,997 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 515 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 2817 mSolverCounterSat, 11 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2817 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:50:44,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1584 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2817 Invalid, 13 Unknown, 0 Unchecked, 35.7s Time] [2024-11-09 05:50:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-09 05:50:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2024-11-09 05:50:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 412 states have (on average 1.6189320388349515) internal successors, (667), 637 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 05:50:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 676 transitions. [2024-11-09 05:50:44,034 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 676 transitions. Word has length 66 [2024-11-09 05:50:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:50:44,035 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 676 transitions. [2024-11-09 05:50:44,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:50:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 676 transitions. [2024-11-09 05:50:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 05:50:44,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:50:44,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:44,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 05:50:44,040 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 05:50:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:50:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1567658363, now seen corresponding path program 1 times [2024-11-09 05:50:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:50:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641885412] [2024-11-09 05:50:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:50:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:50:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:50:45,818 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 05:50:45,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:50:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641885412] [2024-11-09 05:50:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641885412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:50:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099222026] [2024-11-09 05:50:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:50:45,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:50:45,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:50:45,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:50:45,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef007f6-c1d4-45d5-951b-a5a5f98a2141/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:50:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:50:46,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 05:50:46,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:50:46,171 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 05:50:46,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:50:46,517 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 05:50:46,539 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 19 treesize of output 1 [2024-11-09 05:50:46,749 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:50:46,750 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 31 treesize of output 32 [2024-11-09 05:50:46,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:50:46,911 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 42 treesize of output 41 [2024-11-09 05:50:46,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 05:50:46,950 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 05:50:46,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:50:47,012 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 05:50:47,012 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 21 treesize of output 20 [2024-11-09 05:50:47,031 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem56#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-09 05:50:47,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1090) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-09 05:50:47,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099222026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:50:47,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1540101850] [2024-11-09 05:50:47,207 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2024-11-09 05:50:47,207 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:50:47,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:50:47,208 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:50:47,208 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:50:54,339 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 05:50:54,757 INFO L180 IcfgInterpreter]: Interpretation finished