./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/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_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/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_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/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:21:02,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:21:02,783 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:21:02,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:21:02,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:21:02,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:21:02,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:21:02,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:21:02,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:21:02,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:21:02,837 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:21:02,838 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:21:02,838 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:21:02,838 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:21:02,839 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:21:02,839 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:21:02,839 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:21:02,844 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:21:02,844 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:21:02,844 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:21:02,845 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:21:02,845 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:21:02,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:21:02,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:21:02,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:21:02,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:21:02,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:21:02,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:21:02,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:21:02,865 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:21:02,865 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:21:02,865 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:21:02,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:21:02,866 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:21:02,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:21:02,866 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:21:02,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:21:02,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:21:02,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:21:02,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:21:02,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:21:02,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:21:02,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:21:02,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:21:02,870 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:21:02,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:21:02,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:21:02,871 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:21:02,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:21:02,871 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_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/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_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/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:21:03,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:21:03,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:21:03,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:21:03,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:21:03,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:21:03,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i Unable to find full path for "g++" [2024-11-09 05:21:05,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:21:05,512 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:21:05,512 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2024-11-09 05:21:05,533 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/data/43f410f8c/008dbf4e0b0c4259a48e2cefb0695aa7/FLAG452124095 [2024-11-09 05:21:05,549 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/data/43f410f8c/008dbf4e0b0c4259a48e2cefb0695aa7 [2024-11-09 05:21:05,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:21:05,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:21:05,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:21:05,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:21:05,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:21:05,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:21:05" (1/1) ... [2024-11-09 05:21:05,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a90424c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:05, skipping insertion in model container [2024-11-09 05:21:05,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:21:05" (1/1) ... [2024-11-09 05:21:05,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:21:06,150 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:21:06,207 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:21:06,214 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:21:06,225 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:21:06,233 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:21:06,253 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:21:06,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:21:06,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:21:06,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:21:06,427 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:21:06,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06 WrapperNode [2024-11-09 05:21:06,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:21:06,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:21:06,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:21:06,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:21:06,438 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:21:06" (1/1) ... [2024-11-09 05:21:06,478 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:21:06" (1/1) ... [2024-11-09 05:21:06,545 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-09 05:21:06,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:21:06,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:21:06,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:21:06,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:21:06,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:21:06,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:21:06,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:21:06,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:21:06,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (1/1) ... [2024-11-09 05:21:06,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:21:06,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:21:06,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/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:21:06,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/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:21:06,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:21:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:21:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 05:21:06,791 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 05:21:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:21:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:21:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:21:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:21:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:21:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:21:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:21:06,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:21:06,961 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:21:06,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:21:06,968 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 05:21:08,794 INFO L? ?]: Removed 764 outVars from TransFormulas that were not future-live. [2024-11-09 05:21:08,794 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:21:09,709 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:21:09,712 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-09 05:21:09,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:21:09 BoogieIcfgContainer [2024-11-09 05:21:09,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:21:09,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:21:09,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:21:09,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:21:09,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:21:05" (1/3) ... [2024-11-09 05:21:09,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbdd72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:21:09, skipping insertion in model container [2024-11-09 05:21:09,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:06" (2/3) ... [2024-11-09 05:21:09,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbdd72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:21:09, skipping insertion in model container [2024-11-09 05:21:09,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:21:09" (3/3) ... [2024-11-09 05:21:09,724 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-1.i [2024-11-09 05:21:09,744 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:21:09,745 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-09 05:21:09,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:21:09,826 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;@f347b62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:21:09,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-09 05:21:09,834 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:21:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:21:09,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:09,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:21:09,843 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:21:09,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:09,850 INFO L85 PathProgramCache]: Analyzing trace with hash 40007419, now seen corresponding path program 1 times [2024-11-09 05:21:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047707686] [2024-11-09 05:21:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:10,114 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,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047707686] [2024-11-09 05:21:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047707686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:10,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:21:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249886965] [2024-11-09 05:21:10,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:10,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:21:10,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:10,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:21:10,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:21:10,173 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:21:12,342 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:21:14,376 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:21:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:15,027 INFO L93 Difference]: Finished difference Result 517 states and 550 transitions. [2024-11-09 05:21:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:21:15,030 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:21:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:15,042 INFO L225 Difference]: With dead ends: 517 [2024-11-09 05:21:15,042 INFO L226 Difference]: Without dead ends: 516 [2024-11-09 05:21:15,043 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:15,047 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 461 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:15,048 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.8s Time] [2024-11-09 05:21:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-09 05:21:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 513. [2024-11-09 05:21:15,131 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:21:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 544 transitions. [2024-11-09 05:21:15,136 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 544 transitions. Word has length 4 [2024-11-09 05:21:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:15,137 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 544 transitions. [2024-11-09 05:21:15,138 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:21:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 544 transitions. [2024-11-09 05:21:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:21:15,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:15,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:21:15,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:21:15,140 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:21:15,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash 40007420, now seen corresponding path program 1 times [2024-11-09 05:21:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37464667] [2024-11-09 05:21:15,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:15,272 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:15,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37464667] [2024-11-09 05:21:15,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37464667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:15,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:15,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:21:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596761181] [2024-11-09 05:21:15,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:21:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:21:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:21:15,276 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:21:17,400 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:21:19,427 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:21:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:19,868 INFO L93 Difference]: Finished difference Result 498 states and 531 transitions. [2024-11-09 05:21:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:21:19,868 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:21:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:19,870 INFO L225 Difference]: With dead ends: 498 [2024-11-09 05:21:19,871 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 05:21:19,871 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:19,872 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 283 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:19,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 436 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 327 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 05:21:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 05:21:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 487. [2024-11-09 05:21:19,888 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:21:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 518 transitions. [2024-11-09 05:21:19,890 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 518 transitions. Word has length 4 [2024-11-09 05:21:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:19,891 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 518 transitions. [2024-11-09 05:21:19,891 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:21:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 518 transitions. [2024-11-09 05:21:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:21:19,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:19,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:21:19,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:21:19,892 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:21:19,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash 937567219, now seen corresponding path program 1 times [2024-11-09 05:21:19,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:19,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875648795] [2024-11-09 05:21:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:19,930 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:19,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:19,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875648795] [2024-11-09 05:21:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875648795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:19,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:19,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:21:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443164707] [2024-11-09 05:21:19,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:19,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:21:19,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:19,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:21:19,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:21:19,935 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:21:21,973 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:24,573 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:26,576 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:21:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:27,172 INFO L93 Difference]: Finished difference Result 954 states and 1013 transitions. [2024-11-09 05:21:27,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:21:27,173 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:21:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:27,176 INFO L225 Difference]: With dead ends: 954 [2024-11-09 05:21:27,177 INFO L226 Difference]: Without dead ends: 954 [2024-11-09 05:21:27,177 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:27,178 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 488 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:27,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1065 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2024-11-09 05:21:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-11-09 05:21:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 489. [2024-11-09 05:21:27,197 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:21:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 520 transitions. [2024-11-09 05:21:27,199 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 520 transitions. Word has length 6 [2024-11-09 05:21:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:27,199 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 520 transitions. [2024-11-09 05:21:27,200 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:21:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 520 transitions. [2024-11-09 05:21:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:21:27,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:27,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:27,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:21:27,201 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:21:27,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2059687145, now seen corresponding path program 1 times [2024-11-09 05:21:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:27,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064190142] [2024-11-09 05:21:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:27,292 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:27,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064190142] [2024-11-09 05:21:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064190142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:27,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:27,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:21:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035205072] [2024-11-09 05:21:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:27,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:21:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:27,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:21:27,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:21:27,295 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:21:29,406 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:21:31,437 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:21:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:32,906 INFO L93 Difference]: Finished difference Result 470 states and 501 transitions. [2024-11-09 05:21:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:21:32,908 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:21:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:32,910 INFO L225 Difference]: With dead ends: 470 [2024-11-09 05:21:32,910 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 05:21:32,910 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:32,911 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 499 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 608 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:32,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 371 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 608 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2024-11-09 05:21:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 05:21:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2024-11-09 05:21:32,922 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:21:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 497 transitions. [2024-11-09 05:21:32,924 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 497 transitions. Word has length 12 [2024-11-09 05:21:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:32,924 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 497 transitions. [2024-11-09 05:21:32,925 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:21:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 497 transitions. [2024-11-09 05:21:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:21:32,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:32,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:32,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:21:32,926 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:21:32,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2059687146, now seen corresponding path program 1 times [2024-11-09 05:21:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826000333] [2024-11-09 05:21:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:33,015 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:33,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:33,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826000333] [2024-11-09 05:21:33,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826000333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:33,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:33,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:21:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125491896] [2024-11-09 05:21:33,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:33,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:21:33,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:33,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:21:33,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:21:33,039 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:21:35,108 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:37,113 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:21:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:37,252 INFO L93 Difference]: Finished difference Result 438 states and 467 transitions. [2024-11-09 05:21:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:21:37,253 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:21:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:37,255 INFO L225 Difference]: With dead ends: 438 [2024-11-09 05:21:37,255 INFO L226 Difference]: Without dead ends: 438 [2024-11-09 05:21:37,255 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:21:37,256 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:37,257 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.2s Time] [2024-11-09 05:21:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-09 05:21:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-09 05:21:37,267 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:21:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 467 transitions. [2024-11-09 05:21:37,269 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 467 transitions. Word has length 12 [2024-11-09 05:21:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:37,270 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 467 transitions. [2024-11-09 05:21:37,270 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:21:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 467 transitions. [2024-11-09 05:21:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:21:37,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:37,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:37,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:21:37,272 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:21:37,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -567438349, now seen corresponding path program 1 times [2024-11-09 05:21:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929490949] [2024-11-09 05:21:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:37,355 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:37,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:37,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929490949] [2024-11-09 05:21:37,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929490949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:37,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:37,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:21:37,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199622747] [2024-11-09 05:21:37,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:37,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:21:37,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:37,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:21:37,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:21:37,358 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:21:39,447 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:41,453 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:43,456 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:21:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:43,635 INFO L93 Difference]: Finished difference Result 427 states and 449 transitions. [2024-11-09 05:21:43,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:21:43,636 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:21:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:43,638 INFO L225 Difference]: With dead ends: 427 [2024-11-09 05:21:43,638 INFO L226 Difference]: Without dead ends: 427 [2024-11-09 05:21:43,638 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:43,639 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 38 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:43,640 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.2s Time] [2024-11-09 05:21:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-09 05:21:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 424. [2024-11-09 05:21:43,651 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:21:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 446 transitions. [2024-11-09 05:21:43,653 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 446 transitions. Word has length 13 [2024-11-09 05:21:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:43,654 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 446 transitions. [2024-11-09 05:21:43,654 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:21:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 446 transitions. [2024-11-09 05:21:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:21:43,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:43,655 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:21:43,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:21:43,656 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:21:43,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1864044287, now seen corresponding path program 1 times [2024-11-09 05:21:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:43,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152732036] [2024-11-09 05:21:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:43,919 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:43,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152732036] [2024-11-09 05:21:43,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152732036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:43,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:21:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196450164] [2024-11-09 05:21:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:43,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:21:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:21:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:21:43,922 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:21:45,968 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:21:47,971 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:49,974 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:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:50,605 INFO L93 Difference]: Finished difference Result 499 states and 526 transitions. [2024-11-09 05:21:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:21:50,606 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:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:50,608 INFO L225 Difference]: With dead ends: 499 [2024-11-09 05:21:50,608 INFO L226 Difference]: Without dead ends: 499 [2024-11-09 05:21:50,608 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:50,609 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 176 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:50,609 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.6s Time] [2024-11-09 05:21:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-09 05:21:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 420. [2024-11-09 05:21:50,621 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:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 442 transitions. [2024-11-09 05:21:50,623 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 442 transitions. Word has length 27 [2024-11-09 05:21:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:50,624 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 442 transitions. [2024-11-09 05:21:50,624 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:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 442 transitions. [2024-11-09 05:21:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 05:21:50,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:50,627 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:50,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:21:50,627 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:50,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash 564208809, now seen corresponding path program 1 times [2024-11-09 05:21:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:50,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884350745] [2024-11-09 05:21:50,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:50,798 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:50,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:50,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884350745] [2024-11-09 05:21:50,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884350745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:50,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:21:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420991508] [2024-11-09 05:21:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:50,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:21:50,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:50,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:21:50,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:21:50,802 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:52,927 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:54,930 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:21:56,943 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:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:57,117 INFO L93 Difference]: Finished difference Result 420 states and 438 transitions. [2024-11-09 05:21:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:21:57,117 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:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:57,119 INFO L225 Difference]: With dead ends: 420 [2024-11-09 05:21:57,119 INFO L226 Difference]: Without dead ends: 420 [2024-11-09 05:21:57,119 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:57,120 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 15 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:57,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1066 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 204 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2024-11-09 05:21:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-09 05:21:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-09 05:21:57,134 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:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 438 transitions. [2024-11-09 05:21:57,135 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 438 transitions. Word has length 43 [2024-11-09 05:21:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:57,137 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 438 transitions. [2024-11-09 05:21:57,138 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:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 438 transitions. [2024-11-09 05:21:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 05:21:57,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:57,139 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:57,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:21:57,139 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:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1305848203, now seen corresponding path program 1 times [2024-11-09 05:21:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090908533] [2024-11-09 05:21:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:57,326 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:57,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:57,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090908533] [2024-11-09 05:21:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090908533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:57,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:57,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:21:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665626051] [2024-11-09 05:21:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:57,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:21:57,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:57,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:21:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:21:57,329 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:59,352 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:22:01,455 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:22:03,460 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:22:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:22:03,562 INFO L93 Difference]: Finished difference Result 463 states and 481 transitions. [2024-11-09 05:22:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:22:03,562 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:22:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:22:03,564 INFO L225 Difference]: With dead ends: 463 [2024-11-09 05:22:03,564 INFO L226 Difference]: Without dead ends: 463 [2024-11-09 05:22:03,564 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:22:03,565 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:22:03,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2024-11-09 05:22:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-09 05:22:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2024-11-09 05:22:03,574 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:22:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 481 transitions. [2024-11-09 05:22:03,579 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 481 transitions. Word has length 47 [2024-11-09 05:22:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:22:03,580 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 481 transitions. [2024-11-09 05:22:03,580 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:22:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 481 transitions. [2024-11-09 05:22:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:22:03,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:22:03,584 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:22:03,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:22:03,584 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:22:03,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:22:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2144323169, now seen corresponding path program 1 times [2024-11-09 05:22:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:22:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510281377] [2024-11-09 05:22:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:22:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:22:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:22:04,092 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:22:04,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:22:04,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510281377] [2024-11-09 05:22:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510281377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:22:04,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:22:04,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:22:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170164522] [2024-11-09 05:22:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:22:04,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:22:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:22:04,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:22:04,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:22:04,094 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:22:06,136 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:22:08,140 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:22:10,144 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:22:12,147 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:22:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:22:12,843 INFO L93 Difference]: Finished difference Result 462 states and 480 transitions. [2024-11-09 05:22:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:22:12,844 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:22:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:22:12,846 INFO L225 Difference]: With dead ends: 462 [2024-11-09 05:22:12,847 INFO L226 Difference]: Without dead ends: 462 [2024-11-09 05:22:12,847 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:22:12,847 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 2 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:22:12,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 962 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2024-11-09 05:22:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-09 05:22:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2024-11-09 05:22:12,856 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:22:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2024-11-09 05:22:12,858 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 54 [2024-11-09 05:22:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:22:12,858 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2024-11-09 05:22:12,858 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:22:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2024-11-09 05:22:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:22:12,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:22:12,861 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:22:12,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:22:12,862 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:22:12,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:22:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2144323168, now seen corresponding path program 1 times [2024-11-09 05:22:12,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:22:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106437250] [2024-11-09 05:22:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:22:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:22:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:22:13,615 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:22:13,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:22:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106437250] [2024-11-09 05:22:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106437250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:22:13,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:22:13,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:22:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177817001] [2024-11-09 05:22:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:22:13,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:22:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:22:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:22:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:22:13,617 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:22:15,668 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:22:17,672 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:22:19,675 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:22:21,677 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:22:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:22:22,454 INFO L93 Difference]: Finished difference Result 461 states and 479 transitions. [2024-11-09 05:22:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:22:22,455 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:22:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:22:22,457 INFO L225 Difference]: With dead ends: 461 [2024-11-09 05:22:22,457 INFO L226 Difference]: Without dead ends: 461 [2024-11-09 05:22:22,457 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:22:22,458 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:22:22,458 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.8s Time] [2024-11-09 05:22:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-09 05:22:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-11-09 05:22:22,466 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:22:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 479 transitions. [2024-11-09 05:22:22,468 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 479 transitions. Word has length 54 [2024-11-09 05:22:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:22:22,468 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 479 transitions. [2024-11-09 05:22:22,468 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:22:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 479 transitions. [2024-11-09 05:22:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 05:22:22,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:22:22,470 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:22:22,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:22:22,470 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:22:22,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:22:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1582971899, now seen corresponding path program 1 times [2024-11-09 05:22:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:22:22,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839094162] [2024-11-09 05:22:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:22:22,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:22:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:22:22,870 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:22:22,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:22:22,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839094162] [2024-11-09 05:22:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839094162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:22:22,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:22:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:22:22,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087129193] [2024-11-09 05:22:22,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:22:22,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:22:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:22:22,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:22:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:22:22,878 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:22:24,933 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:22:26,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:22:28,939 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:22:30,946 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:22:32,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:22:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:22:33,934 INFO L93 Difference]: Finished difference Result 471 states and 492 transitions. [2024-11-09 05:22:33,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:22:33,935 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:22:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:22:33,938 INFO L225 Difference]: With dead ends: 471 [2024-11-09 05:22:33,939 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 05:22:33,939 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:22:33,939 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 5 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:22:33,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1316 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 848 Invalid, 5 Unknown, 0 Unchecked, 11.0s Time] [2024-11-09 05:22:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 05:22:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 466. [2024-11-09 05:22:33,948 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:22:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 488 transitions. [2024-11-09 05:22:33,950 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 488 transitions. Word has length 60 [2024-11-09 05:22:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:22:33,951 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 488 transitions. [2024-11-09 05:22:33,952 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:22:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 488 transitions. [2024-11-09 05:22:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 05:22:33,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:22:33,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:22:33,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:22:33,956 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:22:33,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:22:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1582971898, now seen corresponding path program 1 times [2024-11-09 05:22:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:22:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430019673] [2024-11-09 05:22:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:22:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:22:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:22:34,814 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:22:34,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:22:34,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430019673] [2024-11-09 05:22:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430019673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:22:34,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:22:34,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:22:34,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225346611] [2024-11-09 05:22:34,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:22:34,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:22:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:22:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:22:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:22:34,818 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:22:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:22:36,135 INFO L93 Difference]: Finished difference Result 466 states and 487 transitions. [2024-11-09 05:22:36,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:22:36,136 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:22:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:22:36,138 INFO L225 Difference]: With dead ends: 466 [2024-11-09 05:22:36,138 INFO L226 Difference]: Without dead ends: 466 [2024-11-09 05:22:36,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:22:36,139 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 1 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:22:36,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1222 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 05:22:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-09 05:22:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-11-09 05:22:36,148 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:22:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 487 transitions. [2024-11-09 05:22:36,151 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 487 transitions. Word has length 60 [2024-11-09 05:22:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:22:36,152 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 487 transitions. [2024-11-09 05:22:36,152 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:22:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 487 transitions. [2024-11-09 05:22:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 05:22:36,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:22:36,154 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:22:36,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:22:36,154 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:22:36,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:22:36,155 INFO L85 PathProgramCache]: Analyzing trace with hash -479516464, now seen corresponding path program 1 times [2024-11-09 05:22:36,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:22:36,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619359995] [2024-11-09 05:22:36,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:22:36,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:22:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:22:36,913 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:22:36,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:22:36,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619359995] [2024-11-09 05:22:36,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619359995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:22:36,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872752741] [2024-11-09 05:22:36,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:22:36,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:22:36,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:22:36,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:22:36,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:22:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:22:37,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 05:22:37,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:22:37,217 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:22:37,360 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:22:37,360 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:22:37,411 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:22:37,516 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:22:37,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:22:37,716 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:22:37,781 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:22:37,825 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:22:37,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:22:37,870 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 05:22:37,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872752741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:22:37,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1359738810] [2024-11-09 05:22:37,899 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2024-11-09 05:22:37,900 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:22:37,904 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:22:37,909 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:22:37,909 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:22:44,280 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 05:22:44,617 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:25:23,883 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:25:23,883 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:25:23,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:25:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 05:25:23,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017330733] [2024-11-09 05:25:23,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:25:23,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 05:25:23,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:25:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 05:25:23,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2238, Unknown=88, NotChecked=98, Total=2652 [2024-11-09 05:25:23,887 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:25:26,268 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:25:28,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:25:30,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:32,280 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:25:34,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:36,290 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:25:38,306 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:25:40,319 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:25:42,323 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:25:44,326 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:25:46,330 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:25:48,334 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:25:50,336 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:25:52,339 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:25:54,343 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:25:56,345 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:25:58,348 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:26:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:04,375 INFO L93 Difference]: Finished difference Result 470 states and 491 transitions. [2024-11-09 05:26:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:26:04,376 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:26:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:04,378 INFO L225 Difference]: With dead ends: 470 [2024-11-09 05:26:04,378 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 05:26:04,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 159.9s TimeCoverageRelationStatistics Valid=260, Invalid=2622, Unknown=92, NotChecked=106, Total=3080 [2024-11-09 05:26:04,381 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 356 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 15 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:04,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1715 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2554 Invalid, 17 Unknown, 0 Unchecked, 40.0s Time] [2024-11-09 05:26:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 05:26:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-11-09 05:26:04,390 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:26:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 487 transitions. [2024-11-09 05:26:04,392 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 487 transitions. Word has length 61 [2024-11-09 05:26:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:04,392 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 487 transitions. [2024-11-09 05:26:04,393 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:26:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 487 transitions. [2024-11-09 05:26:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 05:26:04,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:04,394 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:26:04,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:26:04,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 05:26:04,598 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:26:04,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash -479516463, now seen corresponding path program 1 times [2024-11-09 05:26:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186089082] [2024-11-09 05:26:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:06,055 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:26:06,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186089082] [2024-11-09 05:26:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186089082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:26:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279337711] [2024-11-09 05:26:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:06,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:26:06,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:26:06,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:26:06,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:26:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:06,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 05:26:06,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:26:06,304 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:26:06,602 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:26:06,653 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:26:06,653 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:26:06,773 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:26:06,790 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:26:07,068 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:26:07,077 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:26:07,385 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:26:07,386 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:26:07,403 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:26:07,503 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:26:07,516 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:26:07,570 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:26:07,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:26:08,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279337711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:26:08,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1985835639] [2024-11-09 05:26:08,003 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2024-11-09 05:26:08,003 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:26:08,004 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:26:08,004 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:26:08,004 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:26:12,108 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 05:26:14,843 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:28:37,206 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:28:37,206 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:28:37,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:28:37,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-09 05:28:37,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635955687] [2024-11-09 05:28:37,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:28:37,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 05:28:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:28:37,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 05:28:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2440, Unknown=80, NotChecked=0, Total=2756 [2024-11-09 05:28:37,210 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:28:39,438 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:41,445 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:43,451 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:44,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:28:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:28:52,922 INFO L93 Difference]: Finished difference Result 469 states and 490 transitions. [2024-11-09 05:28:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:28:52,923 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:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:28:52,925 INFO L225 Difference]: With dead ends: 469 [2024-11-09 05:28:52,925 INFO L226 Difference]: Without dead ends: 469 [2024-11-09 05:28:52,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 144.0s TimeCoverageRelationStatistics Valid=275, Invalid=2837, Unknown=80, NotChecked=0, Total=3192 [2024-11-09 05:28:52,927 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 352 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:28:52,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1099 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2812 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2024-11-09 05:28:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-09 05:28:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 462. [2024-11-09 05:28:52,937 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:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2024-11-09 05:28:52,939 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 61 [2024-11-09 05:28:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:28:52,940 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2024-11-09 05:28:52,940 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:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2024-11-09 05:28:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 05:28:52,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:28:52,941 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:52,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:28:53,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:28:53,146 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:53,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:28:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash -816862793, now seen corresponding path program 1 times [2024-11-09 05:28:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:28:53,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519312805] [2024-11-09 05:28:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:28:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:54,385 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:54,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:28:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519312805] [2024-11-09 05:28:54,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519312805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:28:54,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:28:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:28:54,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254216786] [2024-11-09 05:28:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:28:54,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:28:54,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:28:54,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:28:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:28:54,387 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:56,572 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:58,575 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:29:00,579 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:29:02,582 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:29:04,591 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:29:06,595 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:29:08,599 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:29:10,604 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:29:12,614 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:29:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:18,221 INFO L93 Difference]: Finished difference Result 472 states and 493 transitions. [2024-11-09 05:29:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:29:18,222 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:29:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:18,224 INFO L225 Difference]: With dead ends: 472 [2024-11-09 05:29:18,224 INFO L226 Difference]: Without dead ends: 472 [2024-11-09 05:29:18,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-09 05:29:18,225 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 379 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 12 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:29:18,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1055 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2351 Invalid, 9 Unknown, 0 Unchecked, 23.6s Time] [2024-11-09 05:29:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-09 05:29:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 469. [2024-11-09 05:29:18,237 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:29:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 489 transitions. [2024-11-09 05:29:18,238 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 489 transitions. Word has length 62 [2024-11-09 05:29:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:18,239 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 489 transitions. [2024-11-09 05:29:18,239 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:29:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 489 transitions. [2024-11-09 05:29:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 05:29:18,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:18,240 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:29:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 05:29:18,241 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:29:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -816862794, now seen corresponding path program 1 times [2024-11-09 05:29:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:29:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726705634] [2024-11-09 05:29:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:29:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:19,181 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:29:19,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:29:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726705634] [2024-11-09 05:29:19,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726705634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:29:19,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:29:19,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 05:29:19,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13024894] [2024-11-09 05:29:19,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:29:19,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:29:19,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:29:19,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:29:19,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:29:19,184 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:29:21,413 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:29:23,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:29:24,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:29:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:30,743 INFO L93 Difference]: Finished difference Result 471 states and 492 transitions. [2024-11-09 05:29:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:29:30,744 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:29:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:30,746 INFO L225 Difference]: With dead ends: 471 [2024-11-09 05:29:30,746 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 05:29:30,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 05:29:30,747 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 360 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 13 mSolverCounterUnsat, 2 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, 2607 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:29:30,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1719 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2607 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2024-11-09 05:29:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 05:29:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2024-11-09 05:29:30,757 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:29:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 488 transitions. [2024-11-09 05:29:30,759 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 488 transitions. Word has length 62 [2024-11-09 05:29:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:30,760 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 488 transitions. [2024-11-09 05:29:30,760 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:29:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 488 transitions. [2024-11-09 05:29:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 05:29:30,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:30,761 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:29:30,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:29:30,761 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:29:30,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1253111870, now seen corresponding path program 1 times [2024-11-09 05:29:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:29:30,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957597228] [2024-11-09 05:29:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:29:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:32,224 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:29:32,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:29:32,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957597228] [2024-11-09 05:29:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957597228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:29:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996112386] [2024-11-09 05:29:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:32,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:29:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:29:32,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:29:32,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:29:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:32,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 05:29:32,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:32,486 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:29:32,822 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:29:32,822 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:29:32,834 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:29:32,895 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:29:32,913 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:29:33,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:29:33,159 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:29:33,167 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:29:33,320 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:29:33,320 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:29:33,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-09 05:29:33,430 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:29:33,446 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:29:33,516 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:29:33,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:29:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996112386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:29:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [897051979] [2024-11-09 05:29:34,294 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-09 05:29:34,295 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:29:34,295 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:29:34,295 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:29:34,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:29:39,990 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-09 05:29:40,410 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:29:47,714 WARN L286 SmtUtils]: Spent 5.99s 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:57,097 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:57,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:32:57,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:32:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-11-09 05:32:57,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299035070] [2024-11-09 05:32:57,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:32:57,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 05:32:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:32:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 05:32:57,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2916, Unknown=122, NotChecked=0, Total=3306 [2024-11-09 05:32:57,099 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:59,421 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:33:01,424 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:33:03,428 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:33:05,435 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:33:07,439 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:33:09,442 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:33:11,446 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:33:13,450 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:33:15,454 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:33:17,458 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:33:19,461 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:33:21,465 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:33:23,468 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:33:25,470 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:33:27,473 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:33:29,476 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:33:31,479 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:33:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:33:40,910 INFO L93 Difference]: Finished difference Result 470 states and 491 transitions. [2024-11-09 05:33:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:33:40,911 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:33:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:33:40,913 INFO L225 Difference]: With dead ends: 470 [2024-11-09 05:33:40,913 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 05:33:40,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 198.7s TimeCoverageRelationStatistics Valid=326, Invalid=3458, Unknown=122, NotChecked=0, Total=3906 [2024-11-09 05:33:40,914 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 355 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 3597 mSolverCounterSat, 16 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 3630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3597 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:33:40,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1928 Invalid, 3630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3597 Invalid, 17 Unknown, 0 Unchecked, 43.0s Time] [2024-11-09 05:33:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 05:33:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-11-09 05:33:40,924 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:33:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 487 transitions. [2024-11-09 05:33:40,926 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 487 transitions. Word has length 63 [2024-11-09 05:33:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:33:40,927 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 487 transitions. [2024-11-09 05:33:40,927 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:33:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 487 transitions. [2024-11-09 05:33:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 05:33:40,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:33:40,928 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:33:40,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 05:33:41,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 05:33:41,129 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:33:41,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:33:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1253111871, now seen corresponding path program 1 times [2024-11-09 05:33:41,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:33:41,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918213099] [2024-11-09 05:33:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:41,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:33:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:42,298 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:33:42,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:33:42,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918213099] [2024-11-09 05:33:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918213099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852114629] [2024-11-09 05:33:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:42,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:33:42,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:33:42,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:33:42,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7427fdc3-8a16-4c56-8772-37c3c2b95e9e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:33:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:42,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 05:33:42,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:33:42,563 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:33:42,955 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:33:42,955 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:33:43,065 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:33:43,300 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:33:43,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:43,631 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:33:43,869 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:43,869 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:33:43,889 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:33:43,992 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:33:43,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:33:44,292 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:33:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852114629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:44,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2049933491] [2024-11-09 05:33:44,298 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-09 05:33:44,299 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:33:44,299 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:33:44,299 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:33:44,299 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:33:50,092 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 05:33:50,620 INFO L180 IcfgInterpreter]: Interpretation finished