./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/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_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/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_d309843e-b71a-41ca-ab1e-2269658c5f0e/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 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:20:04,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:20:04,108 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:20:04,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:20:04,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:20:04,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:20:04,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:20:04,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:20:04,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:20:04,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:20:04,138 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:20:04,139 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:20:04,139 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:20:04,140 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:20:04,140 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:20:04,140 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:20:04,141 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:20:04,141 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:20:04,141 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:20:04,142 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:20:04,142 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:20:04,143 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:20:04,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:20:04,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:20:04,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:20:04,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:20:04,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:20:04,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:20:04,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:20:04,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:20:04,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:20:04,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:20:04,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:20:04,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:20:04,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:20:04,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:20:04,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:20:04,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:20:04,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:20:04,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:20:04,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:20:04,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:20:04,156 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:20:04,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:20:04,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:20:04,156 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:20:04,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:20:04,157 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_d309843e-b71a-41ca-ab1e-2269658c5f0e/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_d309843e-b71a-41ca-ab1e-2269658c5f0e/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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2024-11-09 01:20:04,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:20:04,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:20:04,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:20:04,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:20:04,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:20:04,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i Unable to find full path for "g++" [2024-11-09 01:20:06,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:20:06,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:20:06,907 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2024-11-09 01:20:06,926 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/data/71ee78235/1d1525e3aee8472dbb060b3ed62bf495/FLAGefa7c2826 [2024-11-09 01:20:06,941 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/data/71ee78235/1d1525e3aee8472dbb060b3ed62bf495 [2024-11-09 01:20:06,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:20:06,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:20:06,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:20:06,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:20:06,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:20:06,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:20:06" (1/1) ... [2024-11-09 01:20:06,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244c72b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:06, skipping insertion in model container [2024-11-09 01:20:06,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:20:06" (1/1) ... [2024-11-09 01:20:07,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:20:07,609 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_d309843e-b71a-41ca-ab1e-2269658c5f0e/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2024-11-09 01:20:07,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:20:07,821 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:20:07,859 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_d309843e-b71a-41ca-ab1e-2269658c5f0e/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2024-11-09 01:20:07,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:20:08,004 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:20:08,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08 WrapperNode [2024-11-09 01:20:08,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:20:08,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:20:08,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:20:08,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:20:08,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,182 INFO L138 Inliner]: procedures = 176, calls = 335, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1552 [2024-11-09 01:20:08,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:20:08,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:20:08,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:20:08,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:20:08,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:20:08,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:20:08,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:20:08,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:20:08,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (1/1) ... [2024-11-09 01:20:08,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:20:08,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:08,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:20:08,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:20:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:20:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 01:20:08,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 01:20:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:20:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 01:20:08,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 01:20:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:20:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:20:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:20:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:20:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:20:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:20:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:20:08,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:20:08,735 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:20:08,737 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:20:10,858 INFO L? ?]: Removed 391 outVars from TransFormulas that were not future-live. [2024-11-09 01:20:10,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:20:12,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:20:12,262 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 01:20:12,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:20:12 BoogieIcfgContainer [2024-11-09 01:20:12,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:20:12,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:20:12,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:20:12,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:20:12,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:20:06" (1/3) ... [2024-11-09 01:20:12,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205f36bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:20:12, skipping insertion in model container [2024-11-09 01:20:12,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:08" (2/3) ... [2024-11-09 01:20:12,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205f36bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:20:12, skipping insertion in model container [2024-11-09 01:20:12,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:20:12" (3/3) ... [2024-11-09 01:20:12,273 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2024-11-09 01:20:12,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:20:12,293 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:20:12,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:20:12,379 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;@1bbdb2df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:20:12,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:20:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 127 states have (on average 1.7165354330708662) internal successors, (218), 138 states have internal predecessors, (218), 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 01:20:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:20:12,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:12,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:12,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:12,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1204732263, now seen corresponding path program 1 times [2024-11-09 01:20:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:12,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951542902] [2024-11-09 01:20:12,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:12,626 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 01:20:12,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:12,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951542902] [2024-11-09 01:20:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951542902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:12,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:12,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:20:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585286784] [2024-11-09 01:20:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:12,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:20:12,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:12,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:20:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:20:12,676 INFO L87 Difference]: Start difference. First operand has 147 states, 127 states have (on average 1.7165354330708662) internal successors, (218), 138 states have internal predecessors, (218), 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 01:20:14,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:20:16,079 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 01:20:19,719 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 01:20:21,729 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 01:20: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 01:20:26,667 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 01:20:29,159 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 01:20:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:30,801 INFO L93 Difference]: Finished difference Result 404 states and 702 transitions. [2024-11-09 01:20:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:20:30,805 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 01:20:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:30,815 INFO L225 Difference]: With dead ends: 404 [2024-11-09 01:20:30,815 INFO L226 Difference]: Without dead ends: 256 [2024-11-09 01:20:30,818 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 01:20:30,821 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 118 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:30,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 354 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 6 Unknown, 0 Unchecked, 18.0s Time] [2024-11-09 01:20:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-09 01:20:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 147. [2024-11-09 01:20:30,866 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 01:20:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 188 transitions. [2024-11-09 01:20:30,870 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 188 transitions. Word has length 10 [2024-11-09 01:20:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:30,871 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 188 transitions. [2024-11-09 01:20:30,871 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 01:20:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 188 transitions. [2024-11-09 01:20:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 01:20:30,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:30,875 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 01:20:30,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:20:30,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:30,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 437069436, now seen corresponding path program 1 times [2024-11-09 01:20:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509899949] [2024-11-09 01:20:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:31,639 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 01:20:31,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509899949] [2024-11-09 01:20:31,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509899949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:31,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:20:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647450680] [2024-11-09 01:20:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:31,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:20:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:31,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:20:31,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:20:31,644 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 01:20:33,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:20:35,679 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 01:20:37,776 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 01:20:38,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:20:40,824 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 01:20:42,829 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 01:20:44,926 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 01:20:46,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:20:48,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:20:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:49,702 INFO L93 Difference]: Finished difference Result 307 states and 392 transitions. [2024-11-09 01:20:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:20:49,706 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 01:20:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:49,708 INFO L225 Difference]: With dead ends: 307 [2024-11-09 01:20:49,709 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 01:20:49,710 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 01:20:49,711 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:49,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 322 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 7 Unknown, 0 Unchecked, 18.0s Time] [2024-11-09 01:20:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 01:20:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-09 01:20:49,725 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 01:20:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2024-11-09 01:20:49,727 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 65 [2024-11-09 01:20:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:49,728 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2024-11-09 01:20:49,728 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 01:20:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2024-11-09 01:20:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 01:20:49,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:49,731 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 01:20:49,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:20:49,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:49,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1432826218, now seen corresponding path program 1 times [2024-11-09 01:20:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:49,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173038817] [2024-11-09 01:20:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:50,289 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 01:20:50,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:50,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173038817] [2024-11-09 01:20:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173038817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:20:50,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470005644] [2024-11-09 01:20:50,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:50,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:20:50,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:50,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:20:50,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:20:50,298 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 01:20:52,328 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 01:20:54,338 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 01:20:56,401 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 01:20:58,411 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 01:21:00,864 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 01:21:02,868 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 01:21:04,934 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 01:21:06,939 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 01:21:08,949 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 01:21:10,954 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 01:21:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:11,724 INFO L93 Difference]: Finished difference Result 359 states and 453 transitions. [2024-11-09 01:21:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:21:11,728 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 01:21:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:11,730 INFO L225 Difference]: With dead ends: 359 [2024-11-09 01:21:11,731 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 01:21:11,732 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 01:21:11,733 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 30 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:11,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 321 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 21.4s Time] [2024-11-09 01:21:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 01:21:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-09 01:21:11,766 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 01:21:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 267 transitions. [2024-11-09 01:21:11,769 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 267 transitions. Word has length 78 [2024-11-09 01:21:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:11,770 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 267 transitions. [2024-11-09 01:21:11,771 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 01:21:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 267 transitions. [2024-11-09 01:21:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 01:21:11,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:11,774 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 01:21:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:21:11,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1927488700, now seen corresponding path program 1 times [2024-11-09 01:21:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:11,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978683218] [2024-11-09 01:21:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:12,402 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 01:21:12,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:12,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978683218] [2024-11-09 01:21:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978683218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:21:12,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529316433] [2024-11-09 01:21:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:21:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:21:12,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:21:12,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:21:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:12,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:21:12,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:13,195 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 01:21:13,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:21:13,451 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 01:21:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529316433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:21:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1609642386] [2024-11-09 01:21:13,478 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2024-11-09 01:21:13,478 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:21:13,482 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:21:13,488 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:21:13,489 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:21:19,850 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 121 for LOIs [2024-11-09 01:21:19,888 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:21:32,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1609642386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:32,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:21:32,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4, 4, 4] total 17 [2024-11-09 01:21:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684138141] [2024-11-09 01:21:32,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:32,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:21:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:32,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:21:32,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=183, Unknown=6, NotChecked=0, Total=272 [2024-11-09 01:21:32,931 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 01:21:35,020 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 01:21:37,260 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 01:21:39,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:41,642 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 01:21:43,833 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 01:21:46,055 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 01:21:48,325 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 01:21:50,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:52,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:54,596 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 01:21:56,674 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 01:21:58,853 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 01:22:00,914 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 01:22:03,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:22:08,461 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 01:22:10,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:22:12,471 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 01:22:14,475 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 01:22:16,480 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 01:22:18,485 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 01:22:20,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:22:22,496 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 01:22:24,505 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 01:22:26,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:22:29,406 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 01:22:31,410 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 01:22:32,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:22:36,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 01:22:38,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=true, quantifiers [0] [2024-11-09 01:22:39,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 01:22:43,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:22:45,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:22:47,354 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 01:22:48,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:22:51,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 01:22:56,218 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 01:22:58,226 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 01:22:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:22:58,229 INFO L93 Difference]: Finished difference Result 422 states and 527 transitions. [2024-11-09 01:22:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:22:58,233 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 01:22:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:22:58,235 INFO L225 Difference]: With dead ends: 422 [2024-11-09 01:22:58,236 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 01:22:58,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=92, Invalid=208, Unknown=6, NotChecked=0, Total=306 [2024-11-09 01:22:58,239 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 10 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 2 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:22:58,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 994 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 503 Invalid, 32 Unknown, 0 Unchecked, 84.7s Time] [2024-11-09 01:22:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 01:22:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-09 01:22:58,289 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 01:22:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 263 transitions. [2024-11-09 01:22:58,295 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 263 transitions. Word has length 91 [2024-11-09 01:22:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:22:58,296 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 263 transitions. [2024-11-09 01:22:58,298 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 01:22:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 263 transitions. [2024-11-09 01:22:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 01:22:58,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:58,301 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 01:22:58,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:22:58,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:22:58,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:58,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1259823294, now seen corresponding path program 1 times [2024-11-09 01:22:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:22:58,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996040675] [2024-11-09 01:22:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:22:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:59,084 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 01:22:59,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:22:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996040675] [2024-11-09 01:22:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996040675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:22:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965927912] [2024-11-09 01:22:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:22:59,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:22:59,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:22:59,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:22:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:59,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:22:59,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:00,133 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 01:23:00,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:00,538 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 01:23:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965927912] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:23:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [988058992] [2024-11-09 01:23:00,543 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2024-11-09 01:23:00,543 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:23:00,543 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:23:00,544 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:23:00,544 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:24:04,417 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2024-11-09 01:24:04,437 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 149 for LOIs [2024-11-09 01:24:04,603 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:24:10,567 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 32)) (.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 36)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 28))) (and (exists ((|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_585| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_585| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_585| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.base_96|) (= (store |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse1 .cse2 |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|)))) (exists ((|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_585| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_585| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_585| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse4 .cse0))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse4 .cse2 |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_int_105| (Array Int (Array Int Int))) (|v_#memory_int_682| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |c_#memory_int| (store |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse5 .cse3 4))) (= (store |v_#memory_int_682| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_682| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse2 (select .cse5 .cse2))) |v_#memory_int_105|)))))) is different from true [2024-11-09 01:24:10,597 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 36)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 28)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 12)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 32)) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 16))) (and (exists ((|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_585| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_586| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse4 (select |v_#memory_$Pointer$.offset_586| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_585| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_585| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse1 .cse2 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse3 (select .cse4 .cse3))) |v_#memory_$Pointer$.offset_586|) (= (store |v_#memory_$Pointer$.offset_586| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse4 .cse5 0) .cse6 0)) |c_#memory_$Pointer$.offset|)))) (exists ((|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_586| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_585| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse7 (select |v_#memory_$Pointer$.base_586| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_586| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse7 .cse5 0) .cse6 0))) (= (store |v_#memory_$Pointer$.base_585| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_585| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse8 .cse0))) |v_#memory_$Pointer$.base_96|) (= (store |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse8 .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select .cse7 .cse3))) |v_#memory_$Pointer$.base_586|)))) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_682| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse10 (select |v_#memory_int_197| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_682| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_682| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse2 (select .cse9 .cse2))) |v_#memory_int_105|) (= |c_#memory_int| (store |v_#memory_int_197| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse10 .cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (= (store |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse9 .cse3 4) .cse5 (select .cse10 .cse5))) |v_#memory_int_197|)))))) is different from true [2024-11-09 01:24:21,881 WARN L286 SmtUtils]: Spent 5.04s 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 01:24:28,698 WARN L286 SmtUtils]: Spent 5.57s 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 01:24:30,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse24 (exists ((|v_#Ultimate.C_memset_#t~loopctr309_39| Int)) (and (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr309_39| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr309_39|))))) (or (and (exists ((|v_#memory_$Pointer$.offset_588| (Array Int (Array Int Int))) (|v_#valid_86| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_#length_62| (Array Int Int)) (|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_BEFORE_CALL_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_183| (Array Int (Array Int Int))) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_588| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (|v_#memory_int_685| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse17 (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse4 (select (select |v_#memory_$Pointer$.base_588| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse5 (+ 16 (select (select |v_#memory_$Pointer$.offset_588| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)))) (let ((.cse21 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse22 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_79| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse20 (store |v_#memory_$Pointer$.offset_588| .cse4 (store (select |v_#memory_$Pointer$.offset_588| .cse4) .cse5 .cse23))) (.cse8 (store |v_#memory_$Pointer$.base_588| .cse4 (store (select |v_#memory_$Pointer$.base_588| .cse4) .cse5 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse0 (store |v_#memory_$Pointer$.offset_184| .cse16 (store (select |v_#memory_$Pointer$.offset_184| .cse16) .cse17 0))) (.cse11 (store |v_#memory_$Pointer$.base_184| .cse16 (store (select |v_#memory_$Pointer$.base_184| .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|)))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse2 (+ 40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse23))) (.cse6 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse7 (+ 8 (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23))) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse10 (+ (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse23) 4)) (.cse12 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse13 (+ 20 (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23))) (.cse3 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_79| .cse21) .cse22)) (.cse14 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| .cse21) .cse22))) (and (= (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_79| .cse1) .cse2))) |v_#memory_$Pointer$.offset_BEFORE_CALL_79|) (= .cse3 |c_ULTIMATE.start_main_#t~mem63#1.offset|) (= (store |v_#memory_int_685| .cse4 (store (select |v_#memory_int_685| .cse4) .cse5 (select (select |v_#memory_int_198| .cse4) .cse5))) |v_#memory_int_198|) (= (store |v_#memory_$Pointer$.base_183| .cse6 (store (select |v_#memory_$Pointer$.base_183| .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_185| .cse6) .cse7))) |v_#memory_$Pointer$.base_185|) (= (select |v_#valid_86| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 (select (select |v_#memory_$Pointer$.base_183| .cse9) .cse10))) |v_#memory_$Pointer$.base_183|) (= (store .cse11 .cse1 (store (select .cse11 .cse1) .cse2 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| .cse1) .cse2))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_47|) (= |v_#memory_$Pointer$.offset_185| (store |v_#memory_$Pointer$.offset_183| .cse6 (store (select |v_#memory_$Pointer$.offset_183| .cse6) .cse7 (select (select |v_#memory_$Pointer$.offset_185| .cse6) .cse7)))) (= (store |v_#memory_$Pointer$.base_185| .cse12 (store (select |v_#memory_$Pointer$.base_185| .cse12) .cse13 (select (select |v_#memory_$Pointer$.base_184| .cse12) .cse13))) |v_#memory_$Pointer$.base_184|) (= |c_ULTIMATE.start_main_#t~mem63#1.base| .cse14) (= |c_#valid| (store |v_#valid_86| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (= (let ((.cse15 (let ((.cse18 (let ((.cse19 (store |v_#memory_int_198| .cse9 (store (select |v_#memory_int_198| .cse9) .cse10 32)))) (store .cse19 .cse6 (store (select .cse19 .cse6) .cse7 5))))) (store .cse18 .cse12 (store (select .cse18 .cse12) .cse13 8))))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 (select (select |v_#memory_int_199| .cse16) .cse17)))) |v_#memory_int_199|) (= (store .cse20 .cse9 (store (select .cse20 .cse9) .cse10 (select (select |v_#memory_$Pointer$.offset_183| .cse9) .cse10))) |v_#memory_$Pointer$.offset_183|) (= (store |v_#memory_$Pointer$.offset_185| .cse12 (store (select |v_#memory_$Pointer$.offset_185| .cse12) .cse13 (select (select |v_#memory_$Pointer$.offset_184| .cse12) .cse13))) |v_#memory_$Pointer$.offset_184|) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_62| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384)) (or (not (= .cse3 0)) (not (= .cse14 0)))))))) .cse24) (and (exists ((|v_#memory_$Pointer$.offset_588| (Array Int (Array Int Int))) (|v_#valid_86| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_#length_62| (Array Int Int)) (|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_183| (Array Int (Array Int Int))) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_588| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (|v_#memory_int_685| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_48| (Array Int (Array Int Int)))) (let ((.cse39 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse40 (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse26 (select (select |v_#memory_$Pointer$.base_588| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse27 (+ 16 (select (select |v_#memory_$Pointer$.offset_588| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)))) (let ((.cse46 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse47 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_48| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse45 (store |v_#memory_$Pointer$.offset_588| .cse26 (store (select |v_#memory_$Pointer$.offset_588| .cse26) .cse27 .cse23))) (.cse33 (store |v_#memory_$Pointer$.base_588| .cse26 (store (select |v_#memory_$Pointer$.base_588| .cse26) .cse27 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse44 (store |v_#memory_$Pointer$.offset_184| .cse39 (store (select |v_#memory_$Pointer$.offset_184| .cse39) .cse40 0))) (.cse30 (store |v_#memory_$Pointer$.base_184| .cse39 (store (select |v_#memory_$Pointer$.base_184| .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|)))) (let ((.cse28 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse29 (+ 8 (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23))) (.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse32 (+ 40 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) .cse23))) (.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse35 (+ (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse23) 4)) (.cse36 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23)) (.cse37 (+ 20 (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) .cse23))) (.cse43 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_48| .cse46) .cse47)) (.cse25 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| .cse46) .cse47))) (and (= |c_ULTIMATE.start_main_#t~mem63#1.base| .cse25) (= (store |v_#memory_int_685| .cse26 (store (select |v_#memory_int_685| .cse26) .cse27 (select (select |v_#memory_int_198| .cse26) .cse27))) |v_#memory_int_198|) (= (store |v_#memory_$Pointer$.base_183| .cse28 (store (select |v_#memory_$Pointer$.base_183| .cse28) .cse29 (select (select |v_#memory_$Pointer$.base_185| .cse28) .cse29))) |v_#memory_$Pointer$.base_185|) (= (select |v_#valid_86| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| .cse31) .cse32))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_48|) (= (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 (select (select |v_#memory_$Pointer$.base_183| .cse34) .cse35))) |v_#memory_$Pointer$.base_183|) (= |v_#memory_$Pointer$.offset_185| (store |v_#memory_$Pointer$.offset_183| .cse28 (store (select |v_#memory_$Pointer$.offset_183| .cse28) .cse29 (select (select |v_#memory_$Pointer$.offset_185| .cse28) .cse29)))) (= (store |v_#memory_$Pointer$.base_185| .cse36 (store (select |v_#memory_$Pointer$.base_185| .cse36) .cse37 (select (select |v_#memory_$Pointer$.base_184| .cse36) .cse37))) |v_#memory_$Pointer$.base_184|) (= |c_#valid| (store |v_#valid_86| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (= (let ((.cse38 (let ((.cse41 (let ((.cse42 (store |v_#memory_int_198| .cse34 (store (select |v_#memory_int_198| .cse34) .cse35 32)))) (store .cse42 .cse28 (store (select .cse42 .cse28) .cse29 5))))) (store .cse41 .cse36 (store (select .cse41 .cse36) .cse37 8))))) (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 (select (select |v_#memory_int_199| .cse39) .cse40)))) |v_#memory_int_199|) (= |c_ULTIMATE.start_main_#t~mem63#1.offset| .cse43) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_48| (store .cse44 .cse31 (store (select .cse44 .cse31) .cse32 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_48| .cse31) .cse32)))) (= (store .cse45 .cse34 (store (select .cse45 .cse34) .cse35 (select (select |v_#memory_$Pointer$.offset_183| .cse34) .cse35))) |v_#memory_$Pointer$.offset_183|) (= (store |v_#memory_$Pointer$.offset_185| .cse36 (store (select |v_#memory_$Pointer$.offset_185| .cse36) .cse37 (select (select |v_#memory_$Pointer$.offset_184| .cse36) .cse37))) |v_#memory_$Pointer$.offset_184|) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_62| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384)) (or (not (= .cse43 0)) (not (= .cse25 0)))))))) .cse24))) is different from false [2024-11-09 01:24:56,631 WARN L286 SmtUtils]: Spent 6.37s 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 01:25:08,745 WARN L286 SmtUtils]: Spent 7.82s 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 01:26:26,773 WARN L286 SmtUtils]: Spent 31.38s 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 01:27:44,985 WARN L286 SmtUtils]: Spent 28.10s on a formula simplification that was a NOOP. DAG size: 212 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:29:28,017 WARN L286 SmtUtils]: Spent 41.12s 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 01:31:52,155 WARN L286 SmtUtils]: Spent 1.23m on a formula simplification that was a NOOP. DAG size: 248 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:31:54,178 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~count_int_int~0 0) (exists ((|v_#memory_int_679| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_582| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_582| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_582| |c_ULTIMATE.start_main_~altusers~0#1.base|) 40)) (.cse2 (+ (select (select |v_#memory_$Pointer$.offset_582| |c_ULTIMATE.start_main_~altusers~0#1.base|) 40) 12))) (and (= (store |v_#memory_int_679| .cse0 (let ((.cse1 (select |v_#memory_int_679| .cse0))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_#memory_int|) (= (store |v_#memory_$Pointer$.offset_582| .cse0 (store (select |v_#memory_$Pointer$.offset_582| .cse0) .cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_582| .cse0 (store (select |v_#memory_$Pointer$.base_582| .cse0) .cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2))))))) (= |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) (let ((.cse8 (mod |c_ULTIMATE.start_main_~_ha_hashv~1#1| 4294967296)) (.cse7 (mod (+ (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~altusers~0#1.base|) 40)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~altusers~0#1.base|) 40) 4)) 4294967295) 4294967296))) (let ((.cse4 (= .cse7 0)) (.cse3 (= .cse8 0))) (or (and (or .cse3 .cse4) (= |c_ULTIMATE.start_main_~_ha_bkt~1#1| 0)) (and (not .cse4) (let ((.cse5 (= .cse8 .cse7))) (or (and .cse5 (= |c_ULTIMATE.start_main_~_ha_hashv~1#1| |c_ULTIMATE.start_main_~_ha_bkt~1#1|)) (let ((.cse6 (mod |c_ULTIMATE.start_main_~_ha_bkt~1#1| 4294967296))) (and (<= .cse6 .cse7) (<= .cse6 .cse8) (not .cse5))))) (not .cse3))))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse30 (exists ((|v_#Ultimate.C_memset_#t~loopctr309_39| Int)) (and (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr309_39| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr309_39|))))) (or (and (exists ((|v_#memory_int_678| (Array Int (Array Int Int))) (|v_#valid_83| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_#memory_$Pointer$.base_581| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#length_59| (Array Int Int)) (|v_#memory_$Pointer$.offset_581| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_178| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_BEFORE_CALL_73| (Array Int (Array Int Int)))) (let ((.cse14 (select (select |v_#memory_$Pointer$.base_179| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse15 (select (select |v_#memory_$Pointer$.offset_179| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse27 (select (select |v_#memory_$Pointer$.base_581| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse28 (+ (select (select |v_#memory_$Pointer$.offset_581| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 16))) (let ((.cse22 (store |v_#memory_$Pointer$.offset_581| .cse27 (store (select |v_#memory_$Pointer$.offset_581| .cse27) .cse28 40))) (.cse29 (store |v_#memory_$Pointer$.base_581| .cse27 (store (select |v_#memory_$Pointer$.base_581| .cse27) .cse28 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse23 (store |v_#memory_$Pointer$.offset_179| .cse14 (store (select |v_#memory_$Pointer$.offset_179| .cse14) .cse15 0))) (.cse26 (store |v_#memory_$Pointer$.base_179| .cse14 (store (select |v_#memory_$Pointer$.base_179| .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse9 (select (select |v_#memory_$Pointer$.base_178| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse10 (+ (select (select |v_#memory_$Pointer$.offset_178| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse11 (select (select |v_#memory_$Pointer$.base_180| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse12 (+ (select (select |v_#memory_$Pointer$.offset_180| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse25 (+ 40 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse18 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse19 (+ (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4))) (and (= (select |v_#valid_83| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_178| .cse9 (store (select |v_#memory_$Pointer$.offset_178| .cse9) .cse10 (select (select |v_#memory_$Pointer$.offset_180| .cse9) .cse10))) |v_#memory_$Pointer$.offset_180|) (= (store |v_#memory_$Pointer$.offset_180| .cse11 (store (select |v_#memory_$Pointer$.offset_180| .cse11) .cse12 (select (select |v_#memory_$Pointer$.offset_179| .cse11) .cse12))) |v_#memory_$Pointer$.offset_179|) (= (store |v_#memory_$Pointer$.base_178| .cse9 (store (select |v_#memory_$Pointer$.base_178| .cse9) .cse10 (select (select |v_#memory_$Pointer$.base_180| .cse9) .cse10))) |v_#memory_$Pointer$.base_180|) (= (let ((.cse13 (let ((.cse16 (let ((.cse17 (store |v_#memory_int_196| .cse18 (store (select |v_#memory_int_196| .cse18) .cse19 32)))) (store .cse17 .cse9 (store (select .cse17 .cse9) .cse10 5))))) (store .cse16 .cse11 (store (select .cse16 .cse11) .cse12 40))))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 (select (select |v_#memory_int_195| .cse14) .cse15)))) |v_#memory_int_195|) (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 .cse22 .cse18 (store (select .cse22 .cse18) .cse19 (select (select |v_#memory_$Pointer$.offset_178| .cse18) .cse19))) |v_#memory_$Pointer$.offset_178|) (= |c_#length| (store |v_#length_59| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_180| .cse11 (store (select |v_#memory_$Pointer$.base_180| .cse11) .cse12 (select (select |v_#memory_$Pointer$.base_179| .cse11) .cse12))) |v_#memory_$Pointer$.base_179|) (= (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_73| .cse24) .cse25))) |v_#memory_$Pointer$.offset_BEFORE_CALL_73|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (store .cse26 .cse24 (store (select .cse26 .cse24) .cse25 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| .cse24) .cse25)))) (= (store |v_#memory_int_678| .cse27 (store (select |v_#memory_int_678| .cse27) .cse28 (select (select |v_#memory_int_196| .cse27) .cse28))) |v_#memory_int_196|) (= |c_#valid| (store |v_#valid_83| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (= (store .cse29 .cse18 (store (select .cse29 .cse18) .cse19 (select (select |v_#memory_$Pointer$.base_178| .cse18) .cse19))) |v_#memory_$Pointer$.base_178|)))))) .cse30) (and (exists ((|v_#memory_int_678| (Array Int (Array Int Int))) (|v_#valid_83| (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_#memory_$Pointer$.base_581| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_#length_59| (Array Int Int)) (|v_#memory_$Pointer$.offset_581| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_178| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_179| (Array Int (Array Int Int)))) (let ((.cse42 (select (select |v_#memory_$Pointer$.base_179| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse43 (select (select |v_#memory_$Pointer$.offset_179| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse49 (select (select |v_#memory_$Pointer$.base_581| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse50 (+ (select (select |v_#memory_$Pointer$.offset_581| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 16))) (let ((.cse48 (store |v_#memory_$Pointer$.offset_581| .cse49 (store (select |v_#memory_$Pointer$.offset_581| .cse49) .cse50 40))) (.cse51 (store |v_#memory_$Pointer$.base_581| .cse49 (store (select |v_#memory_$Pointer$.base_581| .cse49) .cse50 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse31 (store |v_#memory_$Pointer$.offset_179| .cse42 (store (select |v_#memory_$Pointer$.offset_179| .cse42) .cse43 0))) (.cse36 (store |v_#memory_$Pointer$.base_179| .cse42 (store (select |v_#memory_$Pointer$.base_179| .cse42) .cse43 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse32 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse33 (+ 40 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse34 (select (select |v_#memory_$Pointer$.base_178| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse35 (+ (select (select |v_#memory_$Pointer$.offset_178| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse37 (select (select |v_#memory_$Pointer$.base_180| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse38 (+ (select (select |v_#memory_$Pointer$.offset_180| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse46 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse47 (+ (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4))) (and (= (select |v_#valid_83| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse32) .cse33)))) (= (store |v_#memory_$Pointer$.offset_178| .cse34 (store (select |v_#memory_$Pointer$.offset_178| .cse34) .cse35 (select (select |v_#memory_$Pointer$.offset_180| .cse34) .cse35))) |v_#memory_$Pointer$.offset_180|) (= (store .cse36 .cse32 (store (select .cse36 .cse32) .cse33 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse32) .cse33))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_43|) (= (store |v_#memory_$Pointer$.offset_180| .cse37 (store (select |v_#memory_$Pointer$.offset_180| .cse37) .cse38 (select (select |v_#memory_$Pointer$.offset_179| .cse37) .cse38))) |v_#memory_$Pointer$.offset_179|) (let ((.cse39 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse40 (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| .cse39) .cse40) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse39) .cse40) 0)))) (= (store |v_#memory_$Pointer$.base_178| .cse34 (store (select |v_#memory_$Pointer$.base_178| .cse34) .cse35 (select (select |v_#memory_$Pointer$.base_180| .cse34) .cse35))) |v_#memory_$Pointer$.base_180|) (= (let ((.cse41 (let ((.cse44 (let ((.cse45 (store |v_#memory_int_196| .cse46 (store (select |v_#memory_int_196| .cse46) .cse47 32)))) (store .cse45 .cse34 (store (select .cse45 .cse34) .cse35 5))))) (store .cse44 .cse37 (store (select .cse44 .cse37) .cse38 40))))) (store .cse41 .cse42 (store (select .cse41 .cse42) .cse43 (select (select |v_#memory_int_195| .cse42) .cse43)))) |v_#memory_int_195|) (= (store .cse48 .cse46 (store (select .cse48 .cse46) .cse47 (select (select |v_#memory_$Pointer$.offset_178| .cse46) .cse47))) |v_#memory_$Pointer$.offset_178|) (= |c_#length| (store |v_#length_59| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_180| .cse37 (store (select |v_#memory_$Pointer$.base_180| .cse37) .cse38 (select (select |v_#memory_$Pointer$.base_179| .cse37) .cse38))) |v_#memory_$Pointer$.base_179|) (= (store |v_#memory_int_678| .cse49 (store (select |v_#memory_int_678| .cse49) .cse50 (select (select |v_#memory_int_196| .cse49) .cse50))) |v_#memory_int_196|) (= |c_#valid| (store |v_#valid_83| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (= (store .cse51 .cse46 (store (select .cse51 .cse46) .cse47 (select (select |v_#memory_$Pointer$.base_178| .cse46) .cse47))) |v_#memory_$Pointer$.base_178|)))))) .cse30))) (= |c_ULTIMATE.start_main_~altusers~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|)) is different from false [2024-11-09 01:32:38,956 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4346#(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 01:32:38,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:32:38,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:32:38,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-09 01:32:38,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124594306] [2024-11-09 01:32:38,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:32:38,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:38,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:32:38,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:38,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1561, Unknown=110, NotChecked=340, Total=2162 [2024-11-09 01:32:38,963 INFO L87 Difference]: Start difference. First operand 213 states and 263 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 01:32:41,011 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 01:32:43,108 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 01:32:45,126 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 01:32:48,425 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 01:32:50,434 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 01:32:52,492 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 01:32:54,503 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 01:32:56,519 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 01:32:58,524 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 01:33:00,641 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 01:33:02,656 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 01:33:04,663 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 01:33:06,671 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 01:33:08,750 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 01:33:10,761 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 01:33:12,769 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 01:33:14,786 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 01:33:16,797 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 01:33:18,801 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 01:33:20,882 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 01:33:22,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 01:33:24,894 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 01:33:26,903 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 01:33:28,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:33:30,949 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 01:33:33,041 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 01:33:35,047 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 01:33:37,054 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 01:33:39,057 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 01:33:41,069 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 01:33:43,075 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 01:33:45,081 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 01:33:47,090 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 01:33:50,765 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 01:33:53,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 01:33:55,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 01:33:57,140 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 [] [2024-11-09 01:33:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:57,185 INFO L93 Difference]: Finished difference Result 503 states and 624 transitions. [2024-11-09 01:33:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:57,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-11-09 01:33:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:57,190 INFO L225 Difference]: With dead ends: 503 [2024-11-09 01:33:57,190 INFO L226 Difference]: Without dead ends: 473 [2024-11-09 01:33:57,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 514.4s TimeCoverageRelationStatistics Valid=151, Invalid=1561, Unknown=110, NotChecked=340, Total=2162 [2024-11-09 01:33:57,195 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 476 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:57,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 550 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 35 Unknown, 0 Unchecked, 78.2s Time] [2024-11-09 01:33:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-09 01:33:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2024-11-09 01:33:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 436 states have (on average 1.1490825688073394) internal successors, (501), 445 states have internal predecessors, (501), 34 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 01:33:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 569 transitions. [2024-11-09 01:33:57,243 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 569 transitions. Word has length 92 [2024-11-09 01:33:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:57,244 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 569 transitions. [2024-11-09 01:33:57,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 01:33:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 569 transitions. [2024-11-09 01:33:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-09 01:33:57,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:57,251 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:33:57,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:33:57,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:33:57,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1906645289, now seen corresponding path program 1 times [2024-11-09 01:33:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:33:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336352314] [2024-11-09 01:33:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 01:34:00,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:34:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336352314] [2024-11-09 01:34:00,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336352314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:34:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782741896] [2024-11-09 01:34:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:00,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:34:00,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:34:00,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d309843e-b71a-41ca-ab1e-2269658c5f0e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:34:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:01,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 2204 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:34:01,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 01:34:03,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:34:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 01:34:04,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782741896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:34:04,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658906451] [2024-11-09 01:34:04,814 INFO L159 IcfgInterpreter]: Started Sifa with 86 locations of interest [2024-11-09 01:34:04,814 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:34:04,817 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:34:04,817 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:34:04,817 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:35:03,757 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2024-11-09 01:35:03,780 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 133 for LOIs [2024-11-09 01:35:04,047 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:35:08,536 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 36)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 28)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 32))) (and (exists ((|v_#memory_$Pointer$.offset_788| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_788| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_788| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse1 .cse2 |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_788| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_$Pointer$.base_96| |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 .cse4 .cse2 |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|) (= (store |v_#memory_$Pointer$.base_788| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_788| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 (select .cse4 .cse0))) |v_#memory_$Pointer$.base_96|)))) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_929| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_929| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_929| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse2 (select .cse5 .cse2))) |v_#memory_int_105|) (= |c_#memory_int| (store |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse5 .cse3 4)))))))) is different from true [2024-11-09 01:35:08,594 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 36)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 28)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 12)) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 32)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 16))) (and (exists ((|v_#memory_$Pointer$.offset_788| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_791| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_$Pointer$.offset_791| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse3 (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_791| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse0 .cse1 0) .cse2 0)) |c_#memory_$Pointer$.offset|) (= |v_#memory_$Pointer$.offset_791| (store |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse3 .cse4 |c_ULTIMATE.start_main_~user~0#1.offset|) .cse5 (select .cse0 .cse5)))) (= (store |v_#memory_$Pointer$.offset_788| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_788| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6 (select .cse3 .cse6))) |v_#memory_$Pointer$.offset_96|)))) (exists ((|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_788| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_791| (Array Int (Array Int Int)))) (let ((.cse7 (select |v_#memory_$Pointer$.base_791| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse8 (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_791| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse7 .cse1 0) .cse2 0)) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_791| (store |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse8 .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5 (select .cse7 .cse5)))) (= (store |v_#memory_$Pointer$.base_788| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_788| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6 (select .cse8 .cse6))) |v_#memory_$Pointer$.base_96|)))) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_929| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse10 (select |v_#memory_int_197| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_929| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_929| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse4 (select .cse9 .cse4))) |v_#memory_int_105|) (= |c_#memory_int| (store |v_#memory_int_197| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse10 .cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (= (store |v_#memory_int_105| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse9 .cse5 4) .cse1 (select .cse10 .cse1))) |v_#memory_int_197|)))))) is different from true