./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:20:23,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:20:23,715 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-23 21:20:23,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:20:23,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:20:23,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:20:23,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:20:23,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:20:23,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:20:23,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:20:23,752 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:20:23,753 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:20:23,753 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:20:23,754 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:20:23,754 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:20:23,755 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:20:23,756 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:20:23,756 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:20:23,757 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:20:23,757 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:20:23,758 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:20:23,759 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:20:23,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:20:23,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:20:23,760 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:20:23,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:20:23,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:20:23,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:20:23,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:20:23,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:20:23,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:20:23,764 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-23 21:20:23,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:20:23,764 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:20:23,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:20:23,765 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:20:23,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:20:23,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:20:23,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:20:23,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:20:23,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:20:23,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:20:23,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:20:23,769 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:20:23,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:20:23,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:20:23,771 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:20:23,771 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:20:23,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:20:23,772 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_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/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_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire 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 ! overflow) ) 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2023-11-23 21:20:24,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:20:24,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:20:24,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:20:24,124 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:20:24,124 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:20:24,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2023-11-23 21:20:27,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:20:27,648 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:20:27,649 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2023-11-23 21:20:27,668 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/data/f03b7774b/bc2eb31c83434a82afd0dbb4b910b217/FLAGde2f96895 [2023-11-23 21:20:27,682 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/data/f03b7774b/bc2eb31c83434a82afd0dbb4b910b217 [2023-11-23 21:20:27,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:20:27,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:20:27,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:20:27,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:20:27,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:20:27,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:27" (1/1) ... [2023-11-23 21:20:27,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74478692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:27, skipping insertion in model container [2023-11-23 21:20:27,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:27" (1/1) ... [2023-11-23 21:20:27,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:20:28,061 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-23 21:20:28,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:20:28,366 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:20:28,397 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-23 21:20:28,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:20:28,570 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:20:28,577 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:20:28,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28 WrapperNode [2023-11-23 21:20:28,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:20:28,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:20:28,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:20:28,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:20:28,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,732 INFO L138 Inliner]: procedures = 178, calls = 229, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 925 [2023-11-23 21:20:28,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:20:28,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:20:28,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:20:28,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:20:28,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:20:28,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:20:28,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:20:28,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:20:28,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (1/1) ... [2023-11-23 21:20:28,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:20:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:20:28,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:20:28,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:20:28,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:20:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:20:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-23 21:20:28,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-23 21:20:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:20:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:20:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:20:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 21:20:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:20:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:20:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:20:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:20:28,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:20:29,170 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:20:29,173 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:20:30,391 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:20:31,459 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:20:31,460 INFO L309 CfgBuilder]: Removed 40 assume(true) statements. [2023-11-23 21:20:31,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:31 BoogieIcfgContainer [2023-11-23 21:20:31,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:20:31,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:20:31,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:20:31,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:20:31,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:20:27" (1/3) ... [2023-11-23 21:20:31,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b397e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:31, skipping insertion in model container [2023-11-23 21:20:31,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:28" (2/3) ... [2023-11-23 21:20:31,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b397e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:31, skipping insertion in model container [2023-11-23 21:20:31,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:31" (3/3) ... [2023-11-23 21:20:31,476 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-2.i [2023-11-23 21:20:31,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:20:31,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-23 21:20:31,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:20:31,571 INFO L357 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, mHoare=true, 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;@21b6a443, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:20:31,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-23 21:20:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 74 states have (on average 1.7432432432432432) internal successors, (129), 80 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:20:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-23 21:20:31,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:31,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-23 21:20:31,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-23 21:20:31,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash 949494, now seen corresponding path program 1 times [2023-11-23 21:20:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158144772] [2023-11-23 21:20:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:32,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:20:32,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158144772] [2023-11-23 21:20:32,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158144772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:20:32,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:20:32,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:20:32,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656753704] [2023-11-23 21:20:32,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:20:32,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:20:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:20:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:20:32,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:20:32,121 INFO L87 Difference]: Start difference. First operand has 85 states, 74 states have (on average 1.7432432432432432) internal successors, (129), 80 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:20:34,288 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 [] [2023-11-23 21:20:36,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:20:38,308 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 [] [2023-11-23 21:20:40,321 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 [] [2023-11-23 21:20:42,325 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 [] [2023-11-23 21:20:44,330 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 [] [2023-11-23 21:20:46,766 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 [] [2023-11-23 21:20:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:20:46,974 INFO L93 Difference]: Finished difference Result 173 states and 275 transitions. [2023-11-23 21:20:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:20:46,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-23 21:20:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:20:46,991 INFO L225 Difference]: With dead ends: 173 [2023-11-23 21:20:46,991 INFO L226 Difference]: Without dead ends: 73 [2023-11-23 21:20:46,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:20:46,998 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 75 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2023-11-23 21:20:46,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 132 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 6 Unknown, 0 Unchecked, 14.8s Time] [2023-11-23 21:20:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-23 21:20:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2023-11-23 21:20:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:20:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-11-23 21:20:47,056 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 3 [2023-11-23 21:20:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:20:47,057 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-11-23 21:20:47,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:20:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-11-23 21:20:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-23 21:20:47,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:47,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-23 21:20:47,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:20:47,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-23 21:20:47,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash 29434373, now seen corresponding path program 1 times [2023-11-23 21:20:47,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:47,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328661432] [2023-11-23 21:20:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:47,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:20:47,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328661432] [2023-11-23 21:20:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328661432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:20:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:20:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:20:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390628203] [2023-11-23 21:20:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:20:47,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:20:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:20:47,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:20:47,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:20:47,229 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:20:49,297 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 [] [2023-11-23 21:20:51,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:20:53,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:20:55,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-23 21:20:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:20:55,212 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2023-11-23 21:20:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:20:55,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-23 21:20:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:20:55,228 INFO L225 Difference]: With dead ends: 143 [2023-11-23 21:20:55,228 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 21:20:55,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:20:55,231 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 58 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:20:55,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 75 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2023-11-23 21:20:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 21:20:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2023-11-23 21:20:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:20:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-11-23 21:20:55,249 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 4 [2023-11-23 21:20:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:20:55,250 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-11-23 21:20:55,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:20:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-11-23 21:20:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-23 21:20:55,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:55,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-23 21:20:55,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:20:55,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-23 21:20:55,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash 29525644, now seen corresponding path program 1 times [2023-11-23 21:20:55,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453148049] [2023-11-23 21:20:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:55,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:20:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453148049] [2023-11-23 21:20:55,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453148049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:20:55,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:20:55,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:20:55,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797019746] [2023-11-23 21:20:55,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:20:55,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:20:55,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:20:55,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:20:55,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:20:55,300 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:20:57,325 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 [] [2023-11-23 21:21:00,224 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 [] [2023-11-23 21:21:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:21:00,786 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2023-11-23 21:21:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:21:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-23 21:21:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:21:00,793 INFO L225 Difference]: With dead ends: 124 [2023-11-23 21:21:00,793 INFO L226 Difference]: Without dead ends: 119 [2023-11-23 21:21:00,794 INFO L412 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 [2023-11-23 21:21:00,796 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:21:00,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 113 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2023-11-23 21:21:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-23 21:21:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 65. [2023-11-23 21:21:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 60 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:21:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2023-11-23 21:21:00,811 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 4 [2023-11-23 21:21:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:21:00,811 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2023-11-23 21:21:00,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:21:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2023-11-23 21:21:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 21:21:00,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:21:00,813 INFO L195 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] [2023-11-23 21:21:00,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:21:00,814 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-23 21:21:00,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:21:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1817453761, now seen corresponding path program 1 times [2023-11-23 21:21:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:21:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649695773] [2023-11-23 21:21:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:21:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:21:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:21:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:21:01,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:21:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649695773] [2023-11-23 21:21:01,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649695773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:21:01,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:21:01,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:21:01,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939346145] [2023-11-23 21:21:01,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:21:01,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:21:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:21:01,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:21:01,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:21:01,241 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:21:03,263 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 [] [2023-11-23 21:21:06,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-23 21:21:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:21:06,247 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2023-11-23 21:21:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:21:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-23 21:21:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:21:06,257 INFO L225 Difference]: With dead ends: 141 [2023-11-23 21:21:06,257 INFO L226 Difference]: Without dead ends: 78 [2023-11-23 21:21:06,258 INFO L412 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 [2023-11-23 21:21:06,259 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:21:06,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 102 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2023-11-23 21:21:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-23 21:21:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-23 21:21:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 73 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:21:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-23 21:21:06,275 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 31 [2023-11-23 21:21:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:21:06,275 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-23 21:21:06,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:21:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-23 21:21:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 21:21:06,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:21:06,279 INFO L195 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] [2023-11-23 21:21:06,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:21:06,280 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-23 21:21:06,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:21:06,281 INFO L85 PathProgramCache]: Analyzing trace with hash 368276968, now seen corresponding path program 1 times [2023-11-23 21:21:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:21:06,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950918289] [2023-11-23 21:21:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:21:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:21:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:21:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:21:06,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:21:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950918289] [2023-11-23 21:21:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950918289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:21:06,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:21:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:21:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174168481] [2023-11-23 21:21:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:21:06,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:21:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:21:06,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:21:06,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:21:06,729 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 21:21:07,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:21:09,997 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 [] [2023-11-23 21:21:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:21:12,248 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2023-11-23 21:21:12,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:21:12,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-11-23 21:21:12,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:21:12,257 INFO L225 Difference]: With dead ends: 117 [2023-11-23 21:21:12,258 INFO L226 Difference]: Without dead ends: 115 [2023-11-23 21:21:12,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:21:12,260 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:21:12,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2023-11-23 21:21:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-23 21:21:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-23 21:21:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 104 states have (on average 1.125) internal successors, (117), 107 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 21:21:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2023-11-23 21:21:12,288 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 44 [2023-11-23 21:21:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:21:12,288 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2023-11-23 21:21:12,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 21:21:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2023-11-23 21:21:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-23 21:21:12,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:21:12,291 INFO L195 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] [2023-11-23 21:21:12,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:21:12,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-23 21:21:12,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:21:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1667334452, now seen corresponding path program 1 times [2023-11-23 21:21:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:21:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850926304] [2023-11-23 21:21:12,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:21:12,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:21:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:21:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:21:12,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:21:12,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850926304] [2023-11-23 21:21:12,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850926304] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:21:12,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194506502] [2023-11-23 21:21:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:21:12,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:21:12,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:21:12,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:21:12,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:21:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:21:13,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:21:13,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:21:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:21:13,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:21:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:21:13,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194506502] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:21:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [236896725] [2023-11-23 21:21:13,378 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2023-11-23 21:21:13,378 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:21:13,382 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 21:21:13,387 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 21:21:13,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 21:21:20,065 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 21:21:23,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [236896725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:21:23,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:21:23,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5, 5] total 15 [2023-11-23 21:21:23,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644887139] [2023-11-23 21:21:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:21:23,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:21:23,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:21:23,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:21:23,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-11-23 21:21:23,841 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 21:21:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:21:24,076 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2023-11-23 21:21:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:21:24,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-11-23 21:21:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:21:24,079 INFO L225 Difference]: With dead ends: 115 [2023-11-23 21:21:24,079 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 21:21:24,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-11-23 21:21:24,084 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:21:24,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:21:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 21:21:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 21:21:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:21:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 21:21:24,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2023-11-23 21:21:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:21:24,086 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 21:21:24,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 21:21:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 21:21:24,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 21:21:24,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-23 21:21:24,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-23 21:21:24,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-23 21:21:24,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-23 21:21:24,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-23 21:21:24,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-23 21:21:24,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 21:21:24,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:21:24,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 21:21:25,558 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2023-11-23 21:21:25,558 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2023-11-23 21:21:25,558 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-11-23 21:21:25,558 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 737) no Hoare annotation was computed. [2023-11-23 21:21:25,558 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 737) no Hoare annotation was computed. [2023-11-23 21:21:25,558 INFO L899 garLoopResultBuilder]: For program point L737-2(lines 737 746) no Hoare annotation was computed. [2023-11-23 21:21:25,559 INFO L899 garLoopResultBuilder]: For program point L737-3(line 737) no Hoare annotation was computed. [2023-11-23 21:21:25,559 INFO L899 garLoopResultBuilder]: For program point L737-4(line 737) no Hoare annotation was computed. [2023-11-23 21:21:25,559 INFO L895 garLoopResultBuilder]: At program point L737-5(lines 737 746) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0))) [2023-11-23 21:21:25,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 748) no Hoare annotation was computed. [2023-11-23 21:21:25,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 748) no Hoare annotation was computed. [2023-11-23 21:21:25,559 INFO L899 garLoopResultBuilder]: For program point L744(line 744) no Hoare annotation was computed. [2023-11-23 21:21:25,559 INFO L899 garLoopResultBuilder]: For program point L744-1(line 744) no Hoare annotation was computed. [2023-11-23 21:21:25,559 INFO L895 garLoopResultBuilder]: At program point L747-3(lines 747 749) the Hoare annotation is: false [2023-11-23 21:21:25,559 INFO L899 garLoopResultBuilder]: For program point L745-68(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,560 INFO L902 garLoopResultBuilder]: At program point L745-69(line 745) the Hoare annotation is: true [2023-11-23 21:21:25,560 INFO L899 garLoopResultBuilder]: For program point L745-70(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,560 INFO L895 garLoopResultBuilder]: At program point L745-71(line 745) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4))) (and (<= .cse0 32767) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~user~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_26| (Array Int Int))) (and (= |#length| (store |v_#length_26| |ULTIMATE.start_main_~user~0#1.base| 40)) (= (select |v_#length_26| 2) 11) (= 2 (select |v_#length_26| 1)))) (= |ULTIMATE.start_main_~users~0#1.offset| 0) (exists ((|v_#memory_int_368| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_368| 1))) (and (= (select .cse1 0) 48) (= |#memory_int| (store |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base|) 0 0) 4 .cse0))) (= (select .cse1 1) 0)))) (= |ULTIMATE.start_main_~users~0#1.base| 0) (= 4276993775 |ULTIMATE.start_main_~_ha_hashv~0#1|) (not (= |ULTIMATE.start_main_~user~0#1.base| 0)) (<= 0 (+ .cse0 32768)) (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~_hj_key~0#1.base|) (= |ULTIMATE.start_main_~_hj_key~0#1.offset| 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= .cse0 |ULTIMATE.start_main_~sum~0#1|) (= 4 |ULTIMATE.start_main_~_hj_k~0#1|) (exists ((|v_#valid_61| (Array Int Int))) (and (= (store |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base| 1) |#valid|) (= (select |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base|) 0) (= (select |v_#valid_61| 0) 0) (= (select |v_#valid_61| 1) 1) (= (select |v_#valid_61| 2) 1))) (= 2654435769 |ULTIMATE.start_main_~_hj_j~0#1|) (= 2654435769 |ULTIMATE.start_main_~_hj_i~0#1|))) [2023-11-23 21:21:25,560 INFO L899 garLoopResultBuilder]: For program point L748(line 748) no Hoare annotation was computed. [2023-11-23 21:21:25,561 INFO L899 garLoopResultBuilder]: For program point L748-1(line 748) no Hoare annotation was computed. [2023-11-23 21:21:25,561 INFO L899 garLoopResultBuilder]: For program point L745-170(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,561 INFO L895 garLoopResultBuilder]: At program point L745-171(line 745) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4))) (and (<= .cse0 32767) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~user~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_26| (Array Int Int))) (and (= |#length| (store |v_#length_26| |ULTIMATE.start_main_~user~0#1.base| 40)) (= (select |v_#length_26| 2) 11) (= 2 (select |v_#length_26| 1)))) (= |ULTIMATE.start_main_~users~0#1.offset| 0) (exists ((|v_#memory_int_368| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_368| 1))) (and (= (select .cse1 0) 48) (= |#memory_int| (store |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base|) 0 0) 4 .cse0))) (= (select .cse1 1) 0)))) (= |ULTIMATE.start_main_~users~0#1.base| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| 0)) (<= 0 (+ .cse0 32768)) (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~_hj_key~0#1.base|) (= |ULTIMATE.start_main_~_hj_key~0#1.offset| 0) (= 4276993779 |ULTIMATE.start_main_~_ha_hashv~0#1|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= .cse0 |ULTIMATE.start_main_~sum~0#1|) (= (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~_hj_key~0#1.base|))) (+ (mod (select .cse2 0) 256) (* (mod (select .cse2 3) 256) 16777216) (* 65536 (mod (select .cse2 2) 256)) 2654435769 (* (mod (select .cse2 1) 256) 256))) |ULTIMATE.start_main_~_hj_i~0#1|) (= 4 |ULTIMATE.start_main_~_hj_k~0#1|) (exists ((|v_#valid_61| (Array Int Int))) (and (= (store |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base| 1) |#valid|) (= (select |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base|) 0) (= (select |v_#valid_61| 0) 0) (= (select |v_#valid_61| 1) 1) (= (select |v_#valid_61| 2) 1))) (= 2654435769 |ULTIMATE.start_main_~_hj_j~0#1|))) [2023-11-23 21:21:25,561 INFO L899 garLoopResultBuilder]: For program point L745-172(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,562 INFO L899 garLoopResultBuilder]: For program point L745-173(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,562 INFO L895 garLoopResultBuilder]: At program point L745-174(line 745) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4))) (and (<= .cse0 32767) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~user~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_26| (Array Int Int))) (and (= |#length| (store |v_#length_26| |ULTIMATE.start_main_~user~0#1.base| 40)) (= (select |v_#length_26| 2) 11) (= 2 (select |v_#length_26| 1)))) (= |ULTIMATE.start_main_~users~0#1.offset| 0) (exists ((|v_#memory_int_368| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_368| 1))) (and (= (select .cse1 0) 48) (= |#memory_int| (store |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base|) 0 0) 4 .cse0))) (= (select .cse1 1) 0)))) (= |ULTIMATE.start_main_~users~0#1.base| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| 0)) (<= 0 (+ .cse0 32768)) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= .cse0 |ULTIMATE.start_main_~sum~0#1|) (exists ((|v_#valid_61| (Array Int Int))) (and (= (store |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base| 1) |#valid|) (= (select |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base|) 0) (= (select |v_#valid_61| 0) 0) (= (select |v_#valid_61| 1) 1) (= (select |v_#valid_61| 2) 1))))) [2023-11-23 21:21:25,562 INFO L899 garLoopResultBuilder]: For program point L745-175(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,563 INFO L895 garLoopResultBuilder]: At program point L745-176(line 745) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4))) (and (<= .cse0 32767) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~user~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_26| (Array Int Int))) (and (= |#length| (store |v_#length_26| |ULTIMATE.start_main_~user~0#1.base| 40)) (= (select |v_#length_26| 2) 11) (= 2 (select |v_#length_26| 1)))) (= |ULTIMATE.start_main_~users~0#1.offset| 0) (exists ((|v_#memory_int_368| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_368| 1))) (and (= (select .cse1 0) 48) (= |#memory_int| (store |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base|) 0 0) 4 .cse0))) (= (select .cse1 1) 0)))) (= |ULTIMATE.start_main_~users~0#1.base| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| 0)) (<= 0 (+ .cse0 32768)) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= .cse0 |ULTIMATE.start_main_~sum~0#1|) (exists ((|v_#valid_61| (Array Int Int))) (and (= (store |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base| 1) |#valid|) (= (select |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base|) 0) (= (select |v_#valid_61| 0) 0) (= (select |v_#valid_61| 1) 1) (= (select |v_#valid_61| 2) 1))))) [2023-11-23 21:21:25,563 INFO L899 garLoopResultBuilder]: For program point L745-178(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,563 INFO L899 garLoopResultBuilder]: For program point L745-180(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,563 INFO L895 garLoopResultBuilder]: At program point L745-182(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,563 INFO L899 garLoopResultBuilder]: For program point L745-183(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,563 INFO L899 garLoopResultBuilder]: For program point L745-184(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,563 INFO L895 garLoopResultBuilder]: At program point L745-186(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,564 INFO L899 garLoopResultBuilder]: For program point L745-187(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,564 INFO L899 garLoopResultBuilder]: For program point L745-188(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,564 INFO L895 garLoopResultBuilder]: At program point L745-189(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,564 INFO L899 garLoopResultBuilder]: For program point L745-190(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,564 INFO L899 garLoopResultBuilder]: For program point L745-193(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,564 INFO L895 garLoopResultBuilder]: At program point L745-194(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 21:21:25,564 INFO L899 garLoopResultBuilder]: For program point L745-202(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,564 INFO L895 garLoopResultBuilder]: At program point L745-203(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,573 INFO L899 garLoopResultBuilder]: For program point L745-210(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,573 INFO L899 garLoopResultBuilder]: For program point L745-212(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,573 INFO L895 garLoopResultBuilder]: At program point L745-214(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,573 INFO L899 garLoopResultBuilder]: For program point L745-215(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,574 INFO L899 garLoopResultBuilder]: For program point L745-225(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,574 INFO L895 garLoopResultBuilder]: At program point L752-9(lines 752 755) the Hoare annotation is: (= |ULTIMATE.start_main_~sum~0#1| 0) [2023-11-23 21:21:25,574 INFO L899 garLoopResultBuilder]: For program point L745-235(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,574 INFO L895 garLoopResultBuilder]: At program point L745-236(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,574 INFO L899 garLoopResultBuilder]: For program point L745-237(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,575 INFO L895 garLoopResultBuilder]: At program point L745-246(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,579 INFO L895 garLoopResultBuilder]: At program point L745-248(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,580 INFO L899 garLoopResultBuilder]: For program point L745-249(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,580 INFO L899 garLoopResultBuilder]: For program point L753-3(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,580 INFO L899 garLoopResultBuilder]: For program point L745-255(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,580 INFO L899 garLoopResultBuilder]: For program point L745-256(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,580 INFO L899 garLoopResultBuilder]: For program point L753-8(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,581 INFO L895 garLoopResultBuilder]: At program point L745-257(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,582 INFO L899 garLoopResultBuilder]: For program point L745-259(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,582 INFO L899 garLoopResultBuilder]: For program point L753-11(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,582 INFO L899 garLoopResultBuilder]: For program point L745-260(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,583 INFO L895 garLoopResultBuilder]: At program point L753-12(line 753) the Hoare annotation is: (= |ULTIMATE.start_main_~sum~0#1| 0) [2023-11-23 21:21:25,583 INFO L895 garLoopResultBuilder]: At program point L745-261(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,583 INFO L899 garLoopResultBuilder]: For program point L753-13(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,583 INFO L899 garLoopResultBuilder]: For program point L745-262(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,583 INFO L899 garLoopResultBuilder]: For program point L745-263(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,583 INFO L895 garLoopResultBuilder]: At program point L745-264(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,584 INFO L899 garLoopResultBuilder]: For program point L745-265(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,585 INFO L895 garLoopResultBuilder]: At program point L745-266(line 745) the Hoare annotation is: false [2023-11-23 21:21:25,585 INFO L899 garLoopResultBuilder]: For program point L745-267(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,585 INFO L899 garLoopResultBuilder]: For program point L745-268(line 745) no Hoare annotation was computed. [2023-11-23 21:21:25,586 INFO L895 garLoopResultBuilder]: At program point L745-269(line 745) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4))) (and (<= .cse0 32767) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~user~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_26| (Array Int Int))) (and (= |#length| (store |v_#length_26| |ULTIMATE.start_main_~user~0#1.base| 40)) (= (select |v_#length_26| 2) 11) (= 2 (select |v_#length_26| 1)))) (= |ULTIMATE.start_main_~users~0#1.offset| 0) (exists ((|v_#memory_int_368| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_368| 1))) (and (= (select .cse1 0) 48) (= |#memory_int| (store |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_368| |ULTIMATE.start_main_~user~0#1.base|) 0 0) 4 .cse0))) (= (select .cse1 1) 0)))) (= |ULTIMATE.start_main_~users~0#1.base| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| 0)) (<= 0 (+ .cse0 32768)) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= .cse0 |ULTIMATE.start_main_~sum~0#1|) (exists ((|v_#valid_61| (Array Int Int))) (and (= (store |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base| 1) |#valid|) (= (select |v_#valid_61| |ULTIMATE.start_main_~user~0#1.base|) 0) (= (select |v_#valid_61| 0) 0) (= (select |v_#valid_61| 1) 1) (= (select |v_#valid_61| 2) 1))))) [2023-11-23 21:21:25,586 INFO L899 garLoopResultBuilder]: For program point L753-22(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,586 INFO L895 garLoopResultBuilder]: At program point L753-23(line 753) the Hoare annotation is: (= |ULTIMATE.start_main_~sum~0#1| 0) [2023-11-23 21:21:25,586 INFO L899 garLoopResultBuilder]: For program point L753-34(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,586 INFO L895 garLoopResultBuilder]: At program point L753-35(line 753) the Hoare annotation is: (= |ULTIMATE.start_main_~sum~0#1| 0) [2023-11-23 21:21:25,588 INFO L899 garLoopResultBuilder]: For program point L753-36(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,588 INFO L899 garLoopResultBuilder]: For program point L753-37(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,588 INFO L899 garLoopResultBuilder]: For program point L753-38(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,589 INFO L895 garLoopResultBuilder]: At program point L753-39(line 753) the Hoare annotation is: (= |ULTIMATE.start_main_~sum~0#1| 0) [2023-11-23 21:21:25,589 INFO L899 garLoopResultBuilder]: For program point L753-40(line 753) no Hoare annotation was computed. [2023-11-23 21:21:25,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 744) no Hoare annotation was computed. [2023-11-23 21:21:25,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 744) no Hoare annotation was computed. [2023-11-23 21:21:25,589 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 21:21:25,593 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-23 21:21:25,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:21:25,616 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,617 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated [2023-11-23 21:21:25,617 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated [2023-11-23 21:21:25,618 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,622 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,622 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated [2023-11-23 21:21:25,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated [2023-11-23 21:21:25,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated [2023-11-23 21:21:25,630 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,630 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,630 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated [2023-11-23 21:21:25,633 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,634 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated [2023-11-23 21:21:25,640 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated [2023-11-23 21:21:25,640 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,640 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,641 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~_hj_key~0!base][0] could not be translated [2023-11-23 21:21:25,641 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~_hj_key~0!base][3] could not be translated [2023-11-23 21:21:25,641 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~_hj_key~0!base][2] could not be translated [2023-11-23 21:21:25,641 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~_hj_key~0!base][1] could not be translated [2023-11-23 21:21:25,642 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated [2023-11-23 21:21:25,643 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-11-23 21:21:25,644 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-23 21:21:25,644 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-23 21:21:25,644 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-23 21:21:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-11-23 21:21:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-23 21:21:25,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-23 21:21:25,651 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,652 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated [2023-11-23 21:21:25,652 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated [2023-11-23 21:21:25,653 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,653 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,653 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated [2023-11-23 21:21:25,654 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated [2023-11-23 21:21:25,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated [2023-11-23 21:21:25,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated [2023-11-23 21:21:25,658 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated [2023-11-23 21:21:25,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:21:25 BoogieIcfgContainer [2023-11-23 21:21:25,658 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:21:25,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:21:25,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:21:25,659 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:21:25,660 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:31" (3/4) ... [2023-11-23 21:21:25,662 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 21:21:25,665 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2023-11-23 21:21:25,694 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 152 nodes and edges [2023-11-23 21:21:25,696 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2023-11-23 21:21:25,698 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-23 21:21:25,699 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 21:21:25,914 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/witness.graphml [2023-11-23 21:21:25,916 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0dd678d-5983-4730-a3ee-b9694e1f31aa/bin/utaipan-verify-mE87zJ7Ire/witness.yml [2023-11-23 21:21:25,916 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:21:25,917 INFO L158 Benchmark]: Toolchain (without parser) took 58229.56ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 120.8MB in the beginning and 139.8MB in the end (delta: -18.9MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2023-11-23 21:21:25,917 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:21:25,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 889.72ms. Allocated memory is still 165.7MB. Free memory was 120.8MB in the beginning and 91.5MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-23 21:21:25,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.69ms. Allocated memory is still 165.7MB. Free memory was 91.5MB in the beginning and 130.4MB in the end (delta: -38.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-11-23 21:21:25,919 INFO L158 Benchmark]: Boogie Preprocessor took 99.14ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 124.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 21:21:25,920 INFO L158 Benchmark]: RCFGBuilder took 2629.83ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 124.1MB in the beginning and 101.9MB in the end (delta: 22.2MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2023-11-23 21:21:25,920 INFO L158 Benchmark]: TraceAbstraction took 54191.46ms. Allocated memory is still 207.6MB. Free memory was 100.9MB in the beginning and 151.3MB in the end (delta: -50.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2023-11-23 21:21:25,920 INFO L158 Benchmark]: Witness Printer took 256.80ms. Allocated memory is still 207.6MB. Free memory was 151.3MB in the beginning and 139.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 21:21:25,922 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 889.72ms. Allocated memory is still 165.7MB. Free memory was 120.8MB in the beginning and 91.5MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.69ms. Allocated memory is still 165.7MB. Free memory was 91.5MB in the beginning and 130.4MB in the end (delta: -38.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.14ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 124.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2629.83ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 124.1MB in the beginning and 101.9MB in the end (delta: 22.2MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * TraceAbstraction took 54191.46ms. Allocated memory is still 207.6MB. Free memory was 100.9MB in the beginning and 151.3MB in the end (delta: -50.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 256.80ms. Allocated memory is still 207.6MB. Free memory was 151.3MB in the beginning and 139.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~_hj_key~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~_hj_key~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~_hj_key~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~_hj_key~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_26 : [int]int :: (#length == v_#length_26[~user~0!base := 40] && v_#length_26[2] == 11) && 2 == v_#length_26[1]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_368 : [int,int]int :: (v_#memory_int_368[1][0] == 48 && #memory_int == v_#memory_int_368[~user~0!base := v_#memory_int_368[~user~0!base][0 := 0][4 := #memory_int[~user~0!base][4]]]) && v_#memory_int_368[1][1] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~user~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_61 : [int]int :: (((v_#valid_61[~user~0!base := 1] == #valid && v_#valid_61[~user~0!base] == 0) && v_#valid_61[0] == 0) && v_#valid_61[1] == 1) && v_#valid_61[2] == 1) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 744]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 744]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 737]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 737]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 748]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 748]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 54.1s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 38.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 38.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 309 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 301 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=5, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 56 PreInvPairs, 68 NumberOfFragments, 798 HoareAnnotationTreeSize, 56 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 1215 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 SizeOfPredicates, 1 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 6.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 14, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 30, TOOLS_POST_TIME: 2.3s, TOOLS_POST_CALL_APPLICATIONS: 2, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 2, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 32, TOOLS_QUANTIFIERELIM_TIME: 2.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 44, FLUID_YES_ANSWERS: 1, DOMAIN_JOIN_APPLICATIONS: 3, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 1, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 14, DOMAIN_ISBOTTOM_TIME: 4.1s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 2, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 2301, DAG_COMPRESSION_RETAINED_NODES: 128, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: (sum == 0) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (sum == 0) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (i == 0) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (i == 0) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: ((((i == 0) && (4276993779 == _ha_hashv)) && (4 == _hj_k)) && (2654435769 == _hj_j)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 747]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (sum == 0) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (sum == 0) - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: ((i == 0) && (sum == 0)) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (i == 0) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (sum == 0) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (((((i == 0) && (4276993775 == _ha_hashv)) && (4 == _hj_k)) && (2654435769 == _hj_j)) && (2654435769 == _hj_i)) RESULT: Ultimate proved your program to be correct!