./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.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_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/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_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/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_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/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 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:29:31,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:29:31,350 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:29:31,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:29:31,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:29:31,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:29:31,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:29:31,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:29:31,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:29:31,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:29:31,407 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:29:31,408 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:29:31,409 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:29:31,410 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:29:31,410 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:29:31,411 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:29:31,411 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:29:31,411 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:29:31,412 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:29:31,412 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:29:31,413 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:29:31,417 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:29:31,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:29:31,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:29:31,418 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:29:31,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:29:31,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:29:31,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:29:31,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:29:31,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:29:31,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:29:31,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:29:31,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:29:31,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:29:31,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:29:31,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:29:31,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:29:31,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:29:31,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:31,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:29:31,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:29:31,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:29:31,427 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:29:31,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:29:31,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:29:31,428 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:29:31,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:29:31,428 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_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/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_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/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 -> 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 [2024-11-09 04:29:31,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:29:31,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:29:31,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:29:31,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:29:31,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:29:31,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i Unable to find full path for "g++" [2024-11-09 04:29:33,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:29:34,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:29:34,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2024-11-09 04:29:34,114 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/data/61f609d3a/61e3b860337148db8e967b32c5113c09/FLAG3bba0513f [2024-11-09 04:29:34,299 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/data/61f609d3a/61e3b860337148db8e967b32c5113c09 [2024-11-09 04:29:34,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:29:34,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:29:34,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:34,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:29:34,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:29:34,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52266953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:34, skipping insertion in model container [2024-11-09 04:29:34,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:34" (1/1) ... [2024-11-09 04:29:34,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:29:34,942 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_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i[33021,33034] [2024-11-09 04:29:35,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:35,195 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:29:35,226 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_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i[33021,33034] [2024-11-09 04:29:35,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:35,346 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:29:35,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35 WrapperNode [2024-11-09 04:29:35,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:35,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:35,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:29:35,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:29:35,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,507 INFO L138 Inliner]: procedures = 176, calls = 386, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1713 [2024-11-09 04:29:35,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:35,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:29:35,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:29:35,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:29:35,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:29:35,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:29:35,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:29:35,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:29:35,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (1/1) ... [2024-11-09 04:29:35,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:35,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:29:35,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:29:35,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:29:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:29:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 04:29:35,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 04:29:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:29:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 04:29:35,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 04:29:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:29:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:29:35,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:29:36,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:29:36,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:29:38,256 INFO L? ?]: Removed 419 outVars from TransFormulas that were not future-live. [2024-11-09 04:29:38,256 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:29:39,982 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:29:39,983 INFO L316 CfgBuilder]: Removed 62 assume(true) statements. [2024-11-09 04:29:39,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:39 BoogieIcfgContainer [2024-11-09 04:29:39,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:29:39,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:29:39,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:29:39,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:29:39,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:29:34" (1/3) ... [2024-11-09 04:29:39,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19216b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:39, skipping insertion in model container [2024-11-09 04:29:39,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:35" (2/3) ... [2024-11-09 04:29:39,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19216b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:39, skipping insertion in model container [2024-11-09 04:29:39,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:39" (3/3) ... [2024-11-09 04:29:39,996 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-2.i [2024-11-09 04:29:40,014 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:29:40,014 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:29:40,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:29:40,099 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;@357ec940, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:29:40,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:29:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 144 states have (on average 1.7152777777777777) internal successors, (247), 155 states have internal predecessors, (247), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 04:29:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 04:29:40,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:40,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:40,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:40,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1745392527, now seen corresponding path program 1 times [2024-11-09 04:29:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230485588] [2024-11-09 04:29:40,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:40,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:40,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230485588] [2024-11-09 04:29:40,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230485588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:40,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:40,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:29:40,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991783937] [2024-11-09 04:29:40,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:40,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:29:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:40,443 INFO L87 Difference]: Start difference. First operand has 164 states, 144 states have (on average 1.7152777777777777) internal successors, (247), 155 states have internal predecessors, (247), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:29:42,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:44,130 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 04:29:46,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:48,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:50,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:51,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:53,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:55,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:57,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:59,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 04:30:01,769 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 04:30:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:03,262 INFO L93 Difference]: Finished difference Result 438 states and 760 transitions. [2024-11-09 04:30:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:30:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:03,281 INFO L225 Difference]: With dead ends: 438 [2024-11-09 04:30:03,281 INFO L226 Difference]: Without dead ends: 256 [2024-11-09 04:30:03,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:03,289 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 118 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:03,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 359 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 22.7s Time] [2024-11-09 04:30:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-09 04:30:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 147. [2024-11-09 04:30:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.21875) internal successors, (156), 138 states have internal predecessors, (156), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 04:30:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 188 transitions. [2024-11-09 04:30:03,357 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 188 transitions. Word has length 10 [2024-11-09 04:30:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:03,358 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 188 transitions. [2024-11-09 04:30:03,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 188 transitions. [2024-11-09 04:30:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 04:30:03,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:03,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:03,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:30:03,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:03,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:03,367 INFO L85 PathProgramCache]: Analyzing trace with hash 112001342, now seen corresponding path program 1 times [2024-11-09 04:30:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416837181] [2024-11-09 04:30:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:30:03,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416837181] [2024-11-09 04:30:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416837181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:03,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:03,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:30:03,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651186371] [2024-11-09 04:30:03,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:03,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:30:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:30:03,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:03,990 INFO L87 Difference]: Start difference. First operand 147 states and 188 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:06,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:08,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:10,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:12,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:14,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:16,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:18,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:20,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:22,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:25,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:30:27,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:30:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:28,544 INFO L93 Difference]: Finished difference Result 307 states and 392 transitions. [2024-11-09 04:30:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:28,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 04:30:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:28,550 INFO L225 Difference]: With dead ends: 307 [2024-11-09 04:30:28,551 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 04:30:28,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:28,553 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:28,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 322 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 11 Unknown, 0 Unchecked, 24.5s Time] [2024-11-09 04:30:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 04:30:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-09 04:30:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 144 states have (on average 1.2083333333333333) internal successors, (174), 154 states have internal predecessors, (174), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 04:30:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2024-11-09 04:30:28,570 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 65 [2024-11-09 04:30:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:28,570 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2024-11-09 04:30:28,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2024-11-09 04:30:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 04:30:28,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:28,574 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-09 04:30:28,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:30:28,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:28,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash 759899692, now seen corresponding path program 1 times [2024-11-09 04:30:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909771141] [2024-11-09 04:30:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:30:29,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909771141] [2024-11-09 04:30:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909771141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:29,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:29,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:30:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759945427] [2024-11-09 04:30:29,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:29,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:30:29,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:30:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:29,274 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:30:30,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:32,742 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 04:30:35,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:36,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:30:38,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 04:30:40,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:42,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:44,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:46,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:30:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:48,222 INFO L93 Difference]: Finished difference Result 359 states and 453 transitions. [2024-11-09 04:30:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-09 04:30:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:48,229 INFO L225 Difference]: With dead ends: 359 [2024-11-09 04:30:48,229 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 04:30:48,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:48,231 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 30 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:48,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 321 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 18.9s Time] [2024-11-09 04:30:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 04:30:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-09 04:30:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 193 states have (on average 1.1865284974093264) internal successors, (229), 203 states have internal predecessors, (229), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 04:30:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 267 transitions. [2024-11-09 04:30:48,250 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 267 transitions. Word has length 78 [2024-11-09 04:30:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:48,251 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 267 transitions. [2024-11-09 04:30:48,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:30:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 267 transitions. [2024-11-09 04:30:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 04:30:48,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:48,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:48,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:30:48,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:48,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash -361628508, now seen corresponding path program 1 times [2024-11-09 04:30:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231006184] [2024-11-09 04:30:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 04:30:49,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231006184] [2024-11-09 04:30:49,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231006184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203924594] [2024-11-09 04:30:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:49,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:49,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:49,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:49,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:30:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:49,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:30:49,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 04:30:50,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 04:30:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203924594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:50,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1340081710] [2024-11-09 04:30:50,499 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2024-11-09 04:30:50,499 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:50,505 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:50,513 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:50,513 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:57,793 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 121 for LOIs [2024-11-09 04:30:57,842 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:31:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1340081710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:31:10,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:31:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4, 4, 4] total 18 [2024-11-09 04:31:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841422182] [2024-11-09 04:31:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:31:10,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:31:10,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:10,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:31:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=202, Unknown=6, NotChecked=0, Total=306 [2024-11-09 04:31:10,501 INFO L87 Difference]: Start difference. First operand 215 states and 267 transitions. Second operand has 13 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 04:31:12,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 04:31:14,938 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 [0] [2024-11-09 04:31:16,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:19,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:21,335 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 [0] [2024-11-09 04:31:23,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:25,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:27,670 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 [0] [2024-11-09 04:31:29,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:31,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:33,687 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 [0] [2024-11-09 04:31:35,698 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 [0] [2024-11-09 04:31:37,704 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 [0] [2024-11-09 04:31:39,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:41,793 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 [0] [2024-11-09 04:31:43,801 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 [0] [2024-11-09 04:31:45,931 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 [0] [2024-11-09 04:31:47,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:50,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:52,781 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 [0] [2024-11-09 04:32:00,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:02,582 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 [0] [2024-11-09 04:32:04,588 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 [0] [2024-11-09 04:32:06,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:08,599 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 [0] [2024-11-09 04:32:10,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:12,612 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 [0] [2024-11-09 04:32:14,622 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 [0] [2024-11-09 04:32:16,629 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 [0] [2024-11-09 04:32:18,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:20,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:22,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:24,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:26,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:28,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:30,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:32,677 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 [0] [2024-11-09 04:32:34,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:36,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:38,723 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 [0] [2024-11-09 04:32:40,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:42,758 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 [0] [2024-11-09 04:32:44,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:46,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:52,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:32:54,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 04:33:00,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:02,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:05,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:07,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:09,065 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 [0] [2024-11-09 04:33:11,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:13,083 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 [0] [2024-11-09 04:33:15,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:17,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:19,102 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 [0] [2024-11-09 04:33:21,109 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 [0] [2024-11-09 04:33:23,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:25,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:26,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:31,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 04:33:35,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:33:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:35,059 INFO L93 Difference]: Finished difference Result 422 states and 527 transitions. [2024-11-09 04:33:35,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:33:35,073 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 91 [2024-11-09 04:33:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:35,075 INFO L225 Difference]: With dead ends: 422 [2024-11-09 04:33:35,075 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 04:33:35,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=108, Invalid=228, Unknown=6, NotChecked=0, Total=342 [2024-11-09 04:33:35,077 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 5 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 2 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 144.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:35,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1441 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 752 Invalid, 61 Unknown, 0 Unchecked, 144.1s Time] [2024-11-09 04:33:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 04:33:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-09 04:33:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 191 states have (on average 1.1780104712041886) internal successors, (225), 200 states have internal predecessors, (225), 19 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 04:33:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 263 transitions. [2024-11-09 04:33:35,121 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 263 transitions. Word has length 91 [2024-11-09 04:33:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:35,125 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 263 transitions. [2024-11-09 04:33:35,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 04:33:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 263 transitions. [2024-11-09 04:33:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 04:33:35,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:35,129 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:33:35,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:33:35,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:35,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:35,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1456611090, now seen corresponding path program 1 times [2024-11-09 04:33:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:35,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899361083] [2024-11-09 04:33:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 04:33:36,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899361083] [2024-11-09 04:33:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899361083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998853072] [2024-11-09 04:33:36,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:36,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:33:36,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:33:36,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3353b72-0bc7-4d3b-9ee8-4d21c99ae44d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:33:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:36,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:33:36,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 04:33:37,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:33:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 04:33:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998853072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:33:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1815189134] [2024-11-09 04:33:37,580 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2024-11-09 04:33:37,581 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:33:37,581 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:33:37,582 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:33:37,582 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:34:49,235 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2024-11-09 04:34:49,251 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 147 for LOIs [2024-11-09 04:34:49,470 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:34:55,566 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 36)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 28)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 32))) (and (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_751| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_751| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_751| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse1 (select .cse2 .cse1))) |v_#memory_int_105|) (= |c_#memory_int| (store |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse2 .cse3 4)))))) (exists ((|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_681| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |v_#memory_$Pointer$.offset_96| (store |v_#memory_$Pointer$.offset_681| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_681| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse4 .cse0)))) (= (store |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse4 .cse1 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) |c_#memory_$Pointer$.offset|)))) (exists ((|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_681| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_681| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_681| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse5 .cse0))) |v_#memory_$Pointer$.base_96|) (= (store |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse5 .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) |c_#memory_$Pointer$.base|)))))) is different from true [2024-11-09 04:34:55,625 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 28)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 32)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 16)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 36))) (and (exists ((|v_#memory_int_214| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_751| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse5 (select |v_#memory_int_214| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_751| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_751| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse1 (select .cse2 .cse1))) |v_#memory_int_105|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse2 .cse3 4) .cse4 (select .cse5 .cse4))) |v_#memory_int_214|) (= |c_#memory_int| (store |v_#memory_int_214| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse5 .cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))) (exists ((|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_682| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_681| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse8 (select |v_#memory_$Pointer$.base_682| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse7 .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select .cse8 .cse3))) |v_#memory_$Pointer$.base_682|) (= (store |v_#memory_$Pointer$.base_681| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_681| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse7 .cse0))) |v_#memory_$Pointer$.base_96|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_682| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse8 .cse4 0) .cse6 0)))))) (exists ((|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_681| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_682| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_$Pointer$.offset_682| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse9 (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse9 .cse1 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse3 (select .cse10 .cse3))) |v_#memory_$Pointer$.offset_682|) (= (store |v_#memory_$Pointer$.offset_682| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse10 .cse4 0) .cse6 0)) |c_#memory_$Pointer$.offset|) (= |v_#memory_$Pointer$.offset_96| (store |v_#memory_$Pointer$.offset_681| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_681| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse9 .cse0))))))))) is different from true [2024-11-09 04:35:13,041 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:35:21,079 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:36:19,184 WARN L286 SmtUtils]: Spent 18.92s on a formula simplification that was a NOOP. DAG size: 210 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:37:13,319 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:37:27,005 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:38:54,941 WARN L286 SmtUtils]: Spent 29.91s on a formula simplification that was a NOOP. DAG size: 218 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:38:56,956 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~count_int_int~0 0) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse0 (exists ((|v_#Ultimate.C_memset_#t~loopctr355_39| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr355_39|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr355_39| 4294967296)))))) (or (and .cse0 (exists ((|v_#memory_$Pointer$.offset_677| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_206| (Array Int (Array Int Int))) (|v_#memory_int_747| (Array Int (Array Int Int))) (|v_#memory_int_213| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_#valid_96| (Array Int Int)) (|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#length_59| (Array Int Int)) (|v_#memory_$Pointer$.base_677| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_BEFORE_CALL_73| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_#memory_$Pointer$.base_207| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse5 (select (select |v_#memory_$Pointer$.offset_207| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse19 (select (select |v_#memory_$Pointer$.base_677| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse20 (+ 16 (select (select |v_#memory_$Pointer$.offset_677| |c_ULTIMATE.start_main_~user~0#1.base|) 40)))) (let ((.cse21 (store |v_#memory_$Pointer$.offset_677| .cse19 (store (select |v_#memory_$Pointer$.offset_677| .cse19) .cse20 40))) (.cse16 (store |v_#memory_$Pointer$.base_677| .cse19 (store (select |v_#memory_$Pointer$.base_677| .cse19) .cse20 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse12 (store |v_#memory_$Pointer$.offset_207| .cse4 (store (select |v_#memory_$Pointer$.offset_207| .cse4) .cse5 0))) (.cse15 (store |v_#memory_$Pointer$.base_207| .cse4 (store (select |v_#memory_$Pointer$.base_207| .cse4) .cse5 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse14 (+ 40 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse1 (select (select |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse2 (+ 20 (select (select |v_#memory_$Pointer$.offset_208| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse8 (select (select |v_#memory_$Pointer$.base_206| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse9 (+ (select (select |v_#memory_$Pointer$.offset_206| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse10 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse11 (+ (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4))) (and (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_208| .cse1 (store (select |v_#memory_$Pointer$.offset_208| .cse1) .cse2 (select (select |v_#memory_$Pointer$.offset_207| .cse1) .cse2))) |v_#memory_$Pointer$.offset_207|) (= (let ((.cse3 (let ((.cse6 (let ((.cse7 (store |v_#memory_int_213| .cse10 (store (select |v_#memory_int_213| .cse10) .cse11 32)))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 5))))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 40))))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 (select (select |v_#memory_int_212| .cse4) .cse5)))) |v_#memory_int_212|) (= (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_73| .cse13) .cse14))) |v_#memory_$Pointer$.offset_BEFORE_CALL_73|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (store .cse15 .cse13 (store (select .cse15 .cse13) .cse14 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| .cse13) .cse14)))) (= |v_#memory_$Pointer$.base_206| (store .cse16 .cse10 (store (select .cse16 .cse10) .cse11 (select (select |v_#memory_$Pointer$.base_206| .cse10) .cse11)))) (let ((.cse17 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse18 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_73| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| .cse17) .cse18) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_73| .cse17) .cse18) 0)))) (= (store |v_#memory_int_747| .cse19 (store (select |v_#memory_int_747| .cse19) .cse20 (select (select |v_#memory_int_213| .cse19) .cse20))) |v_#memory_int_213|) (= |c_#valid| (store |v_#valid_96| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (= |c_#length| (store |v_#length_59| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= (select |v_#valid_96| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (store |v_#memory_$Pointer$.base_208| .cse1 (store (select |v_#memory_$Pointer$.base_208| .cse1) .cse2 (select (select |v_#memory_$Pointer$.base_207| .cse1) .cse2))) |v_#memory_$Pointer$.base_207|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_206| .cse8 (store (select |v_#memory_$Pointer$.offset_206| .cse8) .cse9 (select (select |v_#memory_$Pointer$.offset_208| .cse8) .cse9))) |v_#memory_$Pointer$.offset_208|) (= (store |v_#memory_$Pointer$.base_206| .cse8 (store (select |v_#memory_$Pointer$.base_206| .cse8) .cse9 (select (select |v_#memory_$Pointer$.base_208| .cse8) .cse9))) |v_#memory_$Pointer$.base_208|) (= (store .cse21 .cse10 (store (select .cse21 .cse10) .cse11 (select (select |v_#memory_$Pointer$.offset_206| .cse10) .cse11))) |v_#memory_$Pointer$.offset_206|))))))) (and .cse0 (exists ((|v_#memory_$Pointer$.offset_677| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_206| (Array Int (Array Int Int))) (|v_#memory_int_747| (Array Int (Array Int Int))) (|v_#memory_int_213| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_#valid_96| (Array Int Int)) (|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#length_59| (Array Int Int)) (|v_#memory_$Pointer$.base_677| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int)))) (let ((.cse39 (select (select |v_#memory_$Pointer$.base_677| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse40 (+ 16 (select (select |v_#memory_$Pointer$.offset_677| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse25 (select (select |v_#memory_$Pointer$.base_207| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse26 (select (select |v_#memory_$Pointer$.offset_207| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (let ((.cse42 (store |v_#memory_$Pointer$.offset_207| .cse25 (store (select |v_#memory_$Pointer$.offset_207| .cse25) .cse26 0))) (.cse34 (store |v_#memory_$Pointer$.base_207| .cse25 (store (select |v_#memory_$Pointer$.base_207| .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|))) (.cse41 (store |v_#memory_$Pointer$.offset_677| .cse39 (store (select |v_#memory_$Pointer$.offset_677| .cse39) .cse40 40))) (.cse33 (store |v_#memory_$Pointer$.base_677| .cse39 (store (select |v_#memory_$Pointer$.base_677| .cse39) .cse40 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse22 (select (select |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse23 (+ 20 (select (select |v_#memory_$Pointer$.offset_208| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse29 (select (select |v_#memory_$Pointer$.base_206| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse30 (+ (select (select |v_#memory_$Pointer$.offset_206| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse32 (+ (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4)) (.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse36 (+ 40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) 40)))) (and (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_208| .cse22 (store (select |v_#memory_$Pointer$.offset_208| .cse22) .cse23 (select (select |v_#memory_$Pointer$.offset_207| .cse22) .cse23))) |v_#memory_$Pointer$.offset_207|) (= (let ((.cse24 (let ((.cse27 (let ((.cse28 (store |v_#memory_int_213| .cse31 (store (select |v_#memory_int_213| .cse31) .cse32 32)))) (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 5))))) (store .cse27 .cse22 (store (select .cse27 .cse22) .cse23 40))))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 (select (select |v_#memory_int_212| .cse25) .cse26)))) |v_#memory_int_212|) (= |v_#memory_$Pointer$.base_206| (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 (select (select |v_#memory_$Pointer$.base_206| .cse31) .cse32)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse35) .cse36)))) (let ((.cse37 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse38 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (or (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse37) .cse38) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse37) .cse38) 0)))) (= (store |v_#memory_int_747| .cse39 (store (select |v_#memory_int_747| .cse39) .cse40 (select (select |v_#memory_int_213| .cse39) .cse40))) |v_#memory_int_213|) (= |c_#valid| (store |v_#valid_96| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (= |c_#length| (store |v_#length_59| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= (select |v_#valid_96| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (store |v_#memory_$Pointer$.base_208| .cse22 (store (select |v_#memory_$Pointer$.base_208| .cse22) .cse23 (select (select |v_#memory_$Pointer$.base_207| .cse22) .cse23))) |v_#memory_$Pointer$.base_207|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_206| .cse29 (store (select |v_#memory_$Pointer$.offset_206| .cse29) .cse30 (select (select |v_#memory_$Pointer$.offset_208| .cse29) .cse30))) |v_#memory_$Pointer$.offset_208|) (= (store |v_#memory_$Pointer$.base_206| .cse29 (store (select |v_#memory_$Pointer$.base_206| .cse29) .cse30 (select (select |v_#memory_$Pointer$.base_208| .cse29) .cse30))) |v_#memory_$Pointer$.base_208|) (= (store .cse41 .cse31 (store (select .cse41 .cse31) .cse32 (select (select |v_#memory_$Pointer$.offset_206| .cse31) .cse32))) |v_#memory_$Pointer$.offset_206|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse42 .cse35 (store (select .cse42 .cse35) .cse36 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse35) .cse36))))))))))))) is different from false [2024-11-09 04:40:32,755 WARN L286 SmtUtils]: Spent 32.05s on a formula simplification that was a NOOP. DAG size: 216 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:40:34,776 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~count_int_int~0 0) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~altusers~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~altusers~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_678| (Array Int (Array Int Int))) (|v_#memory_int_748| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_678| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_678| |c_ULTIMATE.start_main_~altusers~0#1.base|) 40)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_678| |c_ULTIMATE.start_main_~altusers~0#1.base|) 40) 12))) (and (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_678| .cse0 (store (select |v_#memory_$Pointer$.offset_678| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (= (store |v_#memory_int_748| .cse0 (let ((.cse2 (select |v_#memory_int_748| .cse0))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_678| .cse0 (store (select |v_#memory_$Pointer$.base_678| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) (let ((.cse3 (exists ((|v_#Ultimate.C_memset_#t~loopctr355_39| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr355_39|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr355_39| 4294967296)))))) (or (and .cse3 (exists ((|v_#memory_$Pointer$.offset_677| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_206| (Array Int (Array Int Int))) (|v_#memory_int_747| (Array Int (Array Int Int))) (|v_#memory_int_213| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_#valid_96| (Array Int Int)) (|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#length_59| (Array Int Int)) (|v_#memory_$Pointer$.base_677| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_BEFORE_CALL_73| (Array Int (Array Int Int)))) (let ((.cse7 (select (select |v_#memory_$Pointer$.base_207| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse8 (select (select |v_#memory_$Pointer$.offset_207| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse22 (select (select |v_#memory_$Pointer$.base_677| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse23 (+ 16 (select (select |v_#memory_$Pointer$.offset_677| |c_ULTIMATE.start_main_~user~0#1.base|) 40)))) (let ((.cse24 (store |v_#memory_$Pointer$.offset_677| .cse22 (store (select |v_#memory_$Pointer$.offset_677| .cse22) .cse23 40))) (.cse19 (store |v_#memory_$Pointer$.base_677| .cse22 (store (select |v_#memory_$Pointer$.base_677| .cse22) .cse23 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse15 (store |v_#memory_$Pointer$.offset_207| .cse7 (store (select |v_#memory_$Pointer$.offset_207| .cse7) .cse8 0))) (.cse18 (store |v_#memory_$Pointer$.base_207| .cse7 (store (select |v_#memory_$Pointer$.base_207| .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse17 (+ 40 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse4 (select (select |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse5 (+ 20 (select (select |v_#memory_$Pointer$.offset_208| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse11 (select (select |v_#memory_$Pointer$.base_206| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse12 (+ (select (select |v_#memory_$Pointer$.offset_206| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse13 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse14 (+ (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4))) (and (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_208| .cse4 (store (select |v_#memory_$Pointer$.offset_208| .cse4) .cse5 (select (select |v_#memory_$Pointer$.offset_207| .cse4) .cse5))) |v_#memory_$Pointer$.offset_207|) (= (let ((.cse6 (let ((.cse9 (let ((.cse10 (store |v_#memory_int_213| .cse13 (store (select |v_#memory_int_213| .cse13) .cse14 32)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 5))))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 40))))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 (select (select |v_#memory_int_212| .cse7) .cse8)))) |v_#memory_int_212|) (= (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_73| .cse16) .cse17))) |v_#memory_$Pointer$.offset_BEFORE_CALL_73|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| .cse16) .cse17)))) (= |v_#memory_$Pointer$.base_206| (store .cse19 .cse13 (store (select .cse19 .cse13) .cse14 (select (select |v_#memory_$Pointer$.base_206| .cse13) .cse14)))) (let ((.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse21 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_73| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| .cse20) .cse21) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_73| .cse20) .cse21) 0)))) (= (store |v_#memory_int_747| .cse22 (store (select |v_#memory_int_747| .cse22) .cse23 (select (select |v_#memory_int_213| .cse22) .cse23))) |v_#memory_int_213|) (= |c_#valid| (store |v_#valid_96| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (= |c_#length| (store |v_#length_59| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= (select |v_#valid_96| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (store |v_#memory_$Pointer$.base_208| .cse4 (store (select |v_#memory_$Pointer$.base_208| .cse4) .cse5 (select (select |v_#memory_$Pointer$.base_207| .cse4) .cse5))) |v_#memory_$Pointer$.base_207|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_206| .cse11 (store (select |v_#memory_$Pointer$.offset_206| .cse11) .cse12 (select (select |v_#memory_$Pointer$.offset_208| .cse11) .cse12))) |v_#memory_$Pointer$.offset_208|) (= (store |v_#memory_$Pointer$.base_206| .cse11 (store (select |v_#memory_$Pointer$.base_206| .cse11) .cse12 (select (select |v_#memory_$Pointer$.base_208| .cse11) .cse12))) |v_#memory_$Pointer$.base_208|) (= (store .cse24 .cse13 (store (select .cse24 .cse13) .cse14 (select (select |v_#memory_$Pointer$.offset_206| .cse13) .cse14))) |v_#memory_$Pointer$.offset_206|))))))) (and .cse3 (exists ((|v_#memory_$Pointer$.offset_677| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_206| (Array Int (Array Int Int))) (|v_#memory_int_747| (Array Int (Array Int Int))) (|v_#memory_int_213| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_#valid_96| (Array Int Int)) (|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#length_59| (Array Int Int)) (|v_#memory_$Pointer$.base_677| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int)))) (let ((.cse42 (select (select |v_#memory_$Pointer$.base_677| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse43 (+ 16 (select (select |v_#memory_$Pointer$.offset_677| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse28 (select (select |v_#memory_$Pointer$.base_207| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse29 (select (select |v_#memory_$Pointer$.offset_207| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (let ((.cse45 (store |v_#memory_$Pointer$.offset_207| .cse28 (store (select |v_#memory_$Pointer$.offset_207| .cse28) .cse29 0))) (.cse37 (store |v_#memory_$Pointer$.base_207| .cse28 (store (select |v_#memory_$Pointer$.base_207| .cse28) .cse29 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|))) (.cse44 (store |v_#memory_$Pointer$.offset_677| .cse42 (store (select |v_#memory_$Pointer$.offset_677| .cse42) .cse43 40))) (.cse36 (store |v_#memory_$Pointer$.base_677| .cse42 (store (select |v_#memory_$Pointer$.base_677| .cse42) .cse43 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse25 (select (select |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse26 (+ 20 (select (select |v_#memory_$Pointer$.offset_208| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse32 (select (select |v_#memory_$Pointer$.base_206| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse33 (+ (select (select |v_#memory_$Pointer$.offset_206| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse35 (+ (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4)) (.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse39 (+ 40 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) 40)))) (and (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_208| .cse25 (store (select |v_#memory_$Pointer$.offset_208| .cse25) .cse26 (select (select |v_#memory_$Pointer$.offset_207| .cse25) .cse26))) |v_#memory_$Pointer$.offset_207|) (= (let ((.cse27 (let ((.cse30 (let ((.cse31 (store |v_#memory_int_213| .cse34 (store (select |v_#memory_int_213| .cse34) .cse35 32)))) (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 5))))) (store .cse30 .cse25 (store (select .cse30 .cse25) .cse26 40))))) (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 (select (select |v_#memory_int_212| .cse28) .cse29)))) |v_#memory_int_212|) (= |v_#memory_$Pointer$.base_206| (store .cse36 .cse34 (store (select .cse36 .cse34) .cse35 (select (select |v_#memory_$Pointer$.base_206| .cse34) .cse35)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse38) .cse39)))) (let ((.cse40 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse41 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (or (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse40) .cse41) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse40) .cse41) 0)))) (= (store |v_#memory_int_747| .cse42 (store (select |v_#memory_int_747| .cse42) .cse43 (select (select |v_#memory_int_213| .cse42) .cse43))) |v_#memory_int_213|) (= |c_#valid| (store |v_#valid_96| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (= |c_#length| (store |v_#length_59| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= (select |v_#valid_96| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (store |v_#memory_$Pointer$.base_208| .cse25 (store (select |v_#memory_$Pointer$.base_208| .cse25) .cse26 (select (select |v_#memory_$Pointer$.base_207| .cse25) .cse26))) |v_#memory_$Pointer$.base_207|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_206| .cse32 (store (select |v_#memory_$Pointer$.offset_206| .cse32) .cse33 (select (select |v_#memory_$Pointer$.offset_208| .cse32) .cse33))) |v_#memory_$Pointer$.offset_208|) (= (store |v_#memory_$Pointer$.base_206| .cse32 (store (select |v_#memory_$Pointer$.base_206| .cse32) .cse33 (select (select |v_#memory_$Pointer$.base_208| .cse32) .cse33))) |v_#memory_$Pointer$.base_208|) (= (store .cse44 .cse34 (store (select .cse44 .cse34) .cse35 (select (select |v_#memory_$Pointer$.offset_206| .cse34) .cse35))) |v_#memory_$Pointer$.offset_206|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse45 .cse38 (store (select .cse45 .cse38) .cse39 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse38) .cse39))))))))))))) is different from false [2024-11-09 04:43:32,909 WARN L286 SmtUtils]: Spent 1.89m on a formula simplification that was a NOOP. DAG size: 279 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:44:18,837 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4409#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_38| Int)) (and (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_38| 0)) (or (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_38|) 4) 0)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_38|) 0) 0))))) (= ~count_int_int~0 1))' at error location [2024-11-09 04:44:18,837 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:44:18,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:44:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 04:44:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682649425] [2024-11-09 04:44:18,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:44:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:44:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:18,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:44:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1624, Unknown=130, NotChecked=348, Total=2256 [2024-11-09 04:44:18,841 INFO L87 Difference]: Start difference. First operand 213 states and 263 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 04:44:20,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:44:22,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:44:24,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:44:27,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:44:28,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:44:31,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:44:33,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:44:35,380 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 []