./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E --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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:25:47,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:25:47,732 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:25:47,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:25:47,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:25:47,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:25:47,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:25:47,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:25:47,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:25:47,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:25:47,774 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:25:47,776 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:25:47,776 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:25:47,777 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:25:47,778 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:25:47,778 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:25:47,778 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:25:47,778 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:25:47,778 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:25:47,779 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:25:47,779 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:25:47,779 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:25:47,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:25:47,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:25:47,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:25:47,781 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:25:47,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:25:47,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:25:47,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:25:47,781 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:25:47,781 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:25:47,782 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:25:47,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:25:47,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:25:47,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:25:47,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:25:47,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:25:47,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:25:47,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:25:47,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:25:47,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:25:47,784 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E 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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2024-11-14 03:25:48,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:25:48,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:25:48,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:25:48,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:25:48,150 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:25:48,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i Unable to find full path for "g++" [2024-11-14 03:25:50,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:25:50,595 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:25:50,596 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2024-11-14 03:25:50,610 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/data/03b2ad53c/f6ffde45e0684a7eb93eb326d64dc417/FLAGdfcb1b00b [2024-11-14 03:25:50,625 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/data/03b2ad53c/f6ffde45e0684a7eb93eb326d64dc417 [2024-11-14 03:25:50,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:25:50,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:25:50,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:25:50,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:25:50,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:25:50,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:25:50" (1/1) ... [2024-11-14 03:25:50,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1847f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:50, skipping insertion in model container [2024-11-14 03:25:50,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:25:50" (1/1) ... [2024-11-14 03:25:50,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:25:51,140 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-14 03:25:51,171 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-14 03:25:51,174 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-14 03:25:51,179 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-14 03:25:51,186 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-14 03:25:51,228 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:25:51,230 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-14 03:25:51,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-14 03:25:51,239 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-14 03:25:51,250 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-14 03:25:51,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:25:51,268 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:25:51,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:25:51,434 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:25:51,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51 WrapperNode [2024-11-14 03:25:51,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:25:51,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:25:51,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:25:51,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:25:51,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,566 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1569 [2024-11-14 03:25:51,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:25:51,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:25:51,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:25:51,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:25:51,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:25:51,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:25:51,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:25:51,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:25:51,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (1/1) ... [2024-11-14 03:25:51,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:25:51,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:25:51,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:25:51,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:25:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:25:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 03:25:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 03:25:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:25:51,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 03:25:51,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 03:25:51,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:25:51,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:25:51,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:25:51,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:25:51,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:25:51,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:25:51,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:25:51,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:25:52,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:25:52,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:25:52,070 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 03:25:55,383 INFO L? ?]: Removed 1499 outVars from TransFormulas that were not future-live. [2024-11-14 03:25:55,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:25:57,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:25:57,533 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-14 03:25:57,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:25:57 BoogieIcfgContainer [2024-11-14 03:25:57,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:25:57,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:25:57,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:25:57,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:25:57,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:25:50" (1/3) ... [2024-11-14 03:25:57,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74081bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:25:57, skipping insertion in model container [2024-11-14 03:25:57,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:25:51" (2/3) ... [2024-11-14 03:25:57,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74081bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:25:57, skipping insertion in model container [2024-11-14 03:25:57,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:25:57" (3/3) ... [2024-11-14 03:25:57,547 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-1.i [2024-11-14 03:25:57,567 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:25:57,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test4-1.i that has 3 procedures, 1122 locations, 1 initial locations, 35 loop locations, and 628 error locations. [2024-11-14 03:25:57,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:25:57,641 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;@11079824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:25:57,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-14 03:25:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 1122 states, 481 states have (on average 2.544698544698545) internal successors, (1224), 1113 states have internal predecessors, (1224), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:25:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:25:57,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:25:57,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:25:57,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:25:57,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:25:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2753075, now seen corresponding path program 1 times [2024-11-14 03:25:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:25:57,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131080210] [2024-11-14 03:25:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:25:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:25:57,925 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-14 03:25:57,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:25:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131080210] [2024-11-14 03:25:57,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131080210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:25:57,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:25:57,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:25:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377504472] [2024-11-14 03:25:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:25:57,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:25:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:25:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:25:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:25:57,994 INFO L87 Difference]: Start difference. First operand has 1122 states, 481 states have (on average 2.544698544698545) internal successors, (1224), 1113 states have internal predecessors, (1224), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:26:00,204 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-14 03:26:02,284 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-14 03:26:04,645 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-14 03:26:06,672 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-14 03:26:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:07,453 INFO L93 Difference]: Finished difference Result 1010 states and 1083 transitions. [2024-11-14 03:26:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:26:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:26:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:07,479 INFO L225 Difference]: With dead ends: 1010 [2024-11-14 03:26:07,481 INFO L226 Difference]: Without dead ends: 1009 [2024-11-14 03:26:07,482 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-14 03:26:07,487 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 921 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 102 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:07,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 464 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 750 Invalid, 4 Unknown, 0 Unchecked, 9.4s Time] [2024-11-14 03:26:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-14 03:26:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1008. [2024-11-14 03:26:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 472 states have (on average 2.2203389830508473) internal successors, (1048), 999 states have internal predecessors, (1048), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:26:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1080 transitions. [2024-11-14 03:26:07,573 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1080 transitions. Word has length 3 [2024-11-14 03:26:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:07,573 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1080 transitions. [2024-11-14 03:26:07,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:26:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1080 transitions. [2024-11-14 03:26:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:26:07,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:07,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:26:07,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:26:07,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:26:07,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2753076, now seen corresponding path program 1 times [2024-11-14 03:26:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:26:07,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917434922] [2024-11-14 03:26:07,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:07,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:26:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:07,727 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-14 03:26:07,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:26:07,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917434922] [2024-11-14 03:26:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917434922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:07,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:26:07,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:26:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493746194] [2024-11-14 03:26:07,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:07,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:26:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:26:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:26:07,730 INFO L87 Difference]: Start difference. First operand 1008 states and 1080 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:26:10,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:26:12,515 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-14 03:26:15,847 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-14 03:26:17,851 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-14 03:26:19,884 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-14 03:26:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:20,023 INFO L93 Difference]: Finished difference Result 1286 states and 1378 transitions. [2024-11-14 03:26:20,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:26:20,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:26:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:20,030 INFO L225 Difference]: With dead ends: 1286 [2024-11-14 03:26:20,031 INFO L226 Difference]: Without dead ends: 1286 [2024-11-14 03:26:20,031 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-14 03:26:20,034 INFO L432 NwaCegarLoop]: 759 mSDtfsCounter, 461 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 25 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:20,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1132 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 849 Invalid, 4 Unknown, 0 Unchecked, 12.2s Time] [2024-11-14 03:26:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2024-11-14 03:26:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1136. [2024-11-14 03:26:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 610 states have (on average 2.178688524590164) internal successors, (1329), 1127 states have internal predecessors, (1329), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:26:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1361 transitions. [2024-11-14 03:26:20,103 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1361 transitions. Word has length 3 [2024-11-14 03:26:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:20,103 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1361 transitions. [2024-11-14 03:26:20,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:26:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1361 transitions. [2024-11-14 03:26:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:26:20,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:20,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:26:20,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:26:20,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:26:20,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash 85187220, now seen corresponding path program 1 times [2024-11-14 03:26:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:26:20,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649294277] [2024-11-14 03:26:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:26:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:20,138 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-14 03:26:20,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:26:20,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649294277] [2024-11-14 03:26:20,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649294277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:20,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:26:20,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:26:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490187102] [2024-11-14 03:26:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:20,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:26:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:26:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:26:20,141 INFO L87 Difference]: Start difference. First operand 1136 states and 1361 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-14 03:26:22,180 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-14 03:26:24,196 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-14 03:26:26,281 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-14 03:26:28,301 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-14 03:26:30,389 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-14 03:26:32,393 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-14 03:26:34,410 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-14 03:26:36,412 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-14 03:26:37,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:26:39,931 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-14 03:26:41,934 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-14 03:26:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:42,249 INFO L93 Difference]: Finished difference Result 2230 states and 2660 transitions. [2024-11-14 03:26:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:26:42,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-14 03:26:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:42,260 INFO L225 Difference]: With dead ends: 2230 [2024-11-14 03:26:42,260 INFO L226 Difference]: Without dead ends: 2230 [2024-11-14 03:26:42,260 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-14 03:26:42,264 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 995 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:42,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 2250 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 10 Unknown, 0 Unchecked, 22.0s Time] [2024-11-14 03:26:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2024-11-14 03:26:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1137. [2024-11-14 03:26:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 611 states have (on average 2.176759410801964) internal successors, (1330), 1128 states have internal predecessors, (1330), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:26:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1362 transitions. [2024-11-14 03:26:42,324 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1362 transitions. Word has length 4 [2024-11-14 03:26:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:42,324 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1362 transitions. [2024-11-14 03:26:42,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-14 03:26:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1362 transitions. [2024-11-14 03:26:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:26:42,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:42,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:26:42,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:26:42,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:26:42,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:42,326 INFO L85 PathProgramCache]: Analyzing trace with hash 227816381, now seen corresponding path program 1 times [2024-11-14 03:26:42,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:26:42,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231127582] [2024-11-14 03:26:42,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:42,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:26:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:42,443 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-14 03:26:42,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:26:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231127582] [2024-11-14 03:26:42,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231127582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:42,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:26:42,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:26:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664944156] [2024-11-14 03:26:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:26:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:26:42,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:26:42,445 INFO L87 Difference]: Start difference. First operand 1137 states and 1362 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:26:43,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:26:45,655 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-14 03:26:48,767 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-14 03:26:50,770 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-14 03:26:52,800 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-14 03:26:54,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:26:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:55,701 INFO L93 Difference]: Finished difference Result 1118 states and 1343 transitions. [2024-11-14 03:26:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:26:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:26:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:55,706 INFO L225 Difference]: With dead ends: 1118 [2024-11-14 03:26:55,706 INFO L226 Difference]: Without dead ends: 1118 [2024-11-14 03:26:55,706 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-14 03:26:55,707 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 958 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 33 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:55,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 799 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1356 Invalid, 5 Unknown, 0 Unchecked, 13.2s Time] [2024-11-14 03:26:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2024-11-14 03:26:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1114. [2024-11-14 03:26:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 611 states have (on average 2.1391162029459903) internal successors, (1307), 1105 states have internal predecessors, (1307), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:26:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1339 transitions. [2024-11-14 03:26:55,736 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1339 transitions. Word has length 9 [2024-11-14 03:26:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:55,736 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1339 transitions. [2024-11-14 03:26:55,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:26:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1339 transitions. [2024-11-14 03:26:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:26:55,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:55,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:26:55,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:26:55,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:26:55,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash 227816382, now seen corresponding path program 1 times [2024-11-14 03:26:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:26:55,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841282284] [2024-11-14 03:26:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:26:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:55,907 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-14 03:26:55,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:26:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841282284] [2024-11-14 03:26:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841282284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:55,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:26:55,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:26:55,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236697759] [2024-11-14 03:26:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:55,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:26:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:26:55,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:26:55,912 INFO L87 Difference]: Start difference. First operand 1114 states and 1339 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:26:57,968 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-14 03:26:59,971 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-14 03:27:02,695 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-14 03:27:04,698 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-14 03:27:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:04,914 INFO L93 Difference]: Finished difference Result 1087 states and 1311 transitions. [2024-11-14 03:27:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:27:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:27:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:04,924 INFO L225 Difference]: With dead ends: 1087 [2024-11-14 03:27:04,924 INFO L226 Difference]: Without dead ends: 1087 [2024-11-14 03:27:04,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 03:27:04,926 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 50 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:04,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1724 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 9.0s Time] [2024-11-14 03:27:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-11-14 03:27:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2024-11-14 03:27:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 596 states have (on average 2.1459731543624163) internal successors, (1279), 1078 states have internal predecessors, (1279), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:27:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1311 transitions. [2024-11-14 03:27:04,954 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1311 transitions. Word has length 9 [2024-11-14 03:27:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:04,954 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1311 transitions. [2024-11-14 03:27:04,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:27:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1311 transitions. [2024-11-14 03:27:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:27:04,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:04,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:04,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:27:04,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:27:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1524858797, now seen corresponding path program 1 times [2024-11-14 03:27:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020755920] [2024-11-14 03:27:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:05,076 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-14 03:27:05,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:05,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020755920] [2024-11-14 03:27:05,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020755920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:05,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:05,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:27:05,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275621053] [2024-11-14 03:27:05,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:05,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:27:05,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:27:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:27:05,078 INFO L87 Difference]: Start difference. First operand 1087 states and 1311 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-14 03:27:07,152 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-14 03:27:09,154 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-14 03:27:11,157 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-14 03:27:13,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:13,880 INFO L93 Difference]: Finished difference Result 1076 states and 1293 transitions. [2024-11-14 03:27:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:27:13,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-14 03:27:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:13,887 INFO L225 Difference]: With dead ends: 1076 [2024-11-14 03:27:13,887 INFO L226 Difference]: Without dead ends: 1076 [2024-11-14 03:27:13,888 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-14 03:27:13,889 INFO L432 NwaCegarLoop]: 857 mSDtfsCounter, 38 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:13,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2551 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 393 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2024-11-14 03:27:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-11-14 03:27:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1073. [2024-11-14 03:27:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 589 states have (on average 2.135823429541596) internal successors, (1258), 1064 states have internal predecessors, (1258), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:27:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1290 transitions. [2024-11-14 03:27:13,915 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1290 transitions. Word has length 10 [2024-11-14 03:27:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:13,916 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1290 transitions. [2024-11-14 03:27:13,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-14 03:27:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1290 transitions. [2024-11-14 03:27:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:27:13,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:13,917 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] [2024-11-14 03:27:13,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:27:13,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:27:13,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash -149950879, now seen corresponding path program 1 times [2024-11-14 03:27:13,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:13,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000339580] [2024-11-14 03:27:13,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:13,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:14,208 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-14 03:27:14,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000339580] [2024-11-14 03:27:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000339580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:14,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:27:14,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494998112] [2024-11-14 03:27:14,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:14,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:27:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:27:14,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:27:14,209 INFO L87 Difference]: Start difference. First operand 1073 states and 1290 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-14 03:27:16,259 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-14 03:27:18,265 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-14 03:27:20,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:21,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:24,007 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-14 03:27:27,658 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-14 03:27:29,681 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-14 03:27:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:29,835 INFO L93 Difference]: Finished difference Result 1223 states and 1307 transitions. [2024-11-14 03:27:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:27:29,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-11-14 03:27:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:29,846 INFO L225 Difference]: With dead ends: 1223 [2024-11-14 03:27:29,846 INFO L226 Difference]: Without dead ends: 1223 [2024-11-14 03:27:29,846 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-14 03:27:29,848 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 401 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:29,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1497 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1369 Invalid, 6 Unknown, 0 Unchecked, 15.6s Time] [2024-11-14 03:27:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-14 03:27:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1069. [2024-11-14 03:27:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 589 states have (on average 2.129032258064516) internal successors, (1254), 1060 states have internal predecessors, (1254), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:27:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1286 transitions. [2024-11-14 03:27:29,875 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1286 transitions. Word has length 24 [2024-11-14 03:27:29,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:29,876 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1286 transitions. [2024-11-14 03:27:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-14 03:27:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1286 transitions. [2024-11-14 03:27:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:27:29,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:29,878 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] [2024-11-14 03:27:29,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:27:29,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:27:29,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1369994479, now seen corresponding path program 1 times [2024-11-14 03:27:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766931533] [2024-11-14 03:27:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:30,143 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-14 03:27:30,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:30,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766931533] [2024-11-14 03:27:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766931533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:27:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348333248] [2024-11-14 03:27:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:30,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:27:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:30,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:27:30,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:27:30,144 INFO L87 Difference]: Start difference. First operand 1069 states and 1286 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-14 03:27:31,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:34,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:36,053 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-14 03:27:38,056 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-14 03:27:40,076 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-14 03:27:42,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:27:44,083 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-14 03:27:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:44,305 INFO L93 Difference]: Finished difference Result 1069 states and 1282 transitions. [2024-11-14 03:27:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:27:44,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-11-14 03:27:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:44,315 INFO L225 Difference]: With dead ends: 1069 [2024-11-14 03:27:44,315 INFO L226 Difference]: Without dead ends: 1069 [2024-11-14 03:27:44,315 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-14 03:27:44,316 INFO L432 NwaCegarLoop]: 852 mSDtfsCounter, 15 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:44,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2539 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 391 Invalid, 6 Unknown, 0 Unchecked, 14.1s Time] [2024-11-14 03:27:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-11-14 03:27:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2024-11-14 03:27:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 589 states have (on average 2.122241086587436) internal successors, (1250), 1060 states have internal predecessors, (1250), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:27:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1282 transitions. [2024-11-14 03:27:44,342 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1282 transitions. Word has length 40 [2024-11-14 03:27:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:44,342 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1282 transitions. [2024-11-14 03:27:44,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-14 03:27:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1282 transitions. [2024-11-14 03:27:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 03:27:44,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:44,344 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] [2024-11-14 03:27:44,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:27:44,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:27:44,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:44,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1357392015, now seen corresponding path program 1 times [2024-11-14 03:27:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:44,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222733543] [2024-11-14 03:27:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:44,541 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-14 03:27:44,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:44,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222733543] [2024-11-14 03:27:44,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222733543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:44,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:27:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793280499] [2024-11-14 03:27:44,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:44,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:27:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:44,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:27:44,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:27:44,545 INFO L87 Difference]: Start difference. First operand 1069 states and 1282 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-14 03:27:46,564 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-14 03:27:48,640 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-14 03:27:50,643 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-14 03:27:52,659 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-14 03:27:54,662 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-14 03:27:56,715 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-14 03:27:58,719 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-14 03:27:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:58,854 INFO L93 Difference]: Finished difference Result 1110 states and 1323 transitions. [2024-11-14 03:27:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:27:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2024-11-14 03:27:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:58,859 INFO L225 Difference]: With dead ends: 1110 [2024-11-14 03:27:58,859 INFO L226 Difference]: Without dead ends: 1110 [2024-11-14 03:27:58,859 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-14 03:27:58,860 INFO L432 NwaCegarLoop]: 865 mSDtfsCounter, 0 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:58,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1704 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 7 Unknown, 0 Unchecked, 14.3s Time] [2024-11-14 03:27:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-11-14 03:27:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2024-11-14 03:27:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 630 states have (on average 2.049206349206349) internal successors, (1291), 1101 states have internal predecessors, (1291), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:27:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1323 transitions. [2024-11-14 03:27:58,882 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1323 transitions. Word has length 44 [2024-11-14 03:27:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:58,882 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1323 transitions. [2024-11-14 03:27:58,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-14 03:27:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1323 transitions. [2024-11-14 03:27:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-14 03:27:58,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:58,884 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-14 03:27:58,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:27:58,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:27:58,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1055591035, now seen corresponding path program 1 times [2024-11-14 03:27:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:58,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028617122] [2024-11-14 03:27:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:59,535 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-14 03:27:59,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028617122] [2024-11-14 03:27:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028617122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:59,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:59,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:27:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710867683] [2024-11-14 03:27:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:59,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:27:59,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:27:59,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:27:59,538 INFO L87 Difference]: Start difference. First operand 1110 states and 1323 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 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-14 03:28:00,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:02,753 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-14 03:28:04,757 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-14 03:28:07,187 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-14 03:28:09,198 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-14 03:28:11,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:13,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:28:14,443 INFO L93 Difference]: Finished difference Result 1026 states and 1239 transitions. [2024-11-14 03:28:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:28:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 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-14 03:28:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:28:14,447 INFO L225 Difference]: With dead ends: 1026 [2024-11-14 03:28:14,447 INFO L226 Difference]: Without dead ends: 1026 [2024-11-14 03:28:14,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:28:14,447 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 798 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 93 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:28:14,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 707 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2099 Invalid, 5 Unknown, 0 Unchecked, 14.9s Time] [2024-11-14 03:28:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-14 03:28:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 888. [2024-11-14 03:28:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 492 states have (on average 1.8617886178861789) internal successors, (916), 879 states have internal predecessors, (916), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:28:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 948 transitions. [2024-11-14 03:28:14,464 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 948 transitions. Word has length 47 [2024-11-14 03:28:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:28:14,465 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 948 transitions. [2024-11-14 03:28:14,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 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-14 03:28:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 948 transitions. [2024-11-14 03:28:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 03:28:14,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:28:14,466 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] [2024-11-14 03:28:14,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:28:14,466 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:28:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:28:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash 207247625, now seen corresponding path program 1 times [2024-11-14 03:28:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:28:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581987220] [2024-11-14 03:28:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:28:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:14,879 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-14 03:28:14,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:28:14,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581987220] [2024-11-14 03:28:14,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581987220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:14,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:28:14,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:28:14,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984831789] [2024-11-14 03:28:14,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:14,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:28:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:28:14,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:28:14,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:28:14,883 INFO L87 Difference]: Start difference. First operand 888 states and 948 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 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-14 03:28:16,923 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-14 03:28:18,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:20,930 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-14 03:28:23,623 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-14 03:28:25,627 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-14 03:28:27,629 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-14 03:28:29,631 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-14 03:28:31,660 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-14 03:28:33,663 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-14 03:28:35,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:28:36,585 INFO L93 Difference]: Finished difference Result 887 states and 947 transitions. [2024-11-14 03:28:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:28:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 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 51 [2024-11-14 03:28:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:28:36,588 INFO L225 Difference]: With dead ends: 887 [2024-11-14 03:28:36,588 INFO L226 Difference]: Without dead ends: 887 [2024-11-14 03:28:36,588 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-14 03:28:36,589 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 2 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:28:36,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2009 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1594 Invalid, 9 Unknown, 0 Unchecked, 21.7s Time] [2024-11-14 03:28:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-14 03:28:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2024-11-14 03:28:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 492 states have (on average 1.8597560975609757) internal successors, (915), 878 states have internal predecessors, (915), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:28:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 947 transitions. [2024-11-14 03:28:36,604 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 947 transitions. Word has length 51 [2024-11-14 03:28:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:28:36,604 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 947 transitions. [2024-11-14 03:28:36,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 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-14 03:28:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 947 transitions. [2024-11-14 03:28:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 03:28:36,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:28:36,606 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] [2024-11-14 03:28:36,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:28:36,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:28:36,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:28:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash 207247626, now seen corresponding path program 1 times [2024-11-14 03:28:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:28:36,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318646318] [2024-11-14 03:28:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:28:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:37,227 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-14 03:28:37,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:28:37,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318646318] [2024-11-14 03:28:37,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318646318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:37,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:28:37,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:28:37,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646806978] [2024-11-14 03:28:37,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:37,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:28:37,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:28:37,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:28:37,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:28:37,230 INFO L87 Difference]: Start difference. First operand 887 states and 947 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 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-14 03:28:39,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 03:28:41,278 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-14 03:28:43,285 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-14 03:28:46,167 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-14 03:28:48,886 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-14 03:28:50,892 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-14 03:28:52,896 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-14 03:28:54,900 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-14 03:28:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:28:55,736 INFO L93 Difference]: Finished difference Result 886 states and 946 transitions. [2024-11-14 03:28:55,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:28:55,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 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 51 [2024-11-14 03:28:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:28:55,739 INFO L225 Difference]: With dead ends: 886 [2024-11-14 03:28:55,739 INFO L226 Difference]: Without dead ends: 886 [2024-11-14 03:28:55,740 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-14 03:28:55,740 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:28:55,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2024 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1577 Invalid, 8 Unknown, 0 Unchecked, 18.5s Time] [2024-11-14 03:28:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-14 03:28:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-14 03:28:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 491 states have (on average 1.8615071283095723) internal successors, (914), 877 states have internal predecessors, (914), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:28:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 946 transitions. [2024-11-14 03:28:55,755 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 946 transitions. Word has length 51 [2024-11-14 03:28:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:28:55,756 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 946 transitions. [2024-11-14 03:28:55,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 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-14 03:28:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 946 transitions. [2024-11-14 03:28:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 03:28:55,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:28:55,757 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] [2024-11-14 03:28:55,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:28:55,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:28:55,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:28:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash 513870895, now seen corresponding path program 1 times [2024-11-14 03:28:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:28:55,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925101436] [2024-11-14 03:28:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:28:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:28:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:28:56,091 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-14 03:28:56,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:28:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925101436] [2024-11-14 03:28:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925101436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:28:56,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:28:56,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:28:56,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401913950] [2024-11-14 03:28:56,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:28:56,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:28:56,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:28:56,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:28:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:28:56,095 INFO L87 Difference]: Start difference. First operand 886 states and 946 transitions. Second operand has 7 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-14 03:28:58,707 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-14 03:29:00,710 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-14 03:29:02,712 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-14 03:29:05,890 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-14 03:29:07,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:29:09,229 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-14 03:29:11,231 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-14 03:29:13,234 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-14 03:29:15,239 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-14 03:29:17,241 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-14 03:29:19,245 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-14 03:29:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:29:20,198 INFO L93 Difference]: Finished difference Result 896 states and 962 transitions. [2024-11-14 03:29:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:29:20,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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 57 [2024-11-14 03:29:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:29:20,201 INFO L225 Difference]: With dead ends: 896 [2024-11-14 03:29:20,201 INFO L226 Difference]: Without dead ends: 896 [2024-11-14 03:29:20,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:29:20,204 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 11 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 17 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:29:20,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2759 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1751 Invalid, 10 Unknown, 0 Unchecked, 24.0s Time] [2024-11-14 03:29:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-14 03:29:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 891. [2024-11-14 03:29:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 495 states have (on average 1.8585858585858586) internal successors, (920), 881 states have internal predecessors, (920), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-14 03:29:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 958 transitions. [2024-11-14 03:29:20,222 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 958 transitions. Word has length 57 [2024-11-14 03:29:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:29:20,222 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 958 transitions. [2024-11-14 03:29:20,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-14 03:29:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 958 transitions. [2024-11-14 03:29:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 03:29:20,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:29:20,225 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] [2024-11-14 03:29:20,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:29:20,225 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:29:20,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:29:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 513870896, now seen corresponding path program 1 times [2024-11-14 03:29:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:29:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431693731] [2024-11-14 03:29:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:29:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:20,836 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-14 03:29:20,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:29:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431693731] [2024-11-14 03:29:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431693731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:29:20,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:29:20,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:29:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939924749] [2024-11-14 03:29:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:29:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:29:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:29:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:29:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:29:20,838 INFO L87 Difference]: Start difference. First operand 891 states and 958 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-14 03:29:22,886 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-14 03:29:24,888 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-14 03:29:26,894 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-14 03:29:29,869 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-14 03:29:31,872 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-14 03:29:33,877 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-14 03:29:35,879 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-14 03:29:37,882 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-14 03:29:39,915 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-14 03:29:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:29:41,629 INFO L93 Difference]: Finished difference Result 891 states and 957 transitions. [2024-11-14 03:29:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:29:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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 57 [2024-11-14 03:29:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:29:41,631 INFO L225 Difference]: With dead ends: 891 [2024-11-14 03:29:41,631 INFO L226 Difference]: Without dead ends: 891 [2024-11-14 03:29:41,632 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-14 03:29:41,632 INFO L432 NwaCegarLoop]: 769 mSDtfsCounter, 7 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 15 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2571 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:29:41,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2571 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1912 Invalid, 9 Unknown, 0 Unchecked, 20.7s Time] [2024-11-14 03:29:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-14 03:29:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2024-11-14 03:29:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 495 states have (on average 1.8565656565656565) internal successors, (919), 881 states have internal predecessors, (919), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-14 03:29:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 957 transitions. [2024-11-14 03:29:41,653 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 957 transitions. Word has length 57 [2024-11-14 03:29:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:29:41,654 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 957 transitions. [2024-11-14 03:29:41,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-14 03:29:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 957 transitions. [2024-11-14 03:29:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 03:29:41,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:29:41,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, 1, 1, 1, 1, 1, 1, 1, 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-14 03:29:41,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:29:41,655 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:29:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:29:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1654312394, now seen corresponding path program 1 times [2024-11-14 03:29:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:29:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353846600] [2024-11-14 03:29:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:29:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:42,260 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-14 03:29:42,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:29:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353846600] [2024-11-14 03:29:42,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353846600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315742768] [2024-11-14 03:29:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:29:42,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:29:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:29:42,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:29:42,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:29:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:29:42,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:29:42,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:29:42,682 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:29:42,683 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-14 03:29:42,734 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-14 03:29:42,837 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-14 03:29:43,010 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:29:43,011 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-14 03:29:43,057 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-14 03:29:43,095 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-14 03:29:43,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:29:43,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-14 03:29:43,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315742768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:29:43,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1317537889] [2024-11-14 03:29:43,159 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2024-11-14 03:29:43,159 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:29:43,163 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:29:43,167 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:29:43,168 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:29:49,474 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-14 03:29:49,800 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:32:20,221 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '31447#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#t~mem52#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (= |ULTIMATE.start_main_~altusers~0#1.base| 0) (= |ULTIMATE.start_main_~altusers~0#1.offset| 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr309_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr309_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr309_18|))) (exists ((|v_#memory_int_625| (Array Int (Array Int Int))) (|v_#memory_int_624| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_620| (Array Int (Array Int Int))) (|v_#memory_int_622| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_620| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_620| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_622|) (= (store |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_3|) (= (store |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_624|) (= (store |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_625|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_533| (Array Int (Array Int Int))) (|v_#length_896| (Array Int Int)) (|v_#memory_$Pointer$.base_531| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_530| (Array Int (Array Int Int))) (|v_#valid_914| (Array Int Int))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_530| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_530| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_531|) (= (select |v_#valid_914| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (<= 40 (select |v_#length_896| |ULTIMATE.start_main_~user~0#1.base|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_914| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_533|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#length_896| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (= (store |v_#valid_914| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_526| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_527| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_529| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_529| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_529|) (= (store |v_#memory_$Pointer$.offset_526| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_526| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_527|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr309_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr309_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr309_18|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_533| (Array Int (Array Int Int))) (|v_#length_896| (Array Int Int)) (|v_#memory_$Pointer$.base_531| (Array Int (Array Int Int))) (|v_#valid_914| (Array Int Int)) (|v_#memory_$Pointer$.base_530| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_533| |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)))) (= |#valid| (store |v_#valid_914| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1)) (= (store |v_#memory_$Pointer$.base_530| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_530| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_531|) (= (select |v_#valid_914| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |#length| (store |v_#length_896| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_896| |ULTIMATE.start_main_~user~0#1.base|)) (= (select |v_#valid_914| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_533|))) (exists ((|v_#memory_$Pointer$.offset_526| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_527| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_529| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_529| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_529|) (= (store |v_#memory_$Pointer$.offset_526| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_526| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_527|))) (exists ((|v_#memory_int_625| (Array Int (Array Int Int))) (|v_#memory_int_624| (Array Int (Array Int Int))) (|v_#memory_int_620| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_622| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_620| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_620| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_622|) (= (store |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_624|) (= (store |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_625|) (= |v_old(#memory_int)_AFTER_CALL_2| (store |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_625| |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)))))))) (= ~count_int_int~0 0))' at error location [2024-11-14 03:32:20,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:32:20,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:32:20,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-14 03:32:20,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835419004] [2024-11-14 03:32:20,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:32:20,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:32:20,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:32:20,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:32:20,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2128, Unknown=83, NotChecked=96, Total=2550 [2024-11-14 03:32:20,224 INFO L87 Difference]: Start difference. First operand 891 states and 957 transitions. Second operand has 19 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 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-14 03:32:22,480 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-14 03:32:24,485 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-14 03:32:26,488 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-14 03:32:28,492 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-14 03:32:30,494 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-14 03:32:32,499 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-14 03:32:34,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:32:36,505 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-14 03:32:37,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:32:43,187 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-14 03:32:45,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:32:47,193 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-14 03:32:49,197 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-14 03:32:51,200 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-14 03:32:53,209 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-14 03:32:55,214 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-14 03:32:57,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:32:59,222 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-14 03:33:01,226 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-14 03:33:03,231 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-14 03:33:05,234 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-14 03:33:07,236 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-14 03:33:09,239 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-14 03:33:11,242 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-14 03:33:13,247 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-14 03:33:15,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:33:17,492 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-14 03:33:19,500 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-14 03:33:21,505 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-14 03:33:23,509 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-14 03:33:25,512 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-14 03:33:27,515 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-14 03:33:29,531 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-14 03:33:31,535 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-14 03:33:33,537 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-14 03:33:35,539 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-14 03:33:37,542 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-14 03:33:39,544 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-14 03:33:41,548 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-14 03:33:43,553 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-14 03:33:45,557 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-14 03:33:47,560 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-14 03:33:49,567 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-14 03:33:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:57,800 INFO L93 Difference]: Finished difference Result 895 states and 961 transitions. [2024-11-14 03:33:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:33:57,801 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 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 58 [2024-11-14 03:33:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:57,803 INFO L225 Difference]: With dead ends: 895 [2024-11-14 03:33:57,803 INFO L226 Difference]: Without dead ends: 895 [2024-11-14 03:33:57,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 151.0s TimeCoverageRelationStatistics Valid=275, Invalid=2508, Unknown=83, NotChecked=104, Total=2970 [2024-11-14 03:33:57,805 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 830 mSDsluCounter, 3328 mSDsCounter, 0 mSdLazyCounter, 5278 mSolverCounterSat, 32 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 5352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5278 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:57,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 3731 Invalid, 5352 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 5278 Invalid, 42 Unknown, 0 Unchecked, 97.1s Time] [2024-11-14 03:33:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-14 03:33:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 893. [2024-11-14 03:33:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 497 states have (on average 1.8531187122736419) internal successors, (921), 882 states have internal predecessors, (921), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-14 03:33:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 954 transitions. [2024-11-14 03:33:57,822 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 954 transitions. Word has length 58 [2024-11-14 03:33:57,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:57,823 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 954 transitions. [2024-11-14 03:33:57,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 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-14 03:33:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 954 transitions. [2024-11-14 03:33:57,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 03:33:57,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:57,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:33:57,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:33:58,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:33:58,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:33:58,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1654312395, now seen corresponding path program 1 times [2024-11-14 03:33:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:33:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768978509] [2024-11-14 03:33:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:33:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:59,241 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-14 03:33:59,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:33:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768978509] [2024-11-14 03:33:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768978509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:33:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268766200] [2024-11-14 03:33:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:59,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:33:59,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:33:59,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:33:59,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:33:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:59,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:33:59,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:33:59,816 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:33:59,817 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-14 03:33:59,835 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-14 03:33:59,905 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-14 03:33:59,926 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-14 03:34:00,150 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-14 03:34:00,161 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-14 03:34:00,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:34:00,360 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-14 03:34:00,377 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-14 03:34:00,469 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-14 03:34:00,483 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-14 03:34:00,534 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-14 03:34:00,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:34:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268766200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:34:00,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [91475341] [2024-11-14 03:34:00,912 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2024-11-14 03:34:00,912 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:34:00,912 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:34:00,913 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:34:00,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:34:06,465 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-14 03:34:06,904 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:36:31,493 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33478#(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_~altusers~0#1.base| 0) (= |ULTIMATE.start_main_~altusers~0#1.offset| 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr309_30| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr309_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr309_30| 4294967296)))) (exists ((|v_#valid_917| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#length_899| (Array Int Int)) (|v_#memory_$Pointer$.base_555| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_553| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_552| (Array Int (Array Int Int)))) (and (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= 0 (select |v_#valid_917| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_555| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_555| |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)))) (= (store |v_#memory_$Pointer$.base_552| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_552| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_553|) (<= 40 (select |v_#length_899| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_555| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_555|) (= (select |v_#valid_917| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#length_899| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (= (store |v_#valid_917| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|))) (exists ((|v_#memory_int_638| (Array Int (Array Int Int))) (|v_#memory_int_643| (Array Int (Array Int Int))) (|v_#memory_int_642| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_640| (Array Int (Array Int Int)))) (and (= |v_#memory_int_643| (store |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_643| |ULTIMATE.start_main_~user~0#1.base|) 12)))) (= |v_#memory_int_640| (store |v_#memory_int_638| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_638| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_642|) (= (store |v_#memory_int_643| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_643| |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|))) (exists ((|v_#memory_$Pointer$.offset_548| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_549| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_551| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_551| (store |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_551| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_548| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_548| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_549|)))) (and (exists ((|v_#valid_917| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#length_899| (Array Int Int)) (|v_#memory_$Pointer$.base_555| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_553| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_552| (Array Int (Array Int Int)))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_552| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_552| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_553|) (<= 40 (select |v_#length_899| |ULTIMATE.start_main_~user~0#1.base|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_555| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_555|) (= (select |v_#valid_917| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_555| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_555| |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_917| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#valid_917| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (store |v_#length_899| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_$Pointer$.offset_548| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_549| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_551| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_551| (store |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_551| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_548| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_548| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_549|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr309_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr309_30| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr309_30|))) (exists ((|v_#memory_int_638| (Array Int (Array Int Int))) (|v_#memory_int_643| (Array Int (Array Int Int))) (|v_#memory_int_642| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_640| (Array Int (Array Int Int)))) (and (= |v_#memory_int_643| (store |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_643| |ULTIMATE.start_main_~user~0#1.base|) 12)))) (= |v_#memory_int_640| (store |v_#memory_int_638| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_638| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= |v_old(#memory_int)_AFTER_CALL_5| (store |v_#memory_int_643| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_643| |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_640| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_642|))))) (= ~count_int_int~0 0))' at error location [2024-11-14 03:36:31,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:36:31,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:36:31,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-14 03:36:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750903822] [2024-11-14 03:36:31,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:36:31,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:36:31,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:36:31,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:36:31,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2308, Unknown=93, NotChecked=0, Total=2652 [2024-11-14 03:36:31,495 INFO L87 Difference]: Start difference. First operand 893 states and 954 transitions. Second operand has 18 states, 15 states have (on average 5.133333333333334) internal successors, (77), 18 states have internal predecessors, (77), 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-14 03:36:33,837 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-14 03:36:41,545 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-14 03:36:43,549 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-14 03:36:45,553 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-14 03:36:47,556 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-14 03:36:49,563 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-14 03:36:51,567 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-14 03:36:52,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:55,500 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-14 03:36:57,504 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-14 03:36:59,509 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-14 03:37:01,514 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-14 03:37:03,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:37:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:37:18,435 INFO L93 Difference]: Finished difference Result 894 states and 960 transitions. [2024-11-14 03:37:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:37:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.133333333333334) internal successors, (77), 18 states have internal predecessors, (77), 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 58 [2024-11-14 03:37:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:37:18,439 INFO L225 Difference]: With dead ends: 894 [2024-11-14 03:37:18,439 INFO L226 Difference]: Without dead ends: 894 [2024-11-14 03:37:18,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 146.0s TimeCoverageRelationStatistics Valid=290, Invalid=2696, Unknown=94, NotChecked=0, Total=3080 [2024-11-14 03:37:18,442 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 831 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 7840 mSolverCounterSat, 51 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 7902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 7840 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:37:18,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 2956 Invalid, 7902 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 7840 Invalid, 11 Unknown, 0 Unchecked, 46.3s Time] [2024-11-14 03:37:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-14 03:37:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 887. [2024-11-14 03:37:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 493 states have (on average 1.8559837728194726) internal successors, (915), 877 states have internal predecessors, (915), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 03:37:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 947 transitions. [2024-11-14 03:37:18,455 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 947 transitions. Word has length 58 [2024-11-14 03:37:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:37:18,455 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 947 transitions. [2024-11-14 03:37:18,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.133333333333334) internal successors, (77), 18 states have internal predecessors, (77), 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-14 03:37:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 947 transitions. [2024-11-14 03:37:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-14 03:37:18,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:37:18,458 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] [2024-11-14 03:37:18,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:37:18,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 03:37:18,663 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:37:18,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:37:18,663 INFO L85 PathProgramCache]: Analyzing trace with hash -89345735, now seen corresponding path program 1 times [2024-11-14 03:37:18,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:37:18,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044323403] [2024-11-14 03:37:18,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:37:18,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:37:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:37:19,677 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-14 03:37:19,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:37:19,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044323403] [2024-11-14 03:37:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044323403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:37:19,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:37:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 03:37:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700660634] [2024-11-14 03:37:19,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:37:19,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:37:19,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:37:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:37:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:37:19,679 INFO L87 Difference]: Start difference. First operand 887 states and 947 transitions. Second operand has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 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-14 03:37:21,933 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-14 03:37:27,649 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-14 03:37:29,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:37:31,659 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-14 03:37:33,663 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-14 03:37:35,665 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-14 03:37:37,668 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-14 03:37:39,671 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-14 03:37:41,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:37:43,682 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-14 03:37:45,687 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-14 03:37:47,691 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-14 03:37:49,694 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-14 03:37:51,972 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-14 03:37:53,976 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-14 03:37:55,980 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-14 03:37:57,983 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-14 03:37:59,989 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-14 03:38:01,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:03,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:05,999 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-14 03:38:08,008 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-14 03:38:10,029 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-14 03:38:12,046 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-14 03:38:14,050 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-14 03:38:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:38:23,909 INFO L93 Difference]: Finished difference Result 897 states and 963 transitions. [2024-11-14 03:38:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:38:23,910 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 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 59 [2024-11-14 03:38:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:38:23,913 INFO L225 Difference]: With dead ends: 897 [2024-11-14 03:38:23,913 INFO L226 Difference]: Without dead ends: 897 [2024-11-14 03:38:23,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-14 03:38:23,914 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 846 mSDsluCounter, 3345 mSDsCounter, 0 mSdLazyCounter, 5254 mSolverCounterSat, 30 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 3747 SdHoareTripleChecker+Invalid, 5309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5254 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:38:23,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 3747 Invalid, 5309 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 5254 Invalid, 25 Unknown, 0 Unchecked, 63.8s Time] [2024-11-14 03:38:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-14 03:38:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 894. [2024-11-14 03:38:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 499 states have (on average 1.8496993987975952) internal successors, (923), 883 states have internal predecessors, (923), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-14 03:38:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 956 transitions. [2024-11-14 03:38:23,933 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 956 transitions. Word has length 59 [2024-11-14 03:38:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:38:23,934 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 956 transitions. [2024-11-14 03:38:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 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-14 03:38:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 956 transitions. [2024-11-14 03:38:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-14 03:38:23,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:38:23,934 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] [2024-11-14 03:38:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:38:23,934 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:38:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:38:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -89345734, now seen corresponding path program 1 times [2024-11-14 03:38:23,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:38:23,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689009094] [2024-11-14 03:38:23,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:38:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:25,202 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-14 03:38:25,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:38:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689009094] [2024-11-14 03:38:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689009094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:38:25,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:38:25,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:38:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158356407] [2024-11-14 03:38:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:38:25,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:38:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:38:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:38:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:38:25,203 INFO L87 Difference]: Start difference. First operand 894 states and 956 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 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-14 03:38:27,443 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-14 03:38:29,447 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-14 03:38:31,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-14 03:38:33,453 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-14 03:38:35,455 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-14 03:38:37,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:42,841 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-14 03:38:44,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:46,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:48,859 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-14 03:38:50,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:38:52,772 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-14 03:38:54,776 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-14 03:39:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:39:06,181 INFO L93 Difference]: Finished difference Result 896 states and 962 transitions. [2024-11-14 03:39:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:39:06,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 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 59 [2024-11-14 03:39:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:39:06,184 INFO L225 Difference]: With dead ends: 896 [2024-11-14 03:39:06,184 INFO L226 Difference]: Without dead ends: 896 [2024-11-14 03:39:06,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:39:06,184 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 827 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 5567 mSolverCounterSat, 29 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 5607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5567 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:39:06,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 2504 Invalid, 5607 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 5567 Invalid, 11 Unknown, 0 Unchecked, 40.7s Time] [2024-11-14 03:39:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-14 03:39:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 894. [2024-11-14 03:39:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 499 states have (on average 1.8476953907815632) internal successors, (922), 883 states have internal predecessors, (922), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-14 03:39:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 955 transitions. [2024-11-14 03:39:06,198 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 955 transitions. Word has length 59 [2024-11-14 03:39:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:39:06,198 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 955 transitions. [2024-11-14 03:39:06,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 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-14 03:39:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 955 transitions. [2024-11-14 03:39:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 03:39:06,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:39:06,201 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-14 03:39:06,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:39:06,201 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-14 03:39:06,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:39:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 658274324, now seen corresponding path program 1 times [2024-11-14 03:39:06,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:39:06,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888811276] [2024-11-14 03:39:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:39:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:07,341 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-14 03:39:07,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:39:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888811276] [2024-11-14 03:39:07,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888811276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202774695] [2024-11-14 03:39:07,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:07,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:39:07,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:39:07,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:39:07,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d5d66e-1c65-4c84-b1f2-959e6f39d9bc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:39:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:07,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 03:39:07,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:39:07,622 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-14 03:39:07,899 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:39:07,899 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-14 03:39:07,997 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-14 03:39:08,234 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-14 03:39:08,605 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:39:08,606 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-14 03:39:08,861 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:39:08,861 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-14 03:39:08,884 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-14 03:39:08,989 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-14 03:39:08,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:39:09,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-14 03:39:09,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int)) (v_ArrVal_880 (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~mem50#1.base| v_ArrVal_880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_877)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-14 03:39:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202774695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:09,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009989370] [2024-11-14 03:39:09,200 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2024-11-14 03:39:09,200 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:39:09,202 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:39:09,203 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:39:09,203 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:39:15,098 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 130 for LOIs [2024-11-14 03:39:15,668 INFO L180 IcfgInterpreter]: Interpretation finished