./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-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_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/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_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/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_1ebba44e-54e6-4178-9323-aff964b1d768/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:29:30,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:29:30,625 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 04:29:30,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:29:30,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:29:30,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:29:30,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:29:30,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:29:30,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:29:30,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:29:30,675 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:29:30,676 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:29:30,677 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:29:30,677 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:29:30,679 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:29:30,680 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:29:30,680 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:29:30,681 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:29:30,681 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:29:30,682 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:29:30,686 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:29:30,686 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:29:30,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:29:30,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:29:30,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:29:30,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:29:30,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:29:30,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:29:30,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:29:30,689 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:29:30,690 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:29:30,692 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:29:30,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:29:30,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:29:30,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:29:30,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:29:30,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:29:30,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:29:30,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:29:30,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:29:30,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:29:30,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:30,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:29:30,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:29:30,698 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:29:30,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:29:30,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:29:30,699 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:29:30,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:29:30,700 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_1ebba44e-54e6-4178-9323-aff964b1d768/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_1ebba44e-54e6-4178-9323-aff964b1d768/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-09 04:29:31,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:29:31,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:29:31,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:29:31,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:29:31,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:29:31,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i Unable to find full path for "g++" [2024-11-09 04:29:33,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:29:33,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:29:33,368 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i [2024-11-09 04:29:33,387 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/data/d5650f3f8/7330abd6158840b2890e5d7d08a1909f/FLAG7c6777ba5 [2024-11-09 04:29:33,407 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/data/d5650f3f8/7330abd6158840b2890e5d7d08a1909f [2024-11-09 04:29:33,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:29:33,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:29:33,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:33,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:29:33,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:29:33,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:33" (1/1) ... [2024-11-09 04:29:33,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ed6a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:33, skipping insertion in model container [2024-11-09 04:29:33,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:33" (1/1) ... [2024-11-09 04:29:33,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:29:34,100 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 04:29:34,162 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 04:29:34,172 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 04:29:34,180 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 04:29:34,200 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 04:29:34,228 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 04:29:34,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:34,258 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:29:34,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:34,449 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:29:34,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34 WrapperNode [2024-11-09 04:29:34,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:34,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:34,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:29:34,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:29:34,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,561 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-09 04:29:34,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:34,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:29:34,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:29:34,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:29:34,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:29:34,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:29:34,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:29:34,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:29:34,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:34,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:29:34,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:29:34,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:29:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:29:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:29:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 04:29:34,738 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 04:29:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:29:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:29:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:29:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:29:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:29:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:29:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:29:34,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:29:34,908 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:29:34,911 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:29:34,914 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 04:29:36,975 INFO L? ?]: Removed 764 outVars from TransFormulas that were not future-live. [2024-11-09 04:29:36,975 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:29:37,909 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:29:37,909 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-09 04:29:37,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:37 BoogieIcfgContainer [2024-11-09 04:29:37,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:29:37,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:29:37,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:29:37,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:29:37,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:29:33" (1/3) ... [2024-11-09 04:29:37,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18870cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:37, skipping insertion in model container [2024-11-09 04:29:37,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34" (2/3) ... [2024-11-09 04:29:37,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18870cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:37, skipping insertion in model container [2024-11-09 04:29:37,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:37" (3/3) ... [2024-11-09 04:29:37,925 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-1.i [2024-11-09 04:29:37,945 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:29:37,945 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-09 04:29:38,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:29:38,029 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;@56c0e3cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:29:38,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-09 04:29:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 573 states, 251 states have (on average 2.50996015936255) internal successors, (630), 568 states have internal predecessors, (630), 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 04:29:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 04:29:38,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:38,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 04:29:38,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:29:38,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 40007419, now seen corresponding path program 1 times [2024-11-09 04:29:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062673325] [2024-11-09 04:29:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:38,337 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 04:29:38,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:38,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062673325] [2024-11-09 04:29:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062673325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:38,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:29:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707339100] [2024-11-09 04:29:38,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:38,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:38,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:29:38,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:38,391 INFO L87 Difference]: Start difference. First operand has 573 states, 251 states have (on average 2.50996015936255) internal successors, (630), 568 states have internal predecessors, (630), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:29:40,562 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 04:29:42,611 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 04:29:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:43,651 INFO L93 Difference]: Finished difference Result 517 states and 550 transitions. [2024-11-09 04:29:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 04:29:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:43,674 INFO L225 Difference]: With dead ends: 517 [2024-11-09 04:29:43,675 INFO L226 Difference]: Without dead ends: 516 [2024-11-09 04:29:43,676 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 04:29:43,683 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 461 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:43,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 243 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 384 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2024-11-09 04:29:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-09 04:29:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 513. [2024-11-09 04:29:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 246 states have (on average 2.186991869918699) internal successors, (538), 508 states have internal predecessors, (538), 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 04:29:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 544 transitions. [2024-11-09 04:29:43,767 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 544 transitions. Word has length 4 [2024-11-09 04:29:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:43,768 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 544 transitions. [2024-11-09 04:29:43,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:29:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 544 transitions. [2024-11-09 04:29:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 04:29:43,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:43,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 04:29:43,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:29:43,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:29:43,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash 40007420, now seen corresponding path program 1 times [2024-11-09 04:29:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:43,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777667422] [2024-11-09 04:29:43,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:43,941 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 04:29:43,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777667422] [2024-11-09 04:29:43,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777667422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:43,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:29:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608714999] [2024-11-09 04:29:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:43,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:43,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:29:43,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:43,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:43,947 INFO L87 Difference]: Start difference. First operand 513 states and 544 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:29:46,071 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 04:29:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:46,874 INFO L93 Difference]: Finished difference Result 498 states and 531 transitions. [2024-11-09 04:29:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 04:29:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:46,877 INFO L225 Difference]: With dead ends: 498 [2024-11-09 04:29:46,878 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 04:29:46,878 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 04:29:46,879 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 283 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:46,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 436 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 04:29:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 04:29:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 487. [2024-11-09 04:29:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 246 states have (on average 2.0813008130081303) internal successors, (512), 482 states have internal predecessors, (512), 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 04:29:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 518 transitions. [2024-11-09 04:29:46,905 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 518 transitions. Word has length 4 [2024-11-09 04:29:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:46,906 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 518 transitions. [2024-11-09 04:29:46,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:29:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 518 transitions. [2024-11-09 04:29:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 04:29:46,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:46,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 04:29:46,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:29:46,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:29:46,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 937567219, now seen corresponding path program 1 times [2024-11-09 04:29:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:46,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641159233] [2024-11-09 04:29:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:46,936 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 04:29:46,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641159233] [2024-11-09 04:29:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641159233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:46,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:46,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:29:46,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33019141] [2024-11-09 04:29:46,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:46,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:29:46,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:46,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:46,940 INFO L87 Difference]: Start difference. First operand 487 states and 518 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 04:29:49,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:51,234 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 04:29:53,257 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 04:29:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:53,402 INFO L93 Difference]: Finished difference Result 954 states and 1013 transitions. [2024-11-09 04:29:53,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:53,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 04:29:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:53,406 INFO L225 Difference]: With dead ends: 954 [2024-11-09 04:29:53,407 INFO L226 Difference]: Without dead ends: 954 [2024-11-09 04:29:53,407 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 04:29:53,408 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 488 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:53,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1065 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2024-11-09 04:29:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-11-09 04:29:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 489. [2024-11-09 04:29:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 248 states have (on average 2.0725806451612905) internal successors, (514), 484 states have internal predecessors, (514), 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 04:29:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 520 transitions. [2024-11-09 04:29:53,433 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 520 transitions. Word has length 6 [2024-11-09 04:29:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:53,433 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 520 transitions. [2024-11-09 04:29:53,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 04:29:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 520 transitions. [2024-11-09 04:29:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:29:53,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:53,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:53,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:29:53,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:29:53,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2059687145, now seen corresponding path program 1 times [2024-11-09 04:29:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:53,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032028486] [2024-11-09 04:29:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:53,529 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 04:29:53,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:53,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032028486] [2024-11-09 04:29:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032028486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:53,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:29:53,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045979791] [2024-11-09 04:29:53,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:29:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:29:53,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:29:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:29:53,533 INFO L87 Difference]: Start difference. First operand 489 states and 520 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:29:55,661 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 04:29:57,697 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 04:29:59,708 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 04:30:01,717 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 04:30:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:02,288 INFO L93 Difference]: Finished difference Result 470 states and 501 transitions. [2024-11-09 04:30:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:30:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 04:30:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:02,291 INFO L225 Difference]: With dead ends: 470 [2024-11-09 04:30:02,291 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 04:30:02,291 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 04:30:02,292 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 499 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 29 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:02,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 371 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 606 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2024-11-09 04:30:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 04:30:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2024-11-09 04:30:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 248 states have (on average 1.9798387096774193) internal successors, (491), 461 states have internal predecessors, (491), 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 04:30:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 497 transitions. [2024-11-09 04:30:02,305 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 497 transitions. Word has length 12 [2024-11-09 04:30:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:02,305 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 497 transitions. [2024-11-09 04:30:02,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 497 transitions. [2024-11-09 04:30:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:30:02,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:02,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:02,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:30:02,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2059687146, now seen corresponding path program 1 times [2024-11-09 04:30:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172531551] [2024-11-09 04:30:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:02,399 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 04:30:02,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172531551] [2024-11-09 04:30:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172531551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:02,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:30:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514533111] [2024-11-09 04:30:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:02,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:30:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:02,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:30:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:02,403 INFO L87 Difference]: Start difference. First operand 466 states and 497 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:04,471 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 04:30:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:05,300 INFO L93 Difference]: Finished difference Result 438 states and 467 transitions. [2024-11-09 04:30:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:05,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 04:30:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:05,303 INFO L225 Difference]: With dead ends: 438 [2024-11-09 04:30:05,303 INFO L226 Difference]: Without dead ends: 438 [2024-11-09 04:30:05,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 04:30:05,305 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 51 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:05,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 742 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 04:30:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-09 04:30:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-09 04:30:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 232 states have (on average 1.9870689655172413) internal successors, (461), 433 states have internal predecessors, (461), 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 04:30:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 467 transitions. [2024-11-09 04:30:05,345 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 467 transitions. Word has length 12 [2024-11-09 04:30:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:05,346 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 467 transitions. [2024-11-09 04:30:05,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 467 transitions. [2024-11-09 04:30:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:30:05,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:05,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:05,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:30:05,350 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:05,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:05,351 INFO L85 PathProgramCache]: Analyzing trace with hash -567438349, now seen corresponding path program 1 times [2024-11-09 04:30:05,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:05,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749699917] [2024-11-09 04:30:05,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:05,439 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 04:30:05,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749699917] [2024-11-09 04:30:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749699917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:05,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:05,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:30:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963072389] [2024-11-09 04:30:05,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:05,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:30:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:05,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:30:05,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:30:05,442 INFO L87 Difference]: Start difference. First operand 438 states and 467 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 04:30:07,537 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 04:30:09,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 04:30:11,549 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 04:30:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:11,759 INFO L93 Difference]: Finished difference Result 427 states and 449 transitions. [2024-11-09 04:30:11,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:30:11,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-09 04:30:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:11,761 INFO L225 Difference]: With dead ends: 427 [2024-11-09 04:30:11,761 INFO L226 Difference]: Without dead ends: 427 [2024-11-09 04:30:11,762 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 04:30:11,763 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 38 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:11,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1078 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2024-11-09 04:30:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-09 04:30:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 424. [2024-11-09 04:30:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 225 states have (on average 1.9555555555555555) internal successors, (440), 419 states have internal predecessors, (440), 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 04:30:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 446 transitions. [2024-11-09 04:30:11,776 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 446 transitions. Word has length 13 [2024-11-09 04:30:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:11,776 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 446 transitions. [2024-11-09 04:30:11,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 04:30:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 446 transitions. [2024-11-09 04:30:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 04:30:11,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:11,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:11,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 04:30:11,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:11,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1864044287, now seen corresponding path program 1 times [2024-11-09 04:30:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:11,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878917030] [2024-11-09 04:30:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:12,031 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 04:30:12,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878917030] [2024-11-09 04:30:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878917030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:12,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:12,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:30:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508116218] [2024-11-09 04:30:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:12,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:30:12,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:30:12,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:30:12,035 INFO L87 Difference]: Start difference. First operand 424 states and 446 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:14,092 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 04:30:15,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:17,824 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 04:30:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:18,649 INFO L93 Difference]: Finished difference Result 499 states and 526 transitions. [2024-11-09 04:30:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:30:18,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 04:30:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:18,653 INFO L225 Difference]: With dead ends: 499 [2024-11-09 04:30:18,653 INFO L226 Difference]: Without dead ends: 499 [2024-11-09 04:30:18,653 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 04:30:18,656 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 176 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:18,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 633 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 574 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2024-11-09 04:30:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-09 04:30:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 420. [2024-11-09 04:30:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 225 states have (on average 1.9377777777777778) internal successors, (436), 415 states have internal predecessors, (436), 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 04:30:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 442 transitions. [2024-11-09 04:30:18,669 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 442 transitions. Word has length 27 [2024-11-09 04:30:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:18,669 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 442 transitions. [2024-11-09 04:30:18,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 442 transitions. [2024-11-09 04:30:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 04:30:18,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:18,671 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 04:30:18,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 04:30:18,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:18,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 564208809, now seen corresponding path program 1 times [2024-11-09 04:30:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:18,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047696396] [2024-11-09 04:30:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:18,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:18,883 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 04:30:18,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047696396] [2024-11-09 04:30:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047696396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:30:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490171199] [2024-11-09 04:30:18,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:30:18,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:18,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:30:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:30:18,886 INFO L87 Difference]: Start difference. First operand 420 states and 442 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 04:30:20,979 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 04:30:22,983 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 04:30:24,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 04:30:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:25,242 INFO L93 Difference]: Finished difference Result 420 states and 438 transitions. [2024-11-09 04:30:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:30:25,243 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 04:30:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:25,245 INFO L225 Difference]: With dead ends: 420 [2024-11-09 04:30:25,245 INFO L226 Difference]: Without dead ends: 420 [2024-11-09 04:30:25,246 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 04:30:25,246 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 15 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:25,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1066 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 204 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2024-11-09 04:30:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-09 04:30:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-09 04:30:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 225 states have (on average 1.92) internal successors, (432), 415 states have internal predecessors, (432), 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 04:30:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 438 transitions. [2024-11-09 04:30:25,269 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 438 transitions. Word has length 43 [2024-11-09 04:30:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:25,271 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 438 transitions. [2024-11-09 04:30:25,272 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 04:30:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 438 transitions. [2024-11-09 04:30:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 04:30:25,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:25,277 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 04:30:25,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:30:25,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1305848203, now seen corresponding path program 1 times [2024-11-09 04:30:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633330822] [2024-11-09 04:30:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:25,496 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 04:30:25,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633330822] [2024-11-09 04:30:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633330822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:30:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620479868] [2024-11-09 04:30:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:25,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:30:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:30:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:25,498 INFO L87 Difference]: Start difference. First operand 420 states and 438 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 04:30:27,529 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 04:30:29,674 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 04:30:31,678 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 04:30:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:31,786 INFO L93 Difference]: Finished difference Result 463 states and 481 transitions. [2024-11-09 04:30:31,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:31,787 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 04:30:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:31,789 INFO L225 Difference]: With dead ends: 463 [2024-11-09 04:30:31,789 INFO L226 Difference]: Without dead ends: 463 [2024-11-09 04:30:31,790 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 04:30:31,790 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:31,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2024-11-09 04:30:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-09 04:30:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2024-11-09 04:30:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 268 states have (on average 1.7723880597014925) internal successors, (475), 458 states have internal predecessors, (475), 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 04:30:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 481 transitions. [2024-11-09 04:30:31,803 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 481 transitions. Word has length 47 [2024-11-09 04:30:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:31,804 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 481 transitions. [2024-11-09 04:30:31,804 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 04:30:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 481 transitions. [2024-11-09 04:30:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 04:30:31,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:31,806 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 04:30:31,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 04:30:31,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:31,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2144323169, now seen corresponding path program 1 times [2024-11-09 04:30:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:31,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315079786] [2024-11-09 04:30:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:31,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:32,291 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 04:30:32,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:32,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315079786] [2024-11-09 04:30:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315079786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:30:32,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691828331] [2024-11-09 04:30:32,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:32,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:30:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:32,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:30:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:30:32,295 INFO L87 Difference]: Start difference. First operand 463 states and 481 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 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 04:30:34,350 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 04:30:37,001 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 04:30:39,005 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 04:30:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:39,749 INFO L93 Difference]: Finished difference Result 462 states and 480 transitions. [2024-11-09 04:30:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:30:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 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 04:30:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:39,752 INFO L225 Difference]: With dead ends: 462 [2024-11-09 04:30:39,752 INFO L226 Difference]: Without dead ends: 462 [2024-11-09 04:30:39,753 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 04:30:39,754 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 2 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:39,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 962 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 767 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2024-11-09 04:30:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-09 04:30:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2024-11-09 04:30:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 268 states have (on average 1.7686567164179106) internal successors, (474), 457 states have internal predecessors, (474), 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 04:30:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2024-11-09 04:30:39,766 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 54 [2024-11-09 04:30:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:39,769 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2024-11-09 04:30:39,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 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 04:30:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2024-11-09 04:30:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 04:30:39,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:39,770 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 04:30:39,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:30:39,771 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:39,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2144323168, now seen corresponding path program 1 times [2024-11-09 04:30:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936260419] [2024-11-09 04:30:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:40,658 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 04:30:40,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:40,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936260419] [2024-11-09 04:30:40,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936260419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:40,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:40,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:30:40,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579453399] [2024-11-09 04:30:40,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:40,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:30:40,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:40,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:30:40,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:30:40,664 INFO L87 Difference]: Start difference. First operand 462 states and 480 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 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 04:30:42,719 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 04:30:44,723 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 04:30:46,729 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 04:30:48,748 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 04:30:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:49,690 INFO L93 Difference]: Finished difference Result 461 states and 479 transitions. [2024-11-09 04:30:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:30:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 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 04:30:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:49,694 INFO L225 Difference]: With dead ends: 461 [2024-11-09 04:30:49,694 INFO L226 Difference]: Without dead ends: 461 [2024-11-09 04:30:49,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:49,695 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:49,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 925 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 800 Invalid, 4 Unknown, 0 Unchecked, 9.0s Time] [2024-11-09 04:30:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-09 04:30:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-11-09 04:30:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 267 states have (on average 1.7715355805243447) internal successors, (473), 456 states have internal predecessors, (473), 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 04:30:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 479 transitions. [2024-11-09 04:30:49,708 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 479 transitions. Word has length 54 [2024-11-09 04:30:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:49,708 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 479 transitions. [2024-11-09 04:30:49,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 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 04:30:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 479 transitions. [2024-11-09 04:30:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 04:30:49,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:49,710 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] [2024-11-09 04:30:49,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 04:30:49,711 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:49,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1582971899, now seen corresponding path program 1 times [2024-11-09 04:30:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266841479] [2024-11-09 04:30:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:49,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:50,218 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 04:30:50,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:50,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266841479] [2024-11-09 04:30:50,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266841479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:50,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:50,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:30:50,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486340747] [2024-11-09 04:30:50,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:50,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:30:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:50,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:30:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:30:50,222 INFO L87 Difference]: Start difference. First operand 461 states and 479 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 04:30:52,287 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 04:30:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:53,770 INFO L93 Difference]: Finished difference Result 471 states and 492 transitions. [2024-11-09 04:30:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:30:53,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 60 [2024-11-09 04:30:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:53,774 INFO L225 Difference]: With dead ends: 471 [2024-11-09 04:30:53,774 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 04:30:53,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:30:53,776 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 5 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:53,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1316 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 851 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 04:30:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 04:30:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 466. [2024-11-09 04:30:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 271 states have (on average 1.7675276752767528) internal successors, (479), 460 states have internal predecessors, (479), 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 04:30:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 488 transitions. [2024-11-09 04:30:53,789 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 488 transitions. Word has length 60 [2024-11-09 04:30:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:53,791 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 488 transitions. [2024-11-09 04:30:53,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 04:30:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 488 transitions. [2024-11-09 04:30:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 04:30:53,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:53,796 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] [2024-11-09 04:30:53,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 04:30:53,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:30:53,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1582971898, now seen corresponding path program 1 times [2024-11-09 04:30:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:53,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994108760] [2024-11-09 04:30:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:54,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 04:30:54,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994108760] [2024-11-09 04:30:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994108760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:30:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26986039] [2024-11-09 04:30:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:30:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:30:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:54,756 INFO L87 Difference]: Start difference. First operand 466 states and 488 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 04:30:56,824 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 04:30:58,830 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 04:31:00,834 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 04:31:02,837 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 04:31:04,840 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 04:31:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:05,677 INFO L93 Difference]: Finished difference Result 466 states and 487 transitions. [2024-11-09 04:31:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:31:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 60 [2024-11-09 04:31:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:05,680 INFO L225 Difference]: With dead ends: 466 [2024-11-09 04:31:05,680 INFO L226 Difference]: Without dead ends: 466 [2024-11-09 04:31:05,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:31:05,681 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 1 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:05,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1222 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 934 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2024-11-09 04:31:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-09 04:31:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-11-09 04:31:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 271 states have (on average 1.7638376383763839) internal successors, (478), 460 states have internal predecessors, (478), 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 04:31:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 487 transitions. [2024-11-09 04:31:05,693 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 487 transitions. Word has length 60 [2024-11-09 04:31:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:05,693 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 487 transitions. [2024-11-09 04:31:05,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 04:31:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 487 transitions. [2024-11-09 04:31:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 04:31:05,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:05,695 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] [2024-11-09 04:31:05,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 04:31:05,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:31:05,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:05,696 INFO L85 PathProgramCache]: Analyzing trace with hash -479516464, now seen corresponding path program 1 times [2024-11-09 04:31:05,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:05,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533868789] [2024-11-09 04:31:05,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:05,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:06,436 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 04:31:06,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:06,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533868789] [2024-11-09 04:31:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533868789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:06,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440963961] [2024-11-09 04:31:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:06,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:06,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:31:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:06,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 04:31:06,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:06,730 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 04:31:06,886 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:31:06,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 04:31:06,952 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 04:31:07,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 04:31:07,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:31:07,378 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 04:31:07,445 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 04:31:07,499 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 04:31:07,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:07,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440963961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:07,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356026154] [2024-11-09 04:31:07,621 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2024-11-09 04:31:07,621 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:07,627 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:07,634 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:07,635 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:14,318 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 04:31:14,739 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:33:57,816 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13381#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr160_18| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr160_18|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_18| 4294967296)))) (exists ((|v_#memory_$Pointer$.offset_280| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_282| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_279| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_282| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_282|) (= (store |v_#memory_$Pointer$.offset_279| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_279| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_280|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_284| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_283| (Array Int (Array Int Int))) (|v_#valid_481| (Array Int Int)) (|v_#length_468| (Array Int Int)) (|v_#memory_$Pointer$.base_286| (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)) (= (select |v_#valid_481| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |v_#memory_$Pointer$.base_286| (store |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= |v_#memory_$Pointer$.base_284| (store |v_#memory_$Pointer$.base_283| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_283| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_468| |ULTIMATE.start_main_~user~0#1.base|)) (= (select |v_#valid_481| |ULTIMATE.start_main_~user~0#1.base|) 1) (= |#length| (store |v_#length_468| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= (store |v_#valid_481| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_286| |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)))))) (exists ((|v_#memory_int_335| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_334| (Array Int (Array Int Int))) (|v_#memory_int_330| (Array Int (Array Int Int))) (|v_#memory_int_332| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_334|) (= (store |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_335|) (= |v_old(#memory_int)_AFTER_CALL_3| (store |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_335| |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)))) (= (store |v_#memory_int_330| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_330| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_332|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr160_18| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr160_18|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_18| 4294967296)))) (exists ((|v_#memory_$Pointer$.offset_280| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_282| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_279| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_282| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_282|) (= (store |v_#memory_$Pointer$.offset_279| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_279| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_280|))) (exists ((|v_#memory_$Pointer$.base_284| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_283| (Array Int (Array Int Int))) (|v_#valid_481| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#length_468| (Array Int Int)) (|v_#memory_$Pointer$.base_286| (Array Int (Array Int Int)))) (and (= (select |v_#valid_481| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_286| |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)))) (= (store |v_#valid_481| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_#memory_$Pointer$.base_286| (store |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= |v_#memory_$Pointer$.base_284| (store |v_#memory_$Pointer$.base_283| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_283| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (<= 40 (select |v_#length_468| |ULTIMATE.start_main_~user~0#1.base|)) (= (select |v_#valid_481| |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_#length_468| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_int_335| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_334| (Array Int (Array Int Int))) (|v_#memory_int_330| (Array Int (Array Int Int))) (|v_#memory_int_332| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_334|) (= (store |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_335|) (= (store |v_#memory_int_330| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_330| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_332|) (= |v_old(#memory_int)_AFTER_CALL_2| (store |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_335| |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)))))))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem53#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)))' at error location [2024-11-09 04:33:57,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:33:57,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:33:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 04:33:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225374909] [2024-11-09 04:33:57,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:33:57,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 04:33:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:57,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 04:33:57,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2326, Unknown=96, NotChecked=0, Total=2652 [2024-11-09 04:33:57,820 INFO L87 Difference]: Start difference. First operand 466 states and 487 transitions. Second operand has 19 states, 16 states have (on average 6.5) internal successors, (104), 18 states have internal predecessors, (104), 2 states have call successors, (2), 2 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 04:34:00,103 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 04:34:02,107 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 04:34:03,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:34:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:10,015 INFO L93 Difference]: Finished difference Result 470 states and 491 transitions. [2024-11-09 04:34:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 04:34:10,016 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.5) internal successors, (104), 18 states have internal predecessors, (104), 2 states have call successors, (2), 2 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 61 [2024-11-09 04:34:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:10,019 INFO L225 Difference]: With dead ends: 470 [2024-11-09 04:34:10,019 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 04:34:10,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 163.8s TimeCoverageRelationStatistics Valid=262, Invalid=2719, Unknown=99, NotChecked=0, Total=3080 [2024-11-09 04:34:10,030 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 356 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 2581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:10,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1715 Invalid, 2581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2564 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2024-11-09 04:34:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 04:34:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-11-09 04:34:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 273 states have (on average 1.7582417582417582) internal successors, (480), 461 states have internal predecessors, (480), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 04:34:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 487 transitions. [2024-11-09 04:34:10,052 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 487 transitions. Word has length 61 [2024-11-09 04:34:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:10,053 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 487 transitions. [2024-11-09 04:34:10,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.5) internal successors, (104), 18 states have internal predecessors, (104), 2 states have call successors, (2), 2 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 04:34:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 487 transitions. [2024-11-09 04:34:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 04:34:10,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:10,055 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] [2024-11-09 04:34:10,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 04:34:10,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:10,257 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:34:10,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash -479516463, now seen corresponding path program 1 times [2024-11-09 04:34:10,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:10,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386157876] [2024-11-09 04:34:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:11,795 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 04:34:11,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386157876] [2024-11-09 04:34:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386157876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921047485] [2024-11-09 04:34:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:11,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:11,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:34:11,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:34:11,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:34:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:12,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 04:34:12,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:12,055 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 04:34:12,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:34:12,381 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:34:12,382 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 04:34:12,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 04:34:12,494 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 04:34:12,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 04:34:12,759 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 9 treesize of output 3 [2024-11-09 04:34:13,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:34:13,064 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 62 treesize of output 57 [2024-11-09 04:34:13,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:34:13,197 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 04:34:13,210 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 9 treesize of output 3 [2024-11-09 04:34:13,273 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 04:34:13,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:34:13,561 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_583 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-09 04:34:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921047485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567672547] [2024-11-09 04:34:13,568 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2024-11-09 04:34:13,568 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:34:13,568 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:34:13,569 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:34:13,569 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:34:19,569 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 04:34:20,877 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:36:56,001 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14572#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (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))) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.offset_302| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_304| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_301| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_302| (store |v_#memory_$Pointer$.offset_301| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_301| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= |v_#memory_$Pointer$.offset_304| (store |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#Ultimate.C_memset_#t~loopctr160_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_30|))) (exists ((|v_#memory_int_348| (Array Int (Array Int Int))) (|v_#memory_int_353| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_352| (Array Int (Array Int Int))) (|v_#memory_int_350| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_348| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_348| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_350|) (= (store |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_353| |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))) |v_old(#memory_int)_AFTER_CALL_6|) (= (store |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_353|) (= (store |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_352|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_308| (Array Int (Array Int Int))) (|v_#length_471| (Array Int Int)) (|v_#memory_$Pointer$.base_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_305| (Array Int (Array Int Int))) (|v_#valid_485| (Array Int Int))) (and (= (store |v_#valid_485| (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_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_308|) (<= 40 (select |v_#length_471| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#length_471| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_306|) (= (select |v_#valid_485| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (select |v_#valid_485| (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)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_308| |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))))))) (and (exists ((|v_#memory_$Pointer$.offset_302| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_304| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_301| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_302| (store |v_#memory_$Pointer$.offset_301| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_301| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= |v_#memory_$Pointer$.offset_304| (store |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#Ultimate.C_memset_#t~loopctr160_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_30|))) (exists ((|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_348| (Array Int (Array Int Int))) (|v_#memory_int_353| (Array Int (Array Int Int))) (|v_#memory_int_352| (Array Int (Array Int Int))) (|v_#memory_int_350| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_348| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_348| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_350|) (= (store |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_353|) (= |v_old(#memory_int)_AFTER_CALL_5| (store |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_353| |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)))) (= (store |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_352|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_308| (Array Int (Array Int Int))) (|v_#length_471| (Array Int Int)) (|v_#memory_$Pointer$.base_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_305| (Array Int (Array Int Int))) (|v_#valid_485| (Array Int Int))) (and (= (store |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_308|) (<= 40 (select |v_#length_471| |ULTIMATE.start_main_~user~0#1.base|)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#valid_485| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (store |v_#memory_$Pointer$.base_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_306|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_308| |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)))) (= (select |v_#valid_485| |ULTIMATE.start_main_~user~0#1.base|) 1) (= |#length| (store |v_#length_471| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= (select |v_#valid_485| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0))))))' at error location [2024-11-09 04:36:56,001 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:36:56,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:36:56,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-09 04:36:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210944028] [2024-11-09 04:36:56,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:36:56,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 04:36:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:36:56,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 04:36:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2335, Unknown=88, NotChecked=100, Total=2756 [2024-11-09 04:36:56,015 INFO L87 Difference]: Start difference. First operand 468 states and 487 transitions. Second operand has 18 states, 15 states have (on average 6.933333333333334) internal successors, (104), 18 states have internal predecessors, (104), 2 states have call successors, (2), 2 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 04:36:58,260 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 04:37:00,263 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 04:37:02,266 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 04:37:04,268 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 04:37:06,277 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 04:37:08,282 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 04:37:10,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:12,289 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 04:37:14,293 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 04:37:15,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:37:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:22,474 INFO L93 Difference]: Finished difference Result 469 states and 490 transitions. [2024-11-09 04:37:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:37:22,474 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 6.933333333333334) internal successors, (104), 18 states have internal predecessors, (104), 2 states have call successors, (2), 2 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 61 [2024-11-09 04:37:22,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:22,476 INFO L225 Difference]: With dead ends: 469 [2024-11-09 04:37:22,476 INFO L226 Difference]: Without dead ends: 469 [2024-11-09 04:37:22,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 156.6s TimeCoverageRelationStatistics Valid=271, Invalid=2721, Unknown=92, NotChecked=108, Total=3192 [2024-11-09 04:37:22,478 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 352 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 21 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:22,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1099 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2808 Invalid, 9 Unknown, 0 Unchecked, 25.9s Time] [2024-11-09 04:37:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-09 04:37:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 462. [2024-11-09 04:37:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 269 states have (on average 1.762081784386617) internal successors, (474), 456 states have internal predecessors, (474), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:37:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2024-11-09 04:37:22,492 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 61 [2024-11-09 04:37:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:22,492 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2024-11-09 04:37:22,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 6.933333333333334) internal successors, (104), 18 states have internal predecessors, (104), 2 states have call successors, (2), 2 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 04:37:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2024-11-09 04:37:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 04:37:22,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:22,494 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] [2024-11-09 04:37:22,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 04:37:22,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 04:37:22,698 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:37:22,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash -816862793, now seen corresponding path program 1 times [2024-11-09 04:37:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:37:22,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530889584] [2024-11-09 04:37:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:22,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:37:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:24,070 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 04:37:24,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:37:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530889584] [2024-11-09 04:37:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530889584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:37:24,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:37:24,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 04:37:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410590345] [2024-11-09 04:37:24,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:37:24,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 04:37:24,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:37:24,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 04:37:24,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:37:24,072 INFO L87 Difference]: Start difference. First operand 462 states and 480 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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 04:37:26,257 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 04:37:28,260 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 04:37:30,262 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 04:37:32,266 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 04:37:34,271 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 04:37:36,273 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 04:37:38,276 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 04:37:40,282 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 04:37:42,285 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 04:37:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:47,888 INFO L93 Difference]: Finished difference Result 472 states and 493 transitions. [2024-11-09 04:37:47,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:37:47,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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 62 [2024-11-09 04:37:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:47,892 INFO L225 Difference]: With dead ends: 472 [2024-11-09 04:37:47,892 INFO L226 Difference]: Without dead ends: 472 [2024-11-09 04:37:47,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-09 04:37:47,894 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 379 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 12 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:47,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1055 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2351 Invalid, 9 Unknown, 0 Unchecked, 23.6s Time] [2024-11-09 04:37:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-09 04:37:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 469. [2024-11-09 04:37:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 275 states have (on average 1.7527272727272727) internal successors, (482), 462 states have internal predecessors, (482), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 04:37:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 489 transitions. [2024-11-09 04:37:47,910 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 489 transitions. Word has length 62 [2024-11-09 04:37:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:47,910 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 489 transitions. [2024-11-09 04:37:47,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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 04:37:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 489 transitions. [2024-11-09 04:37:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 04:37:47,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:47,912 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] [2024-11-09 04:37:47,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 04:37:47,912 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:37:47,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash -816862794, now seen corresponding path program 1 times [2024-11-09 04:37:47,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:37:47,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893079662] [2024-11-09 04:37:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:47,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:37:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:49,064 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 04:37:49,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:37:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893079662] [2024-11-09 04:37:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893079662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:37:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:37:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 04:37:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737294099] [2024-11-09 04:37:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:37:49,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:37:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:37:49,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:37:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:37:49,068 INFO L87 Difference]: Start difference. First operand 469 states and 489 transitions. Second operand has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 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 04:37:51,393 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 04:37:53,399 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 04:37:55,402 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 04:37:57,404 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 04:37:59,408 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 04:38:01,414 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 04:38:03,418 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 04:38:05,422 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 04:38:07,427 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 04:38:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:14,217 INFO L93 Difference]: Finished difference Result 471 states and 492 transitions. [2024-11-09 04:38:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:38:14,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 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 62 [2024-11-09 04:38:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:14,221 INFO L225 Difference]: With dead ends: 471 [2024-11-09 04:38:14,221 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 04:38:14,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 04:38:14,222 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 360 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 13 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:14,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1719 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2602 Invalid, 9 Unknown, 0 Unchecked, 24.8s Time] [2024-11-09 04:38:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 04:38:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2024-11-09 04:38:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 275 states have (on average 1.749090909090909) internal successors, (481), 462 states have internal predecessors, (481), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 04:38:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 488 transitions. [2024-11-09 04:38:14,235 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 488 transitions. Word has length 62 [2024-11-09 04:38:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:14,235 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 488 transitions. [2024-11-09 04:38:14,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 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 04:38:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 488 transitions. [2024-11-09 04:38:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 04:38:14,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:14,236 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] [2024-11-09 04:38:14,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 04:38:14,237 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:38:14,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:14,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1253111870, now seen corresponding path program 1 times [2024-11-09 04:38:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148120022] [2024-11-09 04:38:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:14,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:15,718 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 04:38:15,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148120022] [2024-11-09 04:38:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148120022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520839355] [2024-11-09 04:38:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:15,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:15,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:15,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:38:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:15,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 04:38:15,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:15,972 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 04:38:16,211 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:38:16,211 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 04:38:16,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:38:16,295 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 04:38:16,313 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 04:38:16,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:38:16,563 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 51 treesize of output 48 [2024-11-09 04:38:16,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:38:16,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:38:16,762 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 04:38:16,769 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 04:38:16,867 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 04:38:16,879 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 04:38:16,948 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 04:38:16,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:17,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_841))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_840)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ 20 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (<= (+ (select (select (store .cse1 .cse0 v_ArrVal_835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_840)) (.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< (select |c_#length| .cse4) (+ 20 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_835 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 .cse4 v_ArrVal_835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4)))))))) is different from false [2024-11-09 04:38:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520839355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [310046186] [2024-11-09 04:38:17,525 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-09 04:38:17,525 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:38:17,525 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:38:17,526 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:38:17,526 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:38:23,473 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 04:38:23,897 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:41:39,344 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17699#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr160_42| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_42|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_42| 4294967296)))) (exists ((|v_#memory_$Pointer$.base_329| (Array Int (Array Int Int))) (|v_#valid_489| (Array Int Int)) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_8| (Array Int (Array Int Int))) (|v_#length_474| (Array Int Int)) (|v_#memory_$Pointer$.base_330| (Array Int (Array Int Int)))) (and (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_8| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_474| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#memory_$Pointer$.base_329| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_329| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_330| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_330|) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_8| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (select |v_#valid_489| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#length_474| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_8| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (= (store |v_#memory_$Pointer$.base_330| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_330| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_332|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_8| (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_8| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#valid_489| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_8| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_489| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_8| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0))) (exists ((|v_#memory_int_367| (Array Int (Array Int Int))) (|v_#memory_int_369| (Array Int (Array Int Int))) (|v_#memory_int_371| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_12| (Array Int (Array Int Int))) (|v_#memory_int_372| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_367| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_367| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_369| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_369|) (= |v_#memory_int_371| (store |v_#memory_int_369| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_369| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_371| |ULTIMATE.start_main_~user~0#1.base|) 16)))) (= (store |v_#memory_int_371| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_371| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_372| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_372|) (= (store |v_#memory_int_372| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_372| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_#memory_int_BEFORE_CALL_12| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_#memory_int_BEFORE_CALL_12|))) (exists ((|v_#memory_$Pointer$.offset_325| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_326| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_326| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_326| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_328|) (= |v_#memory_$Pointer$.offset_326| (store |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_326| |ULTIMATE.start_main_~user~0#1.base|) 36))))))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr160_42| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_42|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_42| 4294967296)))) (exists ((|v_#memory_$Pointer$.base_329| (Array Int (Array Int Int))) (|v_#valid_489| (Array Int Int)) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#length_474| (Array Int Int)) (|v_#memory_$Pointer$.base_330| (Array Int (Array Int Int)))) (and (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_474| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#memory_$Pointer$.base_329| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_329| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_330| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_330|) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_9|) (= (select |v_#valid_489| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (select |v_#valid_489| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_330| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_330| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_332|) (= (store |v_#valid_489| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= |#length| (store |v_#length_474| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)))) (exists ((|v_#memory_int_367| (Array Int (Array Int Int))) (|v_#memory_int_369| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_#memory_int_371| (Array Int (Array Int Int))) (|v_#memory_int_372| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_367| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_367| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_369| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_369|) (= |v_#memory_int_371| (store |v_#memory_int_369| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_369| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_371| |ULTIMATE.start_main_~user~0#1.base|) 16)))) (= (store |v_#memory_int_372| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_372| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_9|) (= (store |v_#memory_int_371| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_371| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_372| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_372|))) (exists ((|v_#memory_$Pointer$.offset_325| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_326| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_326| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_326| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_328|) (= |v_#memory_$Pointer$.offset_326| (store |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_326| |ULTIMATE.start_main_~user~0#1.base|) 36)))))))) (exists ((|v_#memory_$Pointer$.base_338| (Array Int (Array Int Int))) (|v_#memory_int_376| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_334| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_338| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8) (store (select |v_#memory_$Pointer$.base_338| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |v_#memory_$Pointer$.offset_334| |ULTIMATE.start_main_~user~0#1.base|) 8) 16) |ULTIMATE.start_main_~user~0#1.base|))) (= |#memory_int| (store |v_#memory_int_376| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8) (store (select |v_#memory_int_376| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |v_#memory_$Pointer$.offset_334| |ULTIMATE.start_main_~user~0#1.base|) 8) 16) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |v_#memory_$Pointer$.offset_334| |ULTIMATE.start_main_~user~0#1.base|) 8) 16))))) (<= 0 (+ (select (select |v_#memory_$Pointer$.offset_334| |ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1) (<= (+ (select (select |v_#memory_$Pointer$.offset_334| |ULTIMATE.start_main_~user~0#1.base|) 8) 20) (select |#length| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_334| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_334| (select (select |v_#memory_$Pointer$.base_338| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |v_#memory_$Pointer$.offset_334| |ULTIMATE.start_main_~user~0#1.base|) 8) 16) 8))))) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (<= (+ 5 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0))' at error location [2024-11-09 04:41:39,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:41:39,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:41:39,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-11-09 04:41:39,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694926553] [2024-11-09 04:41:39,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:41:39,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 04:41:39,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:41:39,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 04:41:39,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2796, Unknown=135, NotChecked=110, Total=3306 [2024-11-09 04:41:39,347 INFO L87 Difference]: Start difference. First operand 469 states and 488 transitions. Second operand has 19 states, 16 states have (on average 6.5625) internal successors, (105), 19 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:41:41,647 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 04:41:43,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 04:41:44,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:53,593 INFO L93 Difference]: Finished difference Result 470 states and 491 transitions. [2024-11-09 04:41:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:41:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.5625) internal successors, (105), 19 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2024-11-09 04:41:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:53,596 INFO L225 Difference]: With dead ends: 470 [2024-11-09 04:41:53,596 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 04:41:53,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 197.2s TimeCoverageRelationStatistics Valid=322, Invalid=3324, Unknown=140, NotChecked=120, Total=3906 [2024-11-09 04:41:53,599 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 355 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 3626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:53,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1928 Invalid, 3626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3608 Invalid, 2 Unknown, 0 Unchecked, 13.5s Time] [2024-11-09 04:41:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 04:41:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-11-09 04:41:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 275 states have (on average 1.7454545454545454) internal successors, (480), 461 states have internal predecessors, (480), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 04:41:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 487 transitions. [2024-11-09 04:41:53,610 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 487 transitions. Word has length 63 [2024-11-09 04:41:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:53,611 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 487 transitions. [2024-11-09 04:41:53,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.5625) internal successors, (105), 19 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:41:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 487 transitions. [2024-11-09 04:41:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 04:41:53,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:53,612 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] [2024-11-09 04:41:53,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:41:53,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:41:53,817 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 04:41:53,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1253111871, now seen corresponding path program 1 times [2024-11-09 04:41:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:41:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518185037] [2024-11-09 04:41:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:53,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:41:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:55,189 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 04:41:55,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:41:55,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518185037] [2024-11-09 04:41:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518185037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:41:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017372341] [2024-11-09 04:41:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:41:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:41:55,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:41:55,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebba44e-54e6-4178-9323-aff964b1d768/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:41:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:55,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 04:41:55,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:55,491 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 04:41:55,842 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 04:41:55,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 04:41:55,974 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 04:41:56,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 04:41:56,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:41:56,658 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 04:41:56,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:41:56,889 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 04:41:56,912 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 04:41:57,012 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 04:41:57,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:41:57,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 04:41:57,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 04:41:57,114 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_977 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_977))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_974)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 04:41:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017372341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:41:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1238337598] [2024-11-09 04:41:57,120 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-09 04:41:57,120 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:41:57,121 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:41:57,121 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:41:57,121 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:42:03,093 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 04:42:03,784 INFO L180 IcfgInterpreter]: Interpretation finished