./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/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_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/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_67a2749a-bb9d-42ea-a269-72fd65d23d2d/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 05:20:03,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:20:04,027 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:20:04,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:20:04,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:20:04,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:20:04,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:20:04,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:20:04,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:20:04,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:20:04,087 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:20:04,088 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:20:04,088 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:20:04,089 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:20:04,089 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:20:04,089 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:20:04,090 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:20:04,090 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:20:04,090 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:20:04,091 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:20:04,117 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:20:04,118 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:20:04,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:20:04,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:20:04,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:20:04,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:20:04,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:20:04,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:20:04,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:20:04,123 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:20:04,124 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:20:04,125 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:20:04,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:20:04,126 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:20:04,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:20:04,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:20:04,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:20:04,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:20:04,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:20:04,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:20:04,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:20:04,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:20:04,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:20:04,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:20:04,130 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:20:04,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:20:04,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:20:04,131 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:20:04,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:20:04,132 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_67a2749a-bb9d-42ea-a269-72fd65d23d2d/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_67a2749a-bb9d-42ea-a269-72fd65d23d2d/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 05:20:04,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:20:04,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:20:04,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:20:04,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:20:04,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:20:04,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i Unable to find full path for "g++" [2024-11-09 05:20:06,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:20:07,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:20:07,333 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2024-11-09 05:20:07,359 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/data/43bbfcdc4/9e32299999844847a196913ede3efd3a/FLAG46788c9c9 [2024-11-09 05:20:07,381 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/data/43bbfcdc4/9e32299999844847a196913ede3efd3a [2024-11-09 05:20:07,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:20:07,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:20:07,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:20:07,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:20:07,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:20:07,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:20:07" (1/1) ... [2024-11-09 05:20:07,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d42c6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:07, skipping insertion in model container [2024-11-09 05:20:07,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:20:07" (1/1) ... [2024-11-09 05:20:07,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:20:08,181 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:20:08,264 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:20:08,278 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:20:08,290 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:20:08,307 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:20:08,344 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 05:20:08,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:20:08,374 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:20:08,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:20:08,615 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:20:08,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08 WrapperNode [2024-11-09 05:20:08,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:20:08,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:20:08,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:20:08,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:20:08,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,776 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-09 05:20:08,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:20:08,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:20:08,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:20:08,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:20:08,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:20:08,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:20:08,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:20:08,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:20:08,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (1/1) ... [2024-11-09 05:20:08,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:20:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:20:08,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:20:08,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:20:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:20:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:20:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 05:20:09,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 05:20:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:20:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:20:09,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:20:09,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:20:09,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:20:09,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:20:09,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:20:09,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:20:09,288 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:20:09,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:20:09,295 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 05:20:11,919 INFO L? ?]: Removed 764 outVars from TransFormulas that were not future-live. [2024-11-09 05:20:11,919 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:20:12,994 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:20:12,995 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-09 05:20:12,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:20:12 BoogieIcfgContainer [2024-11-09 05:20:12,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:20:13,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:20:13,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:20:13,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:20:13,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:20:07" (1/3) ... [2024-11-09 05:20:13,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7911fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:20:13, skipping insertion in model container [2024-11-09 05:20:13,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:08" (2/3) ... [2024-11-09 05:20:13,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7911fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:20:13, skipping insertion in model container [2024-11-09 05:20:13,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:20:12" (3/3) ... [2024-11-09 05:20:13,015 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2024-11-09 05:20:13,039 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:20:13,039 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-09 05:20:13,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:20:13,149 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;@d0368b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:20:13,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-09 05:20:13,161 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 05:20:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:20:13,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:13,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:20:13,177 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 05:20:13,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash 40007419, now seen corresponding path program 1 times [2024-11-09 05:20:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190180631] [2024-11-09 05:20:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:13,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190180631] [2024-11-09 05:20:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190180631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:13,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:20:13,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365656] [2024-11-09 05:20:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:13,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:13,605 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 05:20:15,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:17,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:18,567 INFO L93 Difference]: Finished difference Result 517 states and 550 transitions. [2024-11-09 05:20:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:18,570 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 05:20:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:18,586 INFO L225 Difference]: With dead ends: 517 [2024-11-09 05:20:18,586 INFO L226 Difference]: Without dead ends: 516 [2024-11-09 05:20:18,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:18,592 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 461 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:18,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 243 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 384 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 05:20:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-09 05:20:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 513. [2024-11-09 05:20:18,667 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 05:20:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 544 transitions. [2024-11-09 05:20:18,671 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 544 transitions. Word has length 4 [2024-11-09 05:20:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:18,672 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 544 transitions. [2024-11-09 05:20:18,672 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 05:20:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 544 transitions. [2024-11-09 05:20:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:20:18,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:18,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:20:18,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:20:18,674 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 05:20:18,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash 40007420, now seen corresponding path program 1 times [2024-11-09 05:20:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:18,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040365543] [2024-11-09 05:20:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:18,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:18,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040365543] [2024-11-09 05:20:18,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040365543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:18,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:18,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:20:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828542376] [2024-11-09 05:20:18,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:18,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:18,803 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 05:20:20,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:22,027 INFO L93 Difference]: Finished difference Result 498 states and 531 transitions. [2024-11-09 05:20:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:22,029 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 05:20:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:22,032 INFO L225 Difference]: With dead ends: 498 [2024-11-09 05:20:22,032 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 05:20:22,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:22,034 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 283 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:22,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 436 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 05:20:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 05:20:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 487. [2024-11-09 05:20:22,060 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 05:20:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 518 transitions. [2024-11-09 05:20:22,063 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 518 transitions. Word has length 4 [2024-11-09 05:20:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:22,063 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 518 transitions. [2024-11-09 05:20:22,087 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 05:20:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 518 transitions. [2024-11-09 05:20:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:20:22,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:22,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:20:22,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:20:22,088 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 05:20:22,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 937567219, now seen corresponding path program 1 times [2024-11-09 05:20:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:22,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64047517] [2024-11-09 05:20:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:22,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:22,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64047517] [2024-11-09 05:20:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64047517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:20:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939672170] [2024-11-09 05:20:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:22,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:22,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:22,177 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 05:20:24,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:26,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 05:20:28,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:30,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:32,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:34,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:34,634 INFO L93 Difference]: Finished difference Result 954 states and 1013 transitions. [2024-11-09 05:20:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:34,635 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 05:20:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:34,639 INFO L225 Difference]: With dead ends: 954 [2024-11-09 05:20:34,640 INFO L226 Difference]: Without dead ends: 954 [2024-11-09 05:20:34,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:34,642 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 488 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:34,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1065 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 12.4s Time] [2024-11-09 05:20:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-11-09 05:20:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 489. [2024-11-09 05:20:34,695 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 05:20:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 520 transitions. [2024-11-09 05:20:34,702 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 520 transitions. Word has length 6 [2024-11-09 05:20:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:34,702 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 520 transitions. [2024-11-09 05:20:34,703 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 05:20:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 520 transitions. [2024-11-09 05:20:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:20:34,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:34,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:34,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:20:34,707 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 05:20:34,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2059687145, now seen corresponding path program 1 times [2024-11-09 05:20:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:34,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164721279] [2024-11-09 05:20:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:34,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:34,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164721279] [2024-11-09 05:20:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164721279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:34,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:34,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:20:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245150847] [2024-11-09 05:20:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:34,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:20:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:34,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:20:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:20:34,880 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 05:20:37,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:39,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:41,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:42,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:43,616 INFO L93 Difference]: Finished difference Result 470 states and 501 transitions. [2024-11-09 05:20:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:20:43,617 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 05:20:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:43,619 INFO L225 Difference]: With dead ends: 470 [2024-11-09 05:20:43,619 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 05:20:43,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:20:43,621 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 499 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:43,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 371 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 607 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2024-11-09 05:20:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 05:20:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2024-11-09 05:20:43,634 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 05:20:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 497 transitions. [2024-11-09 05:20:43,636 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 497 transitions. Word has length 12 [2024-11-09 05:20:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:43,637 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 497 transitions. [2024-11-09 05:20:43,637 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 05:20:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 497 transitions. [2024-11-09 05:20:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:20:43,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:43,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:43,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:20:43,638 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 05:20:43,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2059687146, now seen corresponding path program 1 times [2024-11-09 05:20:43,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:43,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069964573] [2024-11-09 05:20:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:43,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:43,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:43,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069964573] [2024-11-09 05:20:43,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069964573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:43,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:43,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:20:43,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257428502] [2024-11-09 05:20:43,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:43,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:43,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:43,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:43,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:43,781 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 05:20:45,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:47,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:48,053 INFO L93 Difference]: Finished difference Result 438 states and 467 transitions. [2024-11-09 05:20:48,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:48,054 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 05:20:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:48,057 INFO L225 Difference]: With dead ends: 438 [2024-11-09 05:20:48,057 INFO L226 Difference]: Without dead ends: 438 [2024-11-09 05:20:48,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:48,058 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 51 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:48,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 742 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 05:20:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-09 05:20:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-09 05:20:48,069 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 05:20:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 467 transitions. [2024-11-09 05:20:48,072 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 467 transitions. Word has length 12 [2024-11-09 05:20:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:48,072 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 467 transitions. [2024-11-09 05:20:48,072 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 05:20:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 467 transitions. [2024-11-09 05:20:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:20:48,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:48,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:48,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:20:48,074 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 05:20:48,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash -567438349, now seen corresponding path program 1 times [2024-11-09 05:20:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873528234] [2024-11-09 05:20:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:48,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:48,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873528234] [2024-11-09 05:20:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873528234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:48,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:48,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:20:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557042969] [2024-11-09 05:20:48,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:48,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:20:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:48,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:20:48,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:20:48,159 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 05:20:50,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:52,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:54,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:54,535 INFO L93 Difference]: Finished difference Result 427 states and 449 transitions. [2024-11-09 05:20:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:20:54,536 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 05:20:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:54,538 INFO L225 Difference]: With dead ends: 427 [2024-11-09 05:20:54,538 INFO L226 Difference]: Without dead ends: 427 [2024-11-09 05:20:54,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:20:54,540 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 38 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s 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 05:20:54,541 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 05:20:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-09 05:20:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 424. [2024-11-09 05:20:54,553 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 05:20:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 446 transitions. [2024-11-09 05:20:54,556 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 446 transitions. Word has length 13 [2024-11-09 05:20:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:54,556 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 446 transitions. [2024-11-09 05:20:54,557 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 05:20:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 446 transitions. [2024-11-09 05:20:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:20:54,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:54,558 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 05:20:54,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:20:54,559 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 05:20:54,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:54,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1864044287, now seen corresponding path program 1 times [2024-11-09 05:20:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:54,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91586260] [2024-11-09 05:20:54,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:54,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91586260] [2024-11-09 05:20:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91586260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:20:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635152605] [2024-11-09 05:20:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:54,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:20:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:54,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:20:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:20:54,861 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 05:20:56,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:20:58,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:00,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:01,708 INFO L93 Difference]: Finished difference Result 499 states and 526 transitions. [2024-11-09 05:21:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:21:01,709 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 05:21:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:01,712 INFO L225 Difference]: With dead ends: 499 [2024-11-09 05:21:01,712 INFO L226 Difference]: Without dead ends: 499 [2024-11-09 05:21:01,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:21:01,713 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 176 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:01,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 633 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2024-11-09 05:21:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-09 05:21:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 420. [2024-11-09 05:21:01,724 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 05:21:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 442 transitions. [2024-11-09 05:21:01,726 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 442 transitions. Word has length 27 [2024-11-09 05:21:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:01,727 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 442 transitions. [2024-11-09 05:21:01,727 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 05:21:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 442 transitions. [2024-11-09 05:21:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 05:21:01,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:01,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:01,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:21:01,729 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 05:21:01,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 564208809, now seen corresponding path program 1 times [2024-11-09 05:21:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:01,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556411290] [2024-11-09 05:21:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:01,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:01,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556411290] [2024-11-09 05:21:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556411290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:01,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:21:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329709219] [2024-11-09 05:21:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:01,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:21:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:01,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:21:01,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:21:01,900 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 05:21:03,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:04,523 INFO L93 Difference]: Finished difference Result 420 states and 438 transitions. [2024-11-09 05:21:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:21:04,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 05:21:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:04,526 INFO L225 Difference]: With dead ends: 420 [2024-11-09 05:21:04,526 INFO L226 Difference]: Without dead ends: 420 [2024-11-09 05:21:04,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:21:04,528 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 15 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:04,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1066 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 05:21:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-09 05:21:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-09 05:21:04,544 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 05:21:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 438 transitions. [2024-11-09 05:21:04,548 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 438 transitions. Word has length 43 [2024-11-09 05:21:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:04,548 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 438 transitions. [2024-11-09 05:21:04,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 438 transitions. [2024-11-09 05:21:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 05:21:04,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:04,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:04,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:21:04,555 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 05:21:04,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1305848203, now seen corresponding path program 1 times [2024-11-09 05:21:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:04,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889683021] [2024-11-09 05:21:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:04,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:04,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889683021] [2024-11-09 05:21:04,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889683021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:04,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:04,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:21:04,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13694257] [2024-11-09 05:21:04,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:04,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:21:04,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:04,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:21:04,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:21:04,815 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 05:21:06,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:08,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:09,521 INFO L93 Difference]: Finished difference Result 463 states and 481 transitions. [2024-11-09 05:21:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:21:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 05:21:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:09,526 INFO L225 Difference]: With dead ends: 463 [2024-11-09 05:21:09,526 INFO L226 Difference]: Without dead ends: 463 [2024-11-09 05:21:09,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:21:09,529 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:09,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 05:21:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-09 05:21:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2024-11-09 05:21:09,543 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 05:21:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 481 transitions. [2024-11-09 05:21:09,545 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 481 transitions. Word has length 47 [2024-11-09 05:21:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:09,546 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 481 transitions. [2024-11-09 05:21:09,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 481 transitions. [2024-11-09 05:21:09,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:21:09,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:09,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:09,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:21:09,554 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 05:21:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:09,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2144323169, now seen corresponding path program 1 times [2024-11-09 05:21:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:09,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394891332] [2024-11-09 05:21:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:10,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:10,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394891332] [2024-11-09 05:21:10,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394891332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:10,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:10,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:21:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12258367] [2024-11-09 05:21:10,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:10,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:21:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:10,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:21:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:21:10,107 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 05:21:12,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:14,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:15,243 INFO L93 Difference]: Finished difference Result 462 states and 480 transitions. [2024-11-09 05:21:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:21:15,244 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 05:21:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:15,246 INFO L225 Difference]: With dead ends: 462 [2024-11-09 05:21:15,246 INFO L226 Difference]: Without dead ends: 462 [2024-11-09 05:21:15,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:21:15,248 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 2 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:15,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 962 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 768 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2024-11-09 05:21:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-09 05:21:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2024-11-09 05:21:15,258 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 05:21:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2024-11-09 05:21:15,260 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 54 [2024-11-09 05:21:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:15,263 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2024-11-09 05:21:15,264 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 05:21:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2024-11-09 05:21:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:21:15,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:15,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:15,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:21:15,267 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 05:21:15,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:15,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2144323168, now seen corresponding path program 1 times [2024-11-09 05:21:15,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957599040] [2024-11-09 05:21:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:16,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957599040] [2024-11-09 05:21:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957599040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:16,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:21:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640611201] [2024-11-09 05:21:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:16,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:21:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:21:16,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:21:16,258 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 05:21:18,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:20,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:22,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:24,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:25,184 INFO L93 Difference]: Finished difference Result 461 states and 479 transitions. [2024-11-09 05:21:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:21:25,185 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 05:21:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:25,187 INFO L225 Difference]: With dead ends: 461 [2024-11-09 05:21:25,187 INFO L226 Difference]: Without dead ends: 461 [2024-11-09 05:21:25,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:21:25,189 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s 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, 8.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:25,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 925 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 800 Invalid, 4 Unknown, 0 Unchecked, 8.9s Time] [2024-11-09 05:21:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-09 05:21:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-11-09 05:21:25,199 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 05:21:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 479 transitions. [2024-11-09 05:21:25,201 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 479 transitions. Word has length 54 [2024-11-09 05:21:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 479 transitions. [2024-11-09 05:21:25,202 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 05:21:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 479 transitions. [2024-11-09 05:21:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 05:21:25,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:25,203 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 05:21:25,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:21:25,204 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 05:21:25,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1582971899, now seen corresponding path program 1 times [2024-11-09 05:21:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061748804] [2024-11-09 05:21:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:25,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:25,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061748804] [2024-11-09 05:21:25,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061748804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:25,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:25,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:21:25,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274023658] [2024-11-09 05:21:25,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:25,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:21:25,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:21:25,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:21:25,710 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 05:21:27,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:29,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:31,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:33,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:35,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:37,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:38,761 INFO L93 Difference]: Finished difference Result 471 states and 492 transitions. [2024-11-09 05:21:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:21:38,762 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 05:21:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:38,766 INFO L225 Difference]: With dead ends: 471 [2024-11-09 05:21:38,767 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 05:21:38,768 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 05:21:38,769 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 5 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:38,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1316 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 847 Invalid, 6 Unknown, 0 Unchecked, 13.0s Time] [2024-11-09 05:21:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 05:21:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 466. [2024-11-09 05:21:38,781 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 05:21:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 488 transitions. [2024-11-09 05:21:38,783 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 488 transitions. Word has length 60 [2024-11-09 05:21:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:38,785 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 488 transitions. [2024-11-09 05:21:38,786 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 05:21:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 488 transitions. [2024-11-09 05:21:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 05:21:38,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:38,789 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 05:21:38,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:21:38,789 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 05:21:38,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1582971898, now seen corresponding path program 1 times [2024-11-09 05:21:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527369421] [2024-11-09 05:21:38,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:38,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:39,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527369421] [2024-11-09 05:21:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527369421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:39,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:21:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146006773] [2024-11-09 05:21:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:21:39,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:39,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:21:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:21:39,831 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 05:21:41,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:21:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:42,569 INFO L93 Difference]: Finished difference Result 466 states and 487 transitions. [2024-11-09 05:21:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:21:42,569 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 05:21:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:42,571 INFO L225 Difference]: With dead ends: 466 [2024-11-09 05:21:42,572 INFO L226 Difference]: Without dead ends: 466 [2024-11-09 05:21:42,572 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 05:21:42,573 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 1 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:42,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1222 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 05:21:42,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-09 05:21:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-11-09 05:21:42,582 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 05:21:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 487 transitions. [2024-11-09 05:21:42,585 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 487 transitions. Word has length 60 [2024-11-09 05:21:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:42,585 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 487 transitions. [2024-11-09 05:21:42,585 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 05:21:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 487 transitions. [2024-11-09 05:21:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 05:21:42,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:42,587 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 05:21:42,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:21:42,587 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 05:21:42,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -479516464, now seen corresponding path program 1 times [2024-11-09 05:21:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:42,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567044479] [2024-11-09 05:21:42,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:42,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:43,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:43,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567044479] [2024-11-09 05:21:43,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567044479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:21:43,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806867308] [2024-11-09 05:21:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:43,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:21:43,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:21:43,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:21:43,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:21:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:43,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 05:21:43,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:21:43,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:21:44,078 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:21:44,079 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 05:21:44,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:21:44,259 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 05:21:44,498 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:21:44,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 05:21:44,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 05:21:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:44,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:21:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806867308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:21:44,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065422150] [2024-11-09 05:21:44,741 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2024-11-09 05:21:44,741 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:21:44,747 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:21:44,754 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:21:44,754 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:21:51,715 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 05:21:52,130 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:24:32,939 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 05:24:32,939 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:24:32,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:24:32,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 05:24:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841690050] [2024-11-09 05:24:32,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:24:32,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 05:24:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:24:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 05:24:32,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2329, Unknown=93, NotChecked=0, Total=2652 [2024-11-09 05:24:32,942 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 05:24:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:38,806 INFO L93 Difference]: Finished difference Result 470 states and 491 transitions. [2024-11-09 05:24:38,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:24:38,807 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 05:24:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:38,808 INFO L225 Difference]: With dead ends: 470 [2024-11-09 05:24:38,808 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 05:24:38,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 161.5s TimeCoverageRelationStatistics Valid=262, Invalid=2722, Unknown=96, NotChecked=0, Total=3080 [2024-11-09 05:24:38,810 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 356 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:38,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1715 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-09 05:24:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 05:24:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-11-09 05:24:38,819 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 05:24:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 487 transitions. [2024-11-09 05:24:38,820 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 487 transitions. Word has length 61 [2024-11-09 05:24:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:38,821 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 487 transitions. [2024-11-09 05:24:38,821 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 05:24:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 487 transitions. [2024-11-09 05:24:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 05:24:38,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:38,822 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 05:24:38,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:24:39,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 05:24:39,027 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 05:24:39,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -479516463, now seen corresponding path program 1 times [2024-11-09 05:24:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752826872] [2024-11-09 05:24:39,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:39,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:40,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:24:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752826872] [2024-11-09 05:24:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752826872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:24:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401761310] [2024-11-09 05:24:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:40,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:24:40,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:24:40,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:24:40,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:24:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:40,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 05:24:40,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:24:40,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:24:40,728 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 05:24:40,763 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:24:40,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 05:24:40,839 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 05:24:40,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:24:41,108 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 05:24:41,117 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 05:24:41,380 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:24:41,380 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 05:24:41,393 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 05:24:41,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 05:24:41,505 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 05:24:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:24:41,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:24:41,867 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 05:24:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401761310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:24:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1990767172] [2024-11-09 05:24:41,875 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2024-11-09 05:24:41,876 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:24:41,876 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:24:41,876 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:24:41,877 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:24:47,740 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 05:24:48,453 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:27:29,844 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 05:27:29,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:27:29,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:27:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-09 05:27:29,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259655979] [2024-11-09 05:27:29,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:27:29,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 05:27:29,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:27:29,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 05:27:29,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2338, Unknown=85, NotChecked=100, Total=2756 [2024-11-09 05:27:29,847 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 05:27:32,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:34,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:36,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:38,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:40,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:42,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:44,209 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 05:27:46,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:48,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:50,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:52,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:54,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:56,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:27:58,233 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 05:28:00,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:02,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:28:12,819 INFO L93 Difference]: Finished difference Result 469 states and 490 transitions. [2024-11-09 05:28:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:28:12,820 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 05:28:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:28:12,822 INFO L225 Difference]: With dead ends: 469 [2024-11-09 05:28:12,822 INFO L226 Difference]: Without dead ends: 469 [2024-11-09 05:28:12,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 163.1s TimeCoverageRelationStatistics Valid=271, Invalid=2728, Unknown=85, NotChecked=108, Total=3192 [2024-11-09 05:28:12,824 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 352 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 21 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:28:12,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1099 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2804 Invalid, 15 Unknown, 0 Unchecked, 42.1s Time] [2024-11-09 05:28:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-09 05:28:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 462. [2024-11-09 05:28:12,844 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 05:28:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2024-11-09 05:28:12,847 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 61 [2024-11-09 05:28:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:28:12,847 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2024-11-09 05:28:12,848 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 05:28:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2024-11-09 05:28:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 05:28:12,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:28:12,849 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 05:28:12,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:28:13,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 05:28:13,053 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 05:28:13,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:28:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash -816862793, now seen corresponding path program 1 times [2024-11-09 05:28:13,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:28:13,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429573181] [2024-11-09 05:28:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:28:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:28:14,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:28:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429573181] [2024-11-09 05:28:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429573181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:28:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:28:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:28:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795154720] [2024-11-09 05:28:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:28:14,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:28:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:28:14,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:28:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:28:14,621 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 05:28:16,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:18,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:20,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:22,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:24,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:26,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:28,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:30,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:32,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:28:40,961 INFO L93 Difference]: Finished difference Result 472 states and 493 transitions. [2024-11-09 05:28:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:28:40,961 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 05:28:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:28:40,963 INFO L225 Difference]: With dead ends: 472 [2024-11-09 05:28:40,963 INFO L226 Difference]: Without dead ends: 472 [2024-11-09 05:28:40,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-09 05:28:40,964 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 379 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 12 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s 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, 26.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:28:40,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1055 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2351 Invalid, 9 Unknown, 0 Unchecked, 26.0s Time] [2024-11-09 05:28:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-09 05:28:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 469. [2024-11-09 05:28:40,974 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 05:28:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 489 transitions. [2024-11-09 05:28:40,975 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 489 transitions. Word has length 62 [2024-11-09 05:28:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:28:40,976 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 489 transitions. [2024-11-09 05:28:40,976 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 05:28:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 489 transitions. [2024-11-09 05:28:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 05:28:40,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:28:40,977 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 05:28:40,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 05:28:40,977 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 05:28:40,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:28:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash -816862794, now seen corresponding path program 1 times [2024-11-09 05:28:40,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:28:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590317269] [2024-11-09 05:28:40,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:28:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:28:42,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:28:42,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590317269] [2024-11-09 05:28:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590317269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:28:42,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:28:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 05:28:42,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927686089] [2024-11-09 05:28:42,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:28:42,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:28:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:28:42,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:28:42,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:28:42,118 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 05:28:44,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:28:53,751 INFO L93 Difference]: Finished difference Result 471 states and 492 transitions. [2024-11-09 05:28:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:28:53,751 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 05:28:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:28:53,753 INFO L225 Difference]: With dead ends: 471 [2024-11-09 05:28:53,753 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 05:28:53,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 05:28:53,754 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 360 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:28:53,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1719 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2608 Invalid, 1 Unknown, 0 Unchecked, 11.2s Time] [2024-11-09 05:28:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 05:28:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2024-11-09 05:28:53,762 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 05:28:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 488 transitions. [2024-11-09 05:28:53,763 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 488 transitions. Word has length 62 [2024-11-09 05:28:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:28:53,764 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 488 transitions. [2024-11-09 05:28:53,764 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 05:28:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 488 transitions. [2024-11-09 05:28:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 05:28:53,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:28:53,765 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 05:28:53,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:28:53,765 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 05:28:53,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:28:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1253111870, now seen corresponding path program 1 times [2024-11-09 05:28:53,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:28:53,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396248414] [2024-11-09 05:28:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:28:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:28:55,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:28:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396248414] [2024-11-09 05:28:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396248414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:28:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403516810] [2024-11-09 05:28:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:55,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:28:55,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:28:55,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:28:55,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:28:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:55,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 05:28:55,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:28:55,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:28:56,273 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:28:56,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 05:28:56,293 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 05:28:56,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:28:56,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:28:56,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:28:56,765 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 05:28:56,775 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 05:28:57,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:28:57,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-09 05:28:57,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-09 05:28:57,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-09 05:28:57,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-09 05:28:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:28:57,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:28:58,047 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 05:28:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403516810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:28:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [325981930] [2024-11-09 05:28:58,058 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-09 05:28:58,058 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:28:58,059 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:28:58,059 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:28:58,059 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:29:01,135 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 05:29:01,514 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:29:09,032 WARN L286 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 194 DAG size of output: 185 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:32:22,241 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 05:32:22,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:32:22,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:32:22,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-11-09 05:32:22,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746072413] [2024-11-09 05:32:22,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:32:22,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 05:32:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:32:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 05:32:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2822, Unknown=109, NotChecked=110, Total=3306 [2024-11-09 05:32:22,243 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 05:32:24,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:32:26,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:32:28,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:32:30,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:32:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:32:44,947 INFO L93 Difference]: Finished difference Result 470 states and 491 transitions. [2024-11-09 05:32:44,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:32:44,948 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 05:32:44,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:32:44,950 INFO L225 Difference]: With dead ends: 470 [2024-11-09 05:32:44,950 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 05:32:44,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 203.4s TimeCoverageRelationStatistics Valid=322, Invalid=3348, Unknown=116, NotChecked=120, Total=3906 [2024-11-09 05:32:44,952 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 355 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 3607 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 3626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3607 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:32:44,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1928 Invalid, 3626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3607 Invalid, 3 Unknown, 0 Unchecked, 21.6s Time] [2024-11-09 05:32:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 05:32:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-11-09 05:32:44,969 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 05:32:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 487 transitions. [2024-11-09 05:32:44,972 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 487 transitions. Word has length 63 [2024-11-09 05:32:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:32:44,972 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 487 transitions. [2024-11-09 05:32:44,973 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 05:32:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 487 transitions. [2024-11-09 05:32:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 05:32:44,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:32:44,974 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 05:32:45,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 05:32:45,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 05:32:45,179 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 05:32:45,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:32:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1253111871, now seen corresponding path program 1 times [2024-11-09 05:32:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:32:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110848246] [2024-11-09 05:32:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:32:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:32:46,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:32:46,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110848246] [2024-11-09 05:32:46,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110848246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:32:46,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275579055] [2024-11-09 05:32:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:46,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:32:46,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:32:46,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:32:46,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67a2749a-bb9d-42ea-a269-72fd65d23d2d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:32:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:47,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 05:32:47,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:32:47,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:32:47,647 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:32:47,648 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 05:32:47,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:32:48,313 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 05:32:48,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:32:48,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 05:32:49,412 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:32:49,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 05:32:49,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 05:32:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:32:49,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:32:49,908 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 05:32:50,064 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 05:32:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275579055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:32:50,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [977026568] [2024-11-09 05:32:50,078 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-09 05:32:50,078 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:32:50,079 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:32:50,079 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:32:50,079 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:32:56,002 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 05:32:56,943 INFO L180 IcfgInterpreter]: Interpretation finished