./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:35:19,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:35:19,729 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:35:19,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:35:19,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:35:19,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:35:19,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:35:19,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:35:19,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:35:19,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:35:19,780 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:35:19,780 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:35:19,781 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:35:19,784 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:35:19,784 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:35:19,784 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:35:19,785 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:35:19,789 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:35:19,789 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:35:19,789 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:35:19,790 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:35:19,790 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:35:19,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:35:19,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:35:19,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:35:19,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:35:19,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:35:19,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:35:19,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:35:19,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:35:19,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:35:19,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:35:19,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:35:19,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:35:19,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:35:19,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:35:19,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:35:19,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:35:19,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:35:19,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:35:19,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:35:19,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:35:19,800 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:35:19,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:35:19,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:35:19,801 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:35:19,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:35:19,801 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-09 05:35:20,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:35:20,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:35:20,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:35:20,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:35:20,126 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:35:20,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i Unable to find full path for "g++" [2024-11-09 05:35:22,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:35:22,430 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:35:22,430 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2024-11-09 05:35:22,447 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/data/c310ebee9/fb9628b7f2b943dbadfdfe0d4850dad9/FLAG8a3c71e84 [2024-11-09 05:35:22,467 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/data/c310ebee9/fb9628b7f2b943dbadfdfe0d4850dad9 [2024-11-09 05:35:22,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:35:22,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:35:22,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:35:22,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:35:22,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:35:22,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:35:22" (1/1) ... [2024-11-09 05:35:22,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339b698a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:22, skipping insertion in model container [2024-11-09 05:35:22,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:35:22" (1/1) ... [2024-11-09 05:35:22,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:35:23,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i[37435,37448] [2024-11-09 05:35:23,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:35:23,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:35:23,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i[37435,37448] [2024-11-09 05:35:23,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:35:23,432 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:35:23,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23 WrapperNode [2024-11-09 05:35:23,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:35:23,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:35:23,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:35:23,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:35:23,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,568 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1247 [2024-11-09 05:35:23,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:35:23,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:35:23,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:35:23,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:35:23,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:35:23,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:35:23,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:35:23,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:35:23,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (1/1) ... [2024-11-09 05:35:23,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:35:23,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:23,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:35:23,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:35:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 05:35:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 05:35:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:35:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:35:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:35:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:35:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:35:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:35:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:35:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:35:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:35:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:35:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:35:24,066 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:35:24,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:35:25,906 INFO L? ?]: Removed 290 outVars from TransFormulas that were not future-live. [2024-11-09 05:35:25,906 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:35:27,447 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:35:27,447 INFO L316 CfgBuilder]: Removed 50 assume(true) statements. [2024-11-09 05:35:27,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:35:27 BoogieIcfgContainer [2024-11-09 05:35:27,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:35:27,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:35:27,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:35:27,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:35:27,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:35:22" (1/3) ... [2024-11-09 05:35:27,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754ee3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:35:27, skipping insertion in model container [2024-11-09 05:35:27,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:35:23" (2/3) ... [2024-11-09 05:35:27,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754ee3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:35:27, skipping insertion in model container [2024-11-09 05:35:27,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:35:27" (3/3) ... [2024-11-09 05:35:27,459 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-1.i [2024-11-09 05:35:27,477 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:35:27,478 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:35:27,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:35:27,565 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=LoopHeads, 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;@507ebd5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:35:27,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:35:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 103 states have (on average 1.7281553398058251) internal successors, (178), 104 states have internal predecessors, (178), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:35:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:35:27,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:27,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:27,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2050054534, now seen corresponding path program 1 times [2024-11-09 05:35:27,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:27,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637191482] [2024-11-09 05:35:27,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:27,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:35:27,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637191482] [2024-11-09 05:35:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637191482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:27,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:27,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:35:27,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152557194] [2024-11-09 05:35:27,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:27,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 05:35:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:27,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 05:35:27,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:35:27,850 INFO L87 Difference]: Start difference. First operand has 109 states, 103 states have (on average 1.7281553398058251) internal successors, (178), 104 states have internal predecessors, (178), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-09 05:35:29,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:31,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:33,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:35,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:35,623 INFO L93 Difference]: Finished difference Result 216 states and 365 transitions. [2024-11-09 05:35:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 05:35:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-09 05:35:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:35,637 INFO L225 Difference]: With dead ends: 216 [2024-11-09 05:35:35,638 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 05:35:35,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:35:35,645 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:35,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 7.7s Time] [2024-11-09 05:35:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 05:35:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 05:35:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.188118811881188) internal successors, (120), 101 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:35:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2024-11-09 05:35:35,694 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 10 [2024-11-09 05:35:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:35,695 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2024-11-09 05:35:35,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-09 05:35:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2024-11-09 05:35:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:35:35,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:35,698 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] [2024-11-09 05:35:35,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:35:35,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:35,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1075366928, now seen corresponding path program 1 times [2024-11-09 05:35:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346240297] [2024-11-09 05:35:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:35:37,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346240297] [2024-11-09 05:35:37,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346240297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:37,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:35:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747166527] [2024-11-09 05:35:37,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:37,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:35:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:35:37,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:35:37,054 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:39,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:41,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:43,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:45,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-09 05:35:47,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:49,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:51,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:54,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:56,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:35:58,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:00,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:02,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 [] [2024-11-09 05:36:04,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:06,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:07,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:09,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:11,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:13,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:15,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:17,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:19,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 05:36:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:36:22,559 INFO L93 Difference]: Finished difference Result 212 states and 253 transitions. [2024-11-09 05:36:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:36:22,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2024-11-09 05:36:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:36:22,569 INFO L225 Difference]: With dead ends: 212 [2024-11-09 05:36:22,569 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 05:36:22,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:36:22,571 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 69 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:36:22,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 561 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 18 Unknown, 0 Unchecked, 45.4s Time] [2024-11-09 05:36:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 05:36:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2024-11-09 05:36:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 103 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:36:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2024-11-09 05:36:22,626 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 25 [2024-11-09 05:36:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:36:22,627 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2024-11-09 05:36:22,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2024-11-09 05:36:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:36:22,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:22,638 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:36:22,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:36:22,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:36:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1369231169, now seen corresponding path program 1 times [2024-11-09 05:36:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349613530] [2024-11-09 05:36:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:23,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:36:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349613530] [2024-11-09 05:36:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349613530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:36:23,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:36:23,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:36:23,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315716679] [2024-11-09 05:36:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:36:23,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:36:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:36:23,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:36:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:36:23,074 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:25,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:26,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:28,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:30,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:32,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:34,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:36,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:38,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:40,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:42,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:44,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:47,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 05:36:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:36:47,146 INFO L93 Difference]: Finished difference Result 254 states and 300 transitions. [2024-11-09 05:36:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:36:47,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 05:36:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:36:47,157 INFO L225 Difference]: With dead ends: 254 [2024-11-09 05:36:47,157 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 05:36:47,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:36:47,158 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 33 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:36:47,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 222 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 10 Unknown, 0 Unchecked, 24.0s Time] [2024-11-09 05:36:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 05:36:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2024-11-09 05:36:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.167832167832168) internal successors, (167), 143 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:36:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2024-11-09 05:36:47,173 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 54 [2024-11-09 05:36:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:36:47,173 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2024-11-09 05:36:47,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:36:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2024-11-09 05:36:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 05:36:47,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:47,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:36:47,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:36:47,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:36:47,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash 106261334, now seen corresponding path program 1 times [2024-11-09 05:36:47,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:47,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801015962] [2024-11-09 05:36:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:47,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 05:36:47,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:36:47,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801015962] [2024-11-09 05:36:47,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801015962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:36:47,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:36:47,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:36:47,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539418541] [2024-11-09 05:36:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:36:47,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:36:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:36:47,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:36:47,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:36:47,684 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:36:49,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:51,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:53,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:55,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:57,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:36:59,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:01,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:03,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:05,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:07,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:09,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:11,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:13,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:15,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 05:37:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:15,994 INFO L93 Difference]: Finished difference Result 326 states and 386 transitions. [2024-11-09 05:37:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:37:15,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2024-11-09 05:37:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:16,000 INFO L225 Difference]: With dead ends: 326 [2024-11-09 05:37:16,000 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 05:37:16,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-09 05:37:16,002 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 299 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:16,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 220 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 28.3s Time] [2024-11-09 05:37:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 05:37:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 124. [2024-11-09 05:37:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 119 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:37:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2024-11-09 05:37:16,020 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 67 [2024-11-09 05:37:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:16,020 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2024-11-09 05:37:16,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:37:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2024-11-09 05:37:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 05:37:16,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:16,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:37:16,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:37:16,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:37:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1820447610, now seen corresponding path program 1 times [2024-11-09 05:37:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:37:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039228875] [2024-11-09 05:37:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:16,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:37:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:37:17,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:37:17,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039228875] [2024-11-09 05:37:17,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039228875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:37:17,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225332812] [2024-11-09 05:37:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:17,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:37:17,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:37:17,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:37:17,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:37:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:24,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 05:37:24,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:24,102 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 11 treesize of output 7 [2024-11-09 05:37:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:37:24,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:37:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225332812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:37:24,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:37:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2024-11-09 05:37:24,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145703839] [2024-11-09 05:37:24,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:37:24,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:37:24,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:24,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:37:24,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:37:24,150 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:37:26,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:29,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:31,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:33,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:35,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:38,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:40,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:42,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:44,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:46,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:48,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:50,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-09 05:37:52,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:54,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:56,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:37:58,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:00,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:38:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:02,641 INFO L93 Difference]: Finished difference Result 270 states and 318 transitions. [2024-11-09 05:38:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:38:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-09 05:38:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:02,649 INFO L225 Difference]: With dead ends: 270 [2024-11-09 05:38:02,649 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 05:38:02,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:38:02,650 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 67 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:02,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 372 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 17 Unknown, 0 Unchecked, 38.5s Time] [2024-11-09 05:38:02,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 05:38:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2024-11-09 05:38:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 121 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:38:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2024-11-09 05:38:02,675 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 75 [2024-11-09 05:38:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:02,675 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2024-11-09 05:38:02,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:38:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2024-11-09 05:38:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 05:38:02,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:02,678 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:38:02,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:38:02,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:38:02,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:38:02,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:02,879 INFO L85 PathProgramCache]: Analyzing trace with hash 737247092, now seen corresponding path program 1 times [2024-11-09 05:38:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:38:02,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48330686] [2024-11-09 05:38:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:38:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:38:04,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:38:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48330686] [2024-11-09 05:38:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48330686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:38:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801517215] [2024-11-09 05:38:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:04,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:38:04,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:38:04,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:38:04,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:38:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:40,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 05:38:40,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:38:40,299 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 11 treesize of output 7 [2024-11-09 05:38:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:38:40,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:38:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:38:40,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801517215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:38:40,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1416197793] [2024-11-09 05:38:40,563 INFO L159 IcfgInterpreter]: Started Sifa with 71 locations of interest [2024-11-09 05:38:40,563 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:38:40,567 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:38:40,572 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:38:40,573 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:39:17,234 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 397 for LOIs [2024-11-09 05:39:24,820 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:39:47,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_#Ultimate.C_memset_#ptr.offset| 0)) (.cse4 (= 44 |c_#Ultimate.C_memset_#amount|)) (.cse0 (<= 1 |c_#StackHeapBarrier|)) (.cse1 (= |c_#Ultimate.C_memset_#value| 0)) (.cse2 (= |c_#Ultimate.C_memset_#amount| 384))) (and (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse4)) (let ((.cse5 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse14 (= |c_old(#memory_int)| |c_#memory_int|)) (.cse15 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|))) (or (and .cse5 .cse0 (exists ((|v_#memory_$Pointer$.offset_314| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_315| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_int_412| (Array Int (Array Int Int))) (|v_#memory_int_34| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_414| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_315| (Array Int (Array Int Int))) (|v_#length_32| (Array Int Int)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| Int) (|v_#memory_$Pointer$.offset_21| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_14| Int) (|v_#memory_$Pointer$.base_314| (Array Int (Array Int Int))) (|v_#valid_48| (Array Int Int))) (let ((.cse6 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|)) (.cse9 (select |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|)) (.cse11 (select |v_#memory_int_127| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|)) (.cse7 (select |v_#memory_$Pointer$.base_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|)) (.cse12 (select |v_#memory_$Pointer$.offset_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|)) (.cse10 (select |v_#memory_int_34| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|)) (.cse8 (select (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|) 8)) (.cse13 (select |v_#memory_int_414| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|))) (and (= (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store (store .cse6 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|) 32 (select .cse7 32))) |v_#memory_$Pointer$.base_315|) (not (= .cse8 0)) (= (store |v_#memory_$Pointer$.offset_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.offset_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|) 36 (select .cse9 36))) |v_#memory_$Pointer$.offset_21|) (= (store |v_#memory_int_34| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store (store .cse10 32 4) 16 (select .cse11 16))) |v_#memory_int_127|) (= |c_#valid| (store |v_#valid_48| .cse8 1)) (= (store |v_#memory_$Pointer$.base_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.base_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|) 36 (select .cse6 36))) |v_#memory_$Pointer$.base_21|) (= (store |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store (store .cse9 28 0) 32 (select .cse12 32))) |v_#memory_$Pointer$.offset_315|) (= (select |v_#valid_48| .cse8) 0) (= (store |v_#memory_int_127| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store .cse11 12 (select .cse13 12))) |v_#memory_int_414|) (= (store |v_#memory_$Pointer$.base_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store (store (store .cse7 16 0) 12 0) 8 .cse8)) |c_old(#memory_$Pointer$.base)|) (= |c_#length| (store |v_#length_32| .cse8 44)) (= |c_old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store (store (store .cse12 16 0) 12 0) 8 0))) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= |v_#memory_int_34| (store |v_#memory_int_412| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store (store (select |v_#memory_int_412| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_14|) 28 (select .cse10 28)))) (= |c_#Ultimate.C_memset_#ptr.base| .cse8) (= (store |v_#memory_int_414| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (store .cse13 8 (select (select |c_old(#memory_int)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|) 8))) |c_old(#memory_int)|)))) .cse14 .cse3 .cse15 .cse1 .cse4) (and .cse5 .cse0 .cse14 (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| Int) (|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_415| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_317| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_317| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_106| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.base_13| Int) (|v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_13| Int) (|v_#valid_49| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_6| Int)) (let ((.cse35 (select (select |v_#memory_$Pointer$.base_317| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse36 (+ (select (select |v_#memory_$Pointer$.offset_317| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8) 16)) (.cse27 (select (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse28 (select (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8))) (let ((.cse52 (select (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse53 (select (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse33 (store |v_#memory_$Pointer$.offset_108| .cse27 (store (select |v_#memory_$Pointer$.offset_108| .cse27) .cse28 0))) (.cse34 (store |v_#memory_$Pointer$.base_107| .cse27 (store (select |v_#memory_$Pointer$.base_107| .cse27) .cse28 |v_ULTIMATE.start_main_#t~malloc61#1.base_6|))) (.cse23 (store |v_#memory_$Pointer$.offset_317| .cse35 (store (select |v_#memory_$Pointer$.offset_317| .cse35) .cse36 8))) (.cse18 (store |v_#memory_$Pointer$.base_317| .cse35 (store (select |v_#memory_$Pointer$.base_317| .cse35) .cse36 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (let ((.cse19 (select (select .cse18 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse20 (+ (select (select .cse23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8) 4)) (.cse16 (select (select .cse34 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse17 (+ 40 (select (select .cse33 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8))) (.cse30 (select (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse31 (+ (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8) 20)) (.cse21 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse22 (+ 8 (select (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8))) (.cse24 (select (select |c_old(#memory_$Pointer$.offset)| .cse52) .cse53)) (.cse25 (select (select |c_old(#memory_$Pointer$.base)| .cse52) .cse53))) (and (= |c_old(#memory_int)| (store |v_#memory_int_129| .cse16 (store (select |v_#memory_int_129| .cse16) .cse17 2685476833))) (= |c_#valid| (store |v_#valid_49| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1)) (= (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 (select (select |v_#memory_$Pointer$.base_106| .cse19) .cse20))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| .cse21 (store (select |v_#memory_$Pointer$.offset_107| .cse21) .cse22 (select (select |v_#memory_$Pointer$.offset_106| .cse21) .cse22))) |v_#memory_$Pointer$.offset_106|) (= (store .cse23 .cse19 (store (select .cse23 .cse19) .cse20 (select (select |v_#memory_$Pointer$.offset_107| .cse19) .cse20))) |v_#memory_$Pointer$.offset_107|) (or (not (= .cse24 0)) (not (= .cse25 0))) (= (let ((.cse26 (let ((.cse29 (let ((.cse32 (store |v_#memory_int_128| .cse19 (store (select |v_#memory_int_128| .cse19) .cse20 32)))) (store .cse32 .cse21 (store (select .cse32 .cse21) .cse22 5))))) (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 8))))) (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 (select (select |v_#memory_int_129| .cse27) .cse28)))) |v_#memory_int_129|) (= (store |v_#memory_$Pointer$.offset_106| .cse30 (store (select |v_#memory_$Pointer$.offset_106| .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_108| .cse30) .cse31))) |v_#memory_$Pointer$.offset_108|) (= (store .cse33 .cse16 (store (select .cse33 .cse16) .cse17 (select (select |c_old(#memory_$Pointer$.offset)| .cse16) .cse17))) |c_old(#memory_$Pointer$.offset)|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_#t~malloc61#1.base_6|) 0) (= (store .cse34 .cse16 (store (select .cse34 .cse16) .cse17 (select (select |c_old(#memory_$Pointer$.base)| .cse16) .cse17))) |c_old(#memory_$Pointer$.base)|) (<= (+ |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1) |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 0)) (= (store |v_#memory_$Pointer$.base_108| .cse30 (store (select |v_#memory_$Pointer$.base_108| .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_107| .cse30) .cse31))) |v_#memory_$Pointer$.base_107|) (= (store |v_#memory_int_415| .cse35 (store (select |v_#memory_int_415| .cse35) .cse36 (select (select |v_#memory_int_128| .cse35) .cse36))) |v_#memory_int_128|) (let ((.cse37 (exists ((|v_#memory_$Pointer$.offset_314| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_315| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_21| (Array Int (Array Int Int)))) (let ((.cse51 (select |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (and (= (store |v_#memory_$Pointer$.offset_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (select |v_#memory_$Pointer$.offset_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 36 (select .cse51 36))) |v_#memory_$Pointer$.offset_21|) (= |v_#memory_$Pointer$.offset_315| (store |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store .cse51 28 0) 32 (select (select |v_#memory_$Pointer$.offset_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 32)))))))) (.cse41 (exists ((|v_#Ultimate.C_memset_#t~loopctr226_27| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr226_27|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr226_27| 4294967296)))))) (or (and .cse37 (exists ((|v_#memory_int_412| (Array Int (Array Int Int))) (|v_#memory_int_34| (Array Int (Array Int Int))) (|v_#memory_int_414| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int)))) (let ((.cse40 (select |v_#memory_int_127| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (.cse38 (select |v_#memory_int_414| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (.cse39 (select |v_#memory_int_34| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (and (= (store |v_#memory_int_414| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store .cse38 8 (select (select |v_#memory_int_BEFORE_CALL_18| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8))) |v_#memory_int_BEFORE_CALL_18|) (= (store |v_#memory_int_34| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store .cse39 32 4) 16 (select .cse40 16))) |v_#memory_int_127|) (= (store |v_#memory_int_127| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store .cse40 12 (select .cse38 12))) |v_#memory_int_414|) (= |v_#memory_int_34| (store |v_#memory_int_412| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store (select |v_#memory_int_412| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_13|) 28 (select .cse39 28))))))) .cse41 (exists ((|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_315| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_314| (Array Int (Array Int Int))) (|v_#length_32| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#valid_48| (Array Int Int))) (let ((.cse43 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (.cse44 (select |v_#memory_$Pointer$.base_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (.cse42 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8))) (and (= (store |v_#length_32| .cse42 44) |v_#length_33|) (not (= .cse42 0)) (= (select |v_#valid_48| .cse42) 0) (<= (+ .cse42 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (select |v_#memory_$Pointer$.base_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 36 (select .cse43 36))) |v_#memory_$Pointer$.base_21|) (= (store |v_#memory_$Pointer$.base_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store (store .cse44 16 0) 12 0) 8 .cse42)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_13|) (= (store |v_#valid_48| .cse42 1) |v_#valid_49|) (= |v_#memory_$Pointer$.base_315| (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store .cse43 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 32 (select .cse44 32)))) (= |v_ULTIMATE.start_main_#t~mem54#1.base_13| .cse42))))) (and .cse37 .cse41 (exists ((|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_315| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_314| (Array Int (Array Int Int))) (|v_#length_32| (Array Int Int)) (|v_#valid_48| (Array Int Int))) (let ((.cse45 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8)) (.cse46 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (.cse47 (select |v_#memory_$Pointer$.base_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (and (<= (+ .cse45 1) |c_#StackHeapBarrier|) (= (store |v_#valid_48| .cse45 1) |v_#valid_49|) (= (store |v_#length_32| .cse45 44) |v_#length_33|) (= (select |v_#valid_48| .cse45) 0) (not (= .cse45 0)) (= (store |v_#memory_$Pointer$.base_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (select |v_#memory_$Pointer$.base_314| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 36 (select .cse46 36))) |v_#memory_$Pointer$.base_21|) (= .cse45 |v_ULTIMATE.start_main_#t~mem54#1.base_13|) (= (store |v_#memory_$Pointer$.base_315| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store (store .cse47 16 0) 12 0) 8 .cse45)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_14|) (= |v_#memory_$Pointer$.base_315| (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store .cse46 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 32 (select .cse47 32))))))) (exists ((|v_#memory_int_412| (Array Int (Array Int Int))) (|v_#memory_int_34| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_414| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_20| (Array Int (Array Int Int)))) (let ((.cse50 (select |v_#memory_int_127| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (.cse48 (select |v_#memory_int_414| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (.cse49 (select |v_#memory_int_34| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))) (and (= (store |v_#memory_int_414| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store .cse48 8 (select (select |v_#memory_int_BEFORE_CALL_20| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 8))) |v_#memory_int_BEFORE_CALL_20|) (= (store |v_#memory_int_34| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store .cse49 32 4) 16 (select .cse50 16))) |v_#memory_int_127|) (= (store |v_#memory_int_127| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store .cse50 12 (select .cse48 12))) |v_#memory_int_414|) (= |v_#memory_int_34| (store |v_#memory_int_412| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (store (store (select |v_#memory_int_412| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_13|) 28 (select .cse49 28)))))))))) (= (store |v_#memory_$Pointer$.base_106| .cse21 (store (select |v_#memory_$Pointer$.base_106| .cse21) .cse22 (select (select |v_#memory_$Pointer$.base_108| .cse21) .cse22))) |v_#memory_$Pointer$.base_108|) (= |c_#Ultimate.C_memset_#ptr.offset| .cse24) (= .cse25 |c_#Ultimate.C_memset_#ptr.base|) (= (store |v_#length_33| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 384) |c_#length|)))))) .cse15 .cse1 .cse2))))) is different from false [2024-11-09 05:43:01,769 WARN L286 SmtUtils]: Spent 2.78m on a formula simplification that was a NOOP. DAG size: 307 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:46:24,743 WARN L286 SmtUtils]: Spent 3.02m on a formula simplification that was a NOOP. DAG size: 312 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:48:31,906 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3372#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~tmp~0#1.base| 0) (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~tmp~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-09 05:48:31,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:48:31,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:31,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 11 [2024-11-09 05:48:31,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132818686] [2024-11-09 05:48:31,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:48:31,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:48:31,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:31,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:48:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1475, Unknown=78, NotChecked=80, Total=1806 [2024-11-09 05:48:31,911 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 11 states, 8 states have (on average 10.375) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 05:48:34,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:36,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:38,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:40,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:42,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:44,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:46,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:48,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:50,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:52,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:48:59,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:01,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:03,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:06,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:08,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:09,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:11,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:13,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:15,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:18,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:20,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:49:24,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 05:49:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:24,676 INFO L93 Difference]: Finished difference Result 282 states and 337 transitions. [2024-11-09 05:49:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:49:24,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 10.375) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2024-11-09 05:49:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:24,679 INFO L225 Difference]: With dead ends: 282 [2024-11-09 05:49:24,679 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 05:49:24,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 549.5s TimeCoverageRelationStatistics Valid=229, Invalid=2049, Unknown=78, NotChecked=94, Total=2450 [2024-11-09 05:49:24,681 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 77 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 8 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:24,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 731 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 285 Invalid, 19 Unknown, 0 Unchecked, 50.5s Time] [2024-11-09 05:49:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 05:49:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 134. [2024-11-09 05:49:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 127 states have (on average 1.188976377952756) internal successors, (151), 128 states have internal predecessors, (151), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:49:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2024-11-09 05:49:24,704 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 77 [2024-11-09 05:49:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:24,704 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2024-11-09 05:49:24,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 10.375) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 05:49:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2024-11-09 05:49:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 05:49:24,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:24,707 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:24,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:49:24,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 05:49:24,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:49:24,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1590156666, now seen corresponding path program 2 times [2024-11-09 05:49:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241519572] [2024-11-09 05:49:24,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 05:49:27,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:27,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241519572] [2024-11-09 05:49:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241519572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:49:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526939993] [2024-11-09 05:49:27,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:49:27,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:49:27,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:49:27,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:49:27,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2d1cc5e-f1f8-4b00-8b86-2e65399f4c93/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process