./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:30:08,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:30:08,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 08:30:08,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:30:08,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:30:08,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:30:08,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:30:08,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:30:08,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:30:08,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:30:08,137 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:30:08,137 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:30:08,138 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:30:08,138 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:30:08,139 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:30:08,139 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:30:08,140 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:30:08,140 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:30:08,141 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:30:08,142 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:30:08,142 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:30:08,143 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:30:08,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:30:08,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:30:08,145 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:30:08,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:30:08,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:30:08,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:30:08,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:30:08,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:30:08,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:30:08,148 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:30:08,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:30:08,148 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:30:08,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:30:08,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:30:08,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:30:08,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:30:08,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:30:08,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:30:08,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:30:08,150 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:30:08,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:30:08,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:30:08,151 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:30:08,151 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:30:08,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:30:08,151 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_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/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_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2023-12-02 08:30:08,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:30:08,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:30:08,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:30:08,409 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:30:08,409 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:30:08,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-12-02 08:30:11,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:30:11,364 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:30:11,364 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-12-02 08:30:11,374 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/data/a64f552df/7a415d6144e7481fa47ca1069a6e17a1/FLAG027fc3566 [2023-12-02 08:30:11,387 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/data/a64f552df/7a415d6144e7481fa47ca1069a6e17a1 [2023-12-02 08:30:11,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:30:11,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:30:11,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:30:11,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:30:11,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:30:11,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c1eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11, skipping insertion in model container [2023-12-02 08:30:11,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,437 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:30:11,584 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2023-12-02 08:30:11,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:30:11,647 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:30:11,660 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2023-12-02 08:30:11,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:30:11,710 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:30:11,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11 WrapperNode [2023-12-02 08:30:11,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:30:11,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:30:11,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:30:11,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:30:11,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,798 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 363 [2023-12-02 08:30:11,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:30:11,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:30:11,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:30:11,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:30:11,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:30:11,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:30:11,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:30:11,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:30:11,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (1/1) ... [2023-12-02 08:30:11,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:30:11,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:11,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:30:11,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:30:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:30:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 08:30:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 08:30:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-12-02 08:30:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 08:30:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-12-02 08:30:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 08:30:11,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 08:30:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:30:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:30:11,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:30:12,019 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:30:12,021 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:30:12,393 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:30:12,916 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:30:12,917 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 08:30:12,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:30:12 BoogieIcfgContainer [2023-12-02 08:30:12,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:30:12,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:30:12,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:30:12,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:30:12,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:30:11" (1/3) ... [2023-12-02 08:30:12,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674e1472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:30:12, skipping insertion in model container [2023-12-02 08:30:12,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:11" (2/3) ... [2023-12-02 08:30:12,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674e1472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:30:12, skipping insertion in model container [2023-12-02 08:30:12,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:30:12" (3/3) ... [2023-12-02 08:30:12,927 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2023-12-02 08:30:12,945 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:30:12,946 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 08:30:12,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:30:13,000 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;@93d12e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:30:13,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 08:30:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 08:30:13,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 08:30:13,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:13,013 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:13,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:13,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash 108650302, now seen corresponding path program 1 times [2023-12-02 08:30:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:13,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106214222] [2023-12-02 08:30:13,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:13,215 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 08:30:13,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105098337] [2023-12-02 08:30:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:13,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:13,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:13,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:13,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 08:30:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:30:13,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 08:30:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:30:14,085 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 08:30:14,088 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 08:30:14,089 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 08:30:14,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 08:30:14,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:14,297 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 08:30:14,300 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 08:30:14,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-12-02 08:30:14,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-12-02 08:30:14,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-12-02 08:30:14,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-12-02 08:30:14,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-12-02 08:30:14,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-12-02 08:30:14,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-12-02 08:30:14,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-12-02 08:30:14,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated [2023-12-02 08:30:14,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated [2023-12-02 08:30:14,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-12-02 08:30:14,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-12-02 08:30:14,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-12-02 08:30:14,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated [2023-12-02 08:30:14,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-12-02 08:30:14,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated [2023-12-02 08:30:14,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-12-02 08:30:14,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-12-02 08:30:14,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated [2023-12-02 08:30:14,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated [2023-12-02 08:30:14,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated [2023-12-02 08:30:14,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-12-02 08:30:14,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-12-02 08:30:14,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-12-02 08:30:14,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-12-02 08:30:14,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-12-02 08:30:14,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-12-02 08:30:14,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-12-02 08:30:14,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-12-02 08:30:14,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-12-02 08:30:14,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-12-02 08:30:14,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-12-02 08:30:14,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-12-02 08:30:14,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-12-02 08:30:14,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:30:14 BoogieIcfgContainer [2023-12-02 08:30:14,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 08:30:14,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 08:30:14,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 08:30:14,373 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 08:30:14,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:30:12" (3/4) ... [2023-12-02 08:30:14,376 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 08:30:14,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 08:30:14,379 INFO L158 Benchmark]: Toolchain (without parser) took 2986.74ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 82.1MB in the beginning and 111.8MB in the end (delta: -29.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-12-02 08:30:14,379 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:30:14,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.27ms. Allocated memory is still 127.9MB. Free memory was 82.0MB in the beginning and 67.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 08:30:14,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.87ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 67.8MB in the beginning and 135.2MB in the end (delta: -67.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2023-12-02 08:30:14,381 INFO L158 Benchmark]: Boogie Preprocessor took 58.40ms. Allocated memory is still 165.7MB. Free memory was 135.1MB in the beginning and 135.5MB in the end (delta: -376.6kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2023-12-02 08:30:14,382 INFO L158 Benchmark]: RCFGBuilder took 1059.71ms. Allocated memory is still 165.7MB. Free memory was 135.5MB in the beginning and 102.2MB in the end (delta: 33.3MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. [2023-12-02 08:30:14,382 INFO L158 Benchmark]: TraceAbstraction took 1451.67ms. Allocated memory is still 165.7MB. Free memory was 102.2MB in the beginning and 111.8MB in the end (delta: -9.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2023-12-02 08:30:14,383 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 165.7MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:30:14,386 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.19ms. Allocated memory is still 127.9MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.27ms. Allocated memory is still 127.9MB. Free memory was 82.0MB in the beginning and 67.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.87ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 67.8MB in the beginning and 135.2MB in the end (delta: -67.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.40ms. Allocated memory is still 165.7MB. Free memory was 135.1MB in the beginning and 135.5MB in the end (delta: -376.6kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1059.71ms. Allocated memory is still 165.7MB. Free memory was 135.5MB in the beginning and 102.2MB in the end (delta: 33.3MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1451.67ms. Allocated memory is still 165.7MB. Free memory was 102.2MB in the beginning and 111.8MB in the end (delta: -9.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 165.7MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L34] double last_1_double_Array_0_0_ = 0.97; [L35] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR double_Array_0[0] [L94] last_1_double_Array_0_0_ = double_Array_0[0] [L95] EXPR signed_long_int_Array_0[1][0] [L95] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] RET updateVariables() [L107] CALL step() [L39] EXPR signed_long_int_Array_0[0][1] [L39] EXPR signed_long_int_Array_0[0][0] [L39] COND TRUE ! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_)) [L40] COND FALSE !(((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) [L48] EXPR unsigned_char_Array_0[1] [L48] EXPR unsigned_char_Array_0[1] [L48] COND FALSE !(unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0][1] [L51] signed_long_int_Array_0[1][0] = (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]) [L53] EXPR unsigned_char_Array_0[1] [L53] EXPR signed_long_int_Array_0[0][1] [L53] EXPR unsigned_char_Array_0[1] [L53] COND FALSE !((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L66] BOOL_unsigned_char_Array_0[1] [L66] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L69] EXPR BOOL_unsigned_char_Array_0[0] [L69] BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1]) [L69] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR BOOL_unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR BOOL_unsigned_char_Array_0[0] [L98] EXPR BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1]) [L98] EXPR (BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1 [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR signed_long_int_Array_0[1][0] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR signed_long_int_Array_0[0][0] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR (((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1 [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR double_Array_0[0] [L98] EXPR double_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98-L99] return (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 1, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-02 08:30:14,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:30:16,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:30:16,495 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 08:30:16,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:30:16,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:30:16,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:30:16,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:30:16,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:30:16,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:30:16,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:30:16,530 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:30:16,531 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:30:16,531 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:30:16,532 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:30:16,532 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:30:16,533 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:30:16,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:30:16,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:30:16,535 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:30:16,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:30:16,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:30:16,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:30:16,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:30:16,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:30:16,538 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 08:30:16,538 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 08:30:16,539 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 08:30:16,539 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:30:16,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:30:16,540 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:30:16,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:30:16,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 08:30:16,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:30:16,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:30:16,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:30:16,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:30:16,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:30:16,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:30:16,543 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 08:30:16,543 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:16,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:30:16,543 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:30:16,544 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:30:16,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:30:16,544 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/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_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2023-12-02 08:30:16,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:30:16,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:30:16,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:30:16,847 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:30:16,847 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:30:16,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-12-02 08:30:19,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:30:19,848 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:30:19,848 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-12-02 08:30:19,858 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/data/acbb30177/ae2f22063c044e548e87d6ef087fb8e5/FLAGdf362e123 [2023-12-02 08:30:19,870 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/data/acbb30177/ae2f22063c044e548e87d6ef087fb8e5 [2023-12-02 08:30:19,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:30:19,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:30:19,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:30:19,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:30:19,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:30:19,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:30:19" (1/1) ... [2023-12-02 08:30:19,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e303eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:19, skipping insertion in model container [2023-12-02 08:30:19,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:30:19" (1/1) ... [2023-12-02 08:30:19,916 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:30:20,067 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2023-12-02 08:30:20,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:30:20,136 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:30:20,149 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i[916,929] [2023-12-02 08:30:20,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:30:20,212 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:30:20,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20 WrapperNode [2023-12-02 08:30:20,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:30:20,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:30:20,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:30:20,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:30:20,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,273 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 361 [2023-12-02 08:30:20,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:30:20,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:30:20,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:30:20,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:30:20,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:30:20,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:30:20,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:30:20,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:30:20,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (1/1) ... [2023-12-02 08:30:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:30:20,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:20,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:30:20,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:30:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:30:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-12-02 08:30:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-12-02 08:30:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 08:30:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 08:30:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-12-02 08:30:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-12-02 08:30:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 08:30:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 08:30:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 08:30:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:30:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:30:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-12-02 08:30:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 08:30:20,506 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:30:20,508 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:30:21,064 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:30:21,107 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:30:21,107 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 08:30:21,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:30:21 BoogieIcfgContainer [2023-12-02 08:30:21,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:30:21,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:30:21,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:30:21,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:30:21,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:30:19" (1/3) ... [2023-12-02 08:30:21,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a392b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:30:21, skipping insertion in model container [2023-12-02 08:30:21,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:20" (2/3) ... [2023-12-02 08:30:21,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a392b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:30:21, skipping insertion in model container [2023-12-02 08:30:21,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:30:21" (3/3) ... [2023-12-02 08:30:21,115 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2023-12-02 08:30:21,130 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:30:21,130 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 08:30:21,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:30:21,176 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;@2b90f827, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:30:21,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 08:30:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 08:30:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-02 08:30:21,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:21,192 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:21,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:21,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash 72265026, now seen corresponding path program 1 times [2023-12-02 08:30:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:21,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296918916] [2023-12-02 08:30:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:21,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:21,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:21,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:30:21,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 08:30:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:21,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 08:30:21,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-12-02 08:30:21,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:30:21,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296918916] [2023-12-02 08:30:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296918916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:21,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:30:21,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:30:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775612159] [2023-12-02 08:30:21,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:21,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 08:30:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 08:30:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 08:30:21,574 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:30:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:21,625 INFO L93 Difference]: Finished difference Result 154 states and 246 transitions. [2023-12-02 08:30:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 08:30:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2023-12-02 08:30:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:21,634 INFO L225 Difference]: With dead ends: 154 [2023-12-02 08:30:21,634 INFO L226 Difference]: Without dead ends: 75 [2023-12-02 08:30:21,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 08:30:21,640 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:21,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:30:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-02 08:30:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-02 08:30:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 08:30:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-12-02 08:30:21,678 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 89 [2023-12-02 08:30:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:21,679 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-12-02 08:30:21,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:30:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-12-02 08:30:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-02 08:30:21,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:21,708 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:21,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 08:30:21,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:21,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:21,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash -944275844, now seen corresponding path program 1 times [2023-12-02 08:30:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:21,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852993903] [2023-12-02 08:30:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:21,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:21,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:21,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:30:21,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 08:30:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:22,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:30:22,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:22,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 08:30:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:30:22,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:30:22,242 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:22,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852993903] [2023-12-02 08:30:22,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852993903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:22,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:30:22,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:30:22,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108352000] [2023-12-02 08:30:22,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:22,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:30:22,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:30:22,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:30:22,246 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:30:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:22,312 INFO L93 Difference]: Finished difference Result 149 states and 217 transitions. [2023-12-02 08:30:22,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:30:22,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2023-12-02 08:30:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:22,315 INFO L225 Difference]: With dead ends: 149 [2023-12-02 08:30:22,315 INFO L226 Difference]: Without dead ends: 75 [2023-12-02 08:30:22,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 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-12-02 08:30:22,318 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:22,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:30:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-02 08:30:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-02 08:30:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 08:30:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2023-12-02 08:30:22,330 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 89 [2023-12-02 08:30:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:22,332 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2023-12-02 08:30:22,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:30:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2023-12-02 08:30:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-02 08:30:22,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:22,336 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:22,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 08:30:22,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:22,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:22,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1965344198, now seen corresponding path program 1 times [2023-12-02 08:30:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764571568] [2023-12-02 08:30:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:22,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:30:22,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 08:30:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:22,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 08:30:22,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:23,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:24,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:24,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 08:30:24,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:24,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-12-02 08:30:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:30:24,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:26,057 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_69 (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_69)) |c_~#double_Array_0~0.base| v_ArrVal_71)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_71) |c_~#signed_long_int_Array_0~0.base| (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse1)))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse1)))) is different from false [2023-12-02 08:30:26,138 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_68 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_69 (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_68))) (let ((.cse3 (store (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store (select .cse0 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_69)) |c_~#double_Array_0~0.base| v_ArrVal_71)) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse2 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_71) |c_~#signed_long_int_Array_0~0.base| (let ((.cse1 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (select .cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse2)))) |c_~#unsigned_char_Array_0~0.base|) .cse4))))) .cse2))))) is different from false [2023-12-02 08:30:26,246 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764571568] [2023-12-02 08:30:26,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764571568] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2079025570] [2023-12-02 08:30:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:26,248 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:30:26,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:30:26,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-02 08:30:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:27,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 08:30:27,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:27,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:30:28,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 08:30:28,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 08:30:28,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 08:30:28,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 08:30:28,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-02 08:30:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:30:29,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:29,456 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_100)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse2 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse0 |c_~#signed_long_int_Array_0~0.base| (let ((.cse1 (select .cse0 |c_~#signed_long_int_Array_0~0.base|))) (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (select .cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse2)))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse2)))) is different from false [2023-12-02 08:30:29,533 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 (_ BitVec 32)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_98)) |c_~#double_Array_0~0.base| v_ArrVal_100)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_100) |c_~#signed_long_int_Array_0~0.base| (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse1 (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse1)))) is different from false [2023-12-02 08:30:29,626 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 (_ BitVec 32)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_97 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_97))) (let ((.cse3 (store (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store (select .cse1 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_98)) |c_~#double_Array_0~0.base| v_ArrVal_100)) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) (= .cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse1 |c_~#double_Array_0~0.base| v_ArrVal_100) |c_~#signed_long_int_Array_0~0.base| (let ((.cse2 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))))) |c_~#unsigned_char_Array_0~0.base|) .cse4)))) (_ bv2 32))))))) is different from false [2023-12-02 08:30:29,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2079025570] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:29,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858577880] [2023-12-02 08:30:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:29,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:29,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:29,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:29,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 08:30:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:30,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 08:30:30,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:30,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 08:30:30,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:30,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:30,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 08:30:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:30,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-12-02 08:30:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 36 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 08:30:31,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:31,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_129)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)))) (= .cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)))))) is different from false [2023-12-02 08:30:31,370 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_127 (_ BitVec 32)) (v_ArrVal_129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_127)) |c_~#double_Array_0~0.base| v_ArrVal_129)) (.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) (= (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_129) |c_~#signed_long_int_Array_0~0.base| (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse1 (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse1)))) is different from false [2023-12-02 08:30:31,487 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_127 (_ BitVec 32)) (v_ArrVal_129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_126))) (let ((.cse3 (store (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store (select .cse1 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_127)) |c_~#double_Array_0~0.base| v_ArrVal_129)) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) (= .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse1 |c_~#double_Array_0~0.base| v_ArrVal_129) |c_~#signed_long_int_Array_0~0.base| (let ((.cse2 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) .cse0)))) |c_~#unsigned_char_Array_0~0.base|) .cse4)))))))))) is different from false [2023-12-02 08:30:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858577880] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:31,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:30:31,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2023-12-02 08:30:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614226985] [2023-12-02 08:30:31,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:30:31,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 08:30:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 08:30:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=425, Unknown=10, NotChecked=408, Total=992 [2023-12-02 08:30:31,576 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 18 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2023-12-02 08:30:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:34,178 INFO L93 Difference]: Finished difference Result 207 states and 293 transitions. [2023-12-02 08:30:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 08:30:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) Word has length 89 [2023-12-02 08:30:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:34,181 INFO L225 Difference]: With dead ends: 207 [2023-12-02 08:30:34,181 INFO L226 Difference]: Without dead ends: 133 [2023-12-02 08:30:34,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=308, Invalid=836, Unknown=10, NotChecked=568, Total=1722 [2023-12-02 08:30:34,183 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 295 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:34,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 342 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 08:30:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-02 08:30:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 83. [2023-12-02 08:30:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 08:30:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2023-12-02 08:30:34,196 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 89 [2023-12-02 08:30:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:34,196 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2023-12-02 08:30:34,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2023-12-02 08:30:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2023-12-02 08:30:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 08:30:34,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:34,198 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:34,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 08:30:34,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 08:30:34,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-02 08:30:34,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:34,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:34,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash -739749665, now seen corresponding path program 1 times [2023-12-02 08:30:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121549481] [2023-12-02 08:30:34,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:34,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:34,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:34,802 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:30:34,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 08:30:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:35,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:30:35,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:35,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 08:30:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:30:35,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:30:35,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121549481] [2023-12-02 08:30:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121549481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:35,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:30:35,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:30:35,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112219202] [2023-12-02 08:30:35,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:35,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:30:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:35,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:30:35,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:30:35,028 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:30:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:35,077 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2023-12-02 08:30:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:30:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-02 08:30:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:35,079 INFO L225 Difference]: With dead ends: 181 [2023-12-02 08:30:35,079 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 08:30:35,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-12-02 08:30:35,081 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:35,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:30:35,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 08:30:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2023-12-02 08:30:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 08:30:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2023-12-02 08:30:35,092 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 91 [2023-12-02 08:30:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:35,093 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2023-12-02 08:30:35,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:30:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2023-12-02 08:30:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 08:30:35,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:35,096 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:35,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 08:30:35,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:35,302 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:35,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash -59691295, now seen corresponding path program 1 times [2023-12-02 08:30:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045562699] [2023-12-02 08:30:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:35,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:30:35,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 08:30:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:35,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 08:30:35,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:36,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:30:36,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:36,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:36,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-12-02 08:30:36,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-12-02 08:30:36,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:36,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2023-12-02 08:30:37,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:37,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 62 [2023-12-02 08:30:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:30:37,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:40,196 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 .cse5 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3))) (bvneg (select .cse6 .cse4)))))) |c_~#double_Array_0~0.base| v_ArrVal_180))) (let ((.cse1 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse0 (select .cse1 .cse4))) (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_180) |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) (select .cse1 .cse5)))))) is different from false [2023-12-02 08:30:40,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 .cse5 (bvadd (bvneg (select .cse6 .cse4)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2))))))) |c_~#double_Array_0~0.base| v_ArrVal_180))) (let ((.cse0 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse3 (select .cse0 .cse4))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_180) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse2))))) .cse3))) |c_~#unsigned_char_Array_0~0.base|) .cse2))) (bvneg .cse3))) (select .cse0 .cse5)))))) is different from false [2023-12-02 08:30:40,341 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse6 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse2 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_177))) (let ((.cse3 (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| (let ((.cse7 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (store .cse7 .cse1 (bvadd (bvneg (select .cse7 .cse6)) ((_ zero_extend 24) ((_ extract 7 0) (select v_ArrVal_177 .cse4))))))) |c_~#double_Array_0~0.base| v_ArrVal_180))) (let ((.cse0 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (= (select .cse0 .cse1) (let ((.cse5 (select .cse0 .cse6))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_180) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4)))) (_ bv2 32)) .cse5))) |c_~#unsigned_char_Array_0~0.base|) .cse4))) (bvneg .cse5)))))))) is different from false [2023-12-02 08:30:40,441 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:40,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045562699] [2023-12-02 08:30:40,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045562699] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:40,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [869852019] [2023-12-02 08:30:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:40,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:30:40,443 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:30:40,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-02 08:30:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:41,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 08:30:41,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:42,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:30:42,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:30:43,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-02 08:30:43,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2023-12-02 08:30:43,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-12-02 08:30:43,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2023-12-02 08:30:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:30:44,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:30:44,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [869852019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:44,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:30:44,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 17 [2023-12-02 08:30:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428014161] [2023-12-02 08:30:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:44,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:30:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:30:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=380, Unknown=16, NotChecked=126, Total=600 [2023-12-02 08:30:44,218 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:30:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:48,447 INFO L93 Difference]: Finished difference Result 270 states and 377 transitions. [2023-12-02 08:30:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 08:30:48,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-02 08:30:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:48,451 INFO L225 Difference]: With dead ends: 270 [2023-12-02 08:30:48,451 INFO L226 Difference]: Without dead ends: 188 [2023-12-02 08:30:48,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=231, Invalid=819, Unknown=18, NotChecked=192, Total=1260 [2023-12-02 08:30:48,453 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 277 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:48,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 429 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 08:30:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-02 08:30:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 109. [2023-12-02 08:30:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 08:30:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2023-12-02 08:30:48,471 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 91 [2023-12-02 08:30:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:48,472 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2023-12-02 08:30:48,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:30:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2023-12-02 08:30:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 08:30:48,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:48,475 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:48,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-02 08:30:48,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 08:30:48,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:48,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:48,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1355345998, now seen corresponding path program 1 times [2023-12-02 08:30:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:48,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394637582] [2023-12-02 08:30:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:48,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:48,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:48,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:30:48,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 08:30:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:49,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 08:30:49,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:49,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:30:50,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:50,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:50,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 08:30:50,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:30:50,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2023-12-02 08:30:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:30:50,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:50,677 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem30#1_18| (_ BitVec 8)) (v_ArrVal_239 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (select (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_239) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_18|)))) is different from false [2023-12-02 08:30:50,698 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem30#1_18| (_ BitVec 8)) (v_ArrVal_237 (_ BitVec 32)) (v_ArrVal_239 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (select (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_237)) |c_~#double_Array_0~0.base| v_ArrVal_239) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_18|)))) is different from false [2023-12-02 08:30:50,723 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem30#1_18| (_ BitVec 8)) (v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (_ BitVec 32)) (v_ArrVal_239 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_236))) (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store (select .cse0 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_237))) |c_~#double_Array_0~0.base| v_ArrVal_239) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_18|)))) is different from false [2023-12-02 08:30:50,745 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394637582] [2023-12-02 08:30:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394637582] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1127559073] [2023-12-02 08:30:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:50,745 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:50,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:30:50,746 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:30:50,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-02 08:30:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:51,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 08:30:51,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:51,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 08:30:51,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:30:52,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:30:52,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:30:52,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:30:53,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:30:53,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:30:53,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:30:53,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:30:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-12-02 08:30:53,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:30:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1127559073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:53,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:30:53,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2023-12-02 08:30:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914886437] [2023-12-02 08:30:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:30:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:53,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:30:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=291, Unknown=3, NotChecked=108, Total=462 [2023-12-02 08:30:53,720 INFO L87 Difference]: Start difference. First operand 109 states and 153 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:30:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:55,590 INFO L93 Difference]: Finished difference Result 284 states and 393 transitions. [2023-12-02 08:30:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:30:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2023-12-02 08:30:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:55,593 INFO L225 Difference]: With dead ends: 284 [2023-12-02 08:30:55,593 INFO L226 Difference]: Without dead ends: 176 [2023-12-02 08:30:55,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2023-12-02 08:30:55,594 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 225 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:55,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 287 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 08:30:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-02 08:30:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 151. [2023-12-02 08:30:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 135 states have internal predecessors, (182), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:30:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 208 transitions. [2023-12-02 08:30:55,613 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 208 transitions. Word has length 91 [2023-12-02 08:30:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:55,614 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 208 transitions. [2023-12-02 08:30:55,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:30:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 208 transitions. [2023-12-02 08:30:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 08:30:55,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:55,616 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:55,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-02 08:30:55,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-02 08:30:56,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:56,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:56,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1983019678, now seen corresponding path program 1 times [2023-12-02 08:30:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408942184] [2023-12-02 08:30:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:56,019 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:30:56,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 08:30:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:56,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 08:30:56,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:30:56,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:30:56,249 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408942184] [2023-12-02 08:30:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408942184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:56,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:30:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:30:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594268259] [2023-12-02 08:30:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:56,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:30:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:30:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:30:56,251 INFO L87 Difference]: Start difference. First operand 151 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:30:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:56,397 INFO L93 Difference]: Finished difference Result 357 states and 489 transitions. [2023-12-02 08:30:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:30:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2023-12-02 08:30:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:56,402 INFO L225 Difference]: With dead ends: 357 [2023-12-02 08:30:56,402 INFO L226 Difference]: Without dead ends: 207 [2023-12-02 08:30:56,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:30:56,403 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:56,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 440 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:30:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-02 08:30:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 159. [2023-12-02 08:30:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 142 states have (on average 1.3380281690140845) internal successors, (190), 143 states have internal predecessors, (190), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:30:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 216 transitions. [2023-12-02 08:30:56,417 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 216 transitions. Word has length 92 [2023-12-02 08:30:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:56,417 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 216 transitions. [2023-12-02 08:30:56,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:30:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 216 transitions. [2023-12-02 08:30:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 08:30:56,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:56,419 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:30:56,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 08:30:56,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:56,620 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:30:56,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1281955100, now seen corresponding path program 1 times [2023-12-02 08:30:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:56,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051203397] [2023-12-02 08:30:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:56,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:30:56,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:56,622 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:30:56,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 08:30:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:56,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:30:56,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:57,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:30:57,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:30:57,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:30:58,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:30:58,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:30:58,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:30:59,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:30:59,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:30:59,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-12-02 08:30:59,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 08:30:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-02 08:30:59,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:59,594 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_322)) (.cse1 (bvadd |c_~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select (store .cse0 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_323) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8)))))) is different from false [2023-12-02 08:30:59,637 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (not (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_322) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_323) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse0)) (_ bv0 8))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_321) |c_~#double_Array_0~0.base| v_ArrVal_322) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse0)) (_ bv0 8))))) is different from false [2023-12-02 08:30:59,875 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:59,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051203397] [2023-12-02 08:30:59,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051203397] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1059635818] [2023-12-02 08:30:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:59,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:59,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:30:59,877 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:30:59,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-02 08:31:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:00,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 08:31:00,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:00,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 08:31:01,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:01,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:01,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:01,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:02,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:02,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:02,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:02,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-12-02 08:31:02,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-12-02 08:31:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-12-02 08:31:02,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:31:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1059635818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:31:02,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:31:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-12-02 08:31:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690127649] [2023-12-02 08:31:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:31:02,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:31:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:31:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:31:02,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=371, Unknown=12, NotChecked=82, Total=552 [2023-12-02 08:31:02,830 INFO L87 Difference]: Start difference. First operand 159 states and 216 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:31:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:31:04,216 INFO L93 Difference]: Finished difference Result 312 states and 418 transitions. [2023-12-02 08:31:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:31:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2023-12-02 08:31:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:31:04,217 INFO L225 Difference]: With dead ends: 312 [2023-12-02 08:31:04,218 INFO L226 Difference]: Without dead ends: 154 [2023-12-02 08:31:04,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=121, Invalid=475, Unknown=12, NotChecked=94, Total=702 [2023-12-02 08:31:04,219 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 345 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:31:04,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 201 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 08:31:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-02 08:31:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 115. [2023-12-02 08:31:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 08:31:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2023-12-02 08:31:04,232 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 92 [2023-12-02 08:31:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:31:04,232 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2023-12-02 08:31:04,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:31:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2023-12-02 08:31:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 08:31:04,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:31:04,234 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:31:04,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 08:31:04,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-12-02 08:31:04,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:31:04,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:31:04,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:31:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2103953582, now seen corresponding path program 1 times [2023-12-02 08:31:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:31:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853351960] [2023-12-02 08:31:04,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:04,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:04,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:31:04,637 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:31:04,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 08:31:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:04,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 08:31:04,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:05,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:05,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:05,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:05,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:06,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:31:06,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 08:31:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2023-12-02 08:31:07,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-12-02 08:31:07,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:31:07,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 59 [2023-12-02 08:31:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 81 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-02 08:31:08,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:31:08,579 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_384))) (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (= (select .cse0 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (let ((.cse1 (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd (bvneg .cse1) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))))) is different from false [2023-12-02 08:31:09,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:31:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853351960] [2023-12-02 08:31:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853351960] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:31:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [234059137] [2023-12-02 08:31:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:31:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:31:09,194 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:31:09,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-02 08:31:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:10,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 08:31:10,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:10,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 08:31:10,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 08:31:11,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 08:31:11,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 08:31:11,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 08:31:12,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-02 08:31:13,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2023-12-02 08:31:13,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-12-02 08:31:13,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2023-12-02 08:31:14,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 55 [2023-12-02 08:31:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 72 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-02 08:31:14,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:31:14,210 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_415))) (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (= (select .cse0 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (let ((.cse1 (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd (bvneg .cse1) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse1))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))))) is different from false [2023-12-02 08:31:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [234059137] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:31:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560770840] [2023-12-02 08:31:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:14,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:31:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:31:14,692 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:31:14,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 08:31:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:14,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 08:31:14,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:15,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 08:31:16,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:31:16,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-12-02 08:31:17,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-12-02 08:31:17,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:31:17,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2023-12-02 08:31:19,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:31:19,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 62 [2023-12-02 08:31:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 36 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 08:31:19,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:31:20,427 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32))) (let ((.cse5 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (store .cse6 .cse5 (bvadd (bvneg (select .cse6 .cse4)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2))))))) |c_~#double_Array_0~0.base| v_ArrVal_442))) (let ((.cse0 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (= (let ((.cse3 (select .cse0 .cse4))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_442) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse2))))) .cse3))) |c_~#unsigned_char_Array_0~0.base|) .cse2))) (bvneg .cse3))) (select .cse0 .cse5)))))) is different from false [2023-12-02 08:31:20,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560770840] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:31:20,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:31:20,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 12] total 27 [2023-12-02 08:31:20,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116863326] [2023-12-02 08:31:20,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:31:20,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 08:31:20,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:31:20,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 08:31:20,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=886, Unknown=25, NotChecked=192, Total=1260 [2023-12-02 08:31:20,588 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand has 28 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 27 states have internal predecessors, (125), 10 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (33), 8 states have call predecessors, (33), 10 states have call successors, (33) [2023-12-02 08:31:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:31:46,664 INFO L93 Difference]: Finished difference Result 483 states and 633 transitions. [2023-12-02 08:31:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 08:31:46,667 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 27 states have internal predecessors, (125), 10 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (33), 8 states have call predecessors, (33), 10 states have call successors, (33) Word has length 92 [2023-12-02 08:31:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:31:46,670 INFO L225 Difference]: With dead ends: 483 [2023-12-02 08:31:46,670 INFO L226 Difference]: Without dead ends: 369 [2023-12-02 08:31:46,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=928, Invalid=3881, Unknown=33, NotChecked=414, Total=5256 [2023-12-02 08:31:46,672 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1140 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:31:46,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 914 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 18.0s Time] [2023-12-02 08:31:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-02 08:31:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 181. [2023-12-02 08:31:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 151 states have internal predecessors, (195), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 08:31:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 239 transitions. [2023-12-02 08:31:46,693 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 239 transitions. Word has length 92 [2023-12-02 08:31:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:31:46,694 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 239 transitions. [2023-12-02 08:31:46,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 27 states have internal predecessors, (125), 10 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (33), 8 states have call predecessors, (33), 10 states have call successors, (33) [2023-12-02 08:31:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 239 transitions. [2023-12-02 08:31:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 08:31:46,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:31:46,695 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:31:46,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-12-02 08:31:46,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-02 08:31:47,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 08:31:47,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:31:47,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:31:47,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:31:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -804009386, now seen corresponding path program 1 times [2023-12-02 08:31:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:31:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380824468] [2023-12-02 08:31:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:47,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:47,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:31:47,298 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:31:47,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-02 08:31:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:47,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 08:31:47,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:48,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:31:48,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2023-12-02 08:31:48,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 08:31:48,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 08:31:48,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 08:31:48,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:31:48,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2023-12-02 08:31:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:31:48,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:31:48,908 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:31:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380824468] [2023-12-02 08:31:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380824468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:31:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:31:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:31:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657902379] [2023-12-02 08:31:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:31:48,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:31:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:31:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:31:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:31:48,910 INFO L87 Difference]: Start difference. First operand 181 states and 239 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:31:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:31:50,295 INFO L93 Difference]: Finished difference Result 329 states and 438 transitions. [2023-12-02 08:31:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:31:50,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2023-12-02 08:31:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:31:50,298 INFO L225 Difference]: With dead ends: 329 [2023-12-02 08:31:50,299 INFO L226 Difference]: Without dead ends: 240 [2023-12-02 08:31:50,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-02 08:31:50,300 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 378 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:31:50,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 257 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 08:31:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-02 08:31:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214. [2023-12-02 08:31:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 states have internal predecessors, (240), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 08:31:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 284 transitions. [2023-12-02 08:31:50,323 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 284 transitions. Word has length 93 [2023-12-02 08:31:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:31:50,324 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 284 transitions. [2023-12-02 08:31:50,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:31:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 284 transitions. [2023-12-02 08:31:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 08:31:50,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:31:50,325 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:31:50,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-02 08:31:50,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:50,528 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:31:50,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:31:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1731701924, now seen corresponding path program 1 times [2023-12-02 08:31:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:31:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071499422] [2023-12-02 08:31:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:50,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:31:50,529 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:31:50,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 08:31:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:50,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 08:31:50,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:51,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:31:51,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:31:52,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:31:52,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 08:31:52,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:31:52,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2023-12-02 08:31:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:31:52,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:31:52,453 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_step_#t~mem30#1_30| (_ BitVec 8))) (not (bvslt (select (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_498) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_30|)))) is different from false [2023-12-02 08:31:52,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_step_#t~mem30#1_30| (_ BitVec 8)) (v_ArrVal_497 (_ BitVec 32))) (not (bvslt (select (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_497)) |c_~#double_Array_0~0.base| v_ArrVal_498) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_30|)))) is different from false [2023-12-02 08:31:52,505 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_495 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_step_#t~mem30#1_30| (_ BitVec 8)) (v_ArrVal_497 (_ BitVec 32))) (not (bvslt (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_495))) (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store (select .cse0 |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_497))) |c_~#double_Array_0~0.base| v_ArrVal_498) |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_30|)))) is different from false [2023-12-02 08:31:52,527 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:31:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071499422] [2023-12-02 08:31:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071499422] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:31:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151569211] [2023-12-02 08:31:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:52,528 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:31:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:31:52,528 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:31:52,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 08:31:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:53,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:31:53,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:54,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:31:54,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:31:54,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:31:54,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:31:54,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:31:54,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-12-02 08:31:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:31:55,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:31:55,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1151569211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:31:55,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:31:55,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2023-12-02 08:31:55,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110363368] [2023-12-02 08:31:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:31:55,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:31:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:31:55,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:31:55,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=261, Unknown=3, NotChecked=102, Total=420 [2023-12-02 08:31:55,203 INFO L87 Difference]: Start difference. First operand 214 states and 284 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:31:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:31:56,545 INFO L93 Difference]: Finished difference Result 559 states and 735 transitions. [2023-12-02 08:31:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:31:56,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-02 08:31:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:31:56,549 INFO L225 Difference]: With dead ends: 559 [2023-12-02 08:31:56,549 INFO L226 Difference]: Without dead ends: 346 [2023-12-02 08:31:56,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=523, Unknown=3, NotChecked=150, Total=812 [2023-12-02 08:31:56,550 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 210 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:31:56,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 347 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 08:31:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-12-02 08:31:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 226. [2023-12-02 08:31:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 196 states have (on average 1.316326530612245) internal successors, (258), 196 states have internal predecessors, (258), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 08:31:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 302 transitions. [2023-12-02 08:31:56,582 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 302 transitions. Word has length 94 [2023-12-02 08:31:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:31:56,582 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 302 transitions. [2023-12-02 08:31:56,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:31:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 302 transitions. [2023-12-02 08:31:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 08:31:56,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:31:56,584 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:31:56,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 08:31:56,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-02 08:31:56,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:56,985 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:31:56,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:31:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash 451838246, now seen corresponding path program 1 times [2023-12-02 08:31:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:31:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92327356] [2023-12-02 08:31:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:56,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:31:56,987 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:31:56,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 08:31:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:57,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 08:31:57,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:31:57,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:31:57,322 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:31:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92327356] [2023-12-02 08:31:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92327356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:31:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:31:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:31:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722057081] [2023-12-02 08:31:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:31:57,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:31:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:31:57,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:31:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:31:57,324 INFO L87 Difference]: Start difference. First operand 226 states and 302 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:31:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:31:58,170 INFO L93 Difference]: Finished difference Result 586 states and 780 transitions. [2023-12-02 08:31:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:31:58,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-02 08:31:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:31:58,174 INFO L225 Difference]: With dead ends: 586 [2023-12-02 08:31:58,174 INFO L226 Difference]: Without dead ends: 361 [2023-12-02 08:31:58,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:31:58,175 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 60 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:31:58,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 401 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 08:31:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-12-02 08:31:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 241. [2023-12-02 08:31:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 211 states have (on average 1.3222748815165877) internal successors, (279), 211 states have internal predecessors, (279), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 08:31:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 323 transitions. [2023-12-02 08:31:58,213 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 323 transitions. Word has length 94 [2023-12-02 08:31:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:31:58,213 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 323 transitions. [2023-12-02 08:31:58,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:31:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 323 transitions. [2023-12-02 08:31:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 08:31:58,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:31:58,215 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:31:58,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-02 08:31:58,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:58,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:31:58,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:31:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash -569230108, now seen corresponding path program 1 times [2023-12-02 08:31:58,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:31:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800761304] [2023-12-02 08:31:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:58,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:31:58,417 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:31:58,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 08:31:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:58,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 08:31:58,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:31:58,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:31:58,684 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:31:58,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800761304] [2023-12-02 08:31:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800761304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:31:58,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:31:58,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:31:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443835228] [2023-12-02 08:31:58,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:31:58,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:31:58,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:31:58,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:31:58,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:31:58,685 INFO L87 Difference]: Start difference. First operand 241 states and 323 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:31:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:31:59,422 INFO L93 Difference]: Finished difference Result 583 states and 765 transitions. [2023-12-02 08:31:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:31:59,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-02 08:31:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:31:59,427 INFO L225 Difference]: With dead ends: 583 [2023-12-02 08:31:59,427 INFO L226 Difference]: Without dead ends: 343 [2023-12-02 08:31:59,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:31:59,429 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 60 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 08:31:59,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 390 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 08:31:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-12-02 08:31:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 223. [2023-12-02 08:31:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 193 states have (on average 1.2746113989637307) internal successors, (246), 193 states have internal predecessors, (246), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 08:31:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 290 transitions. [2023-12-02 08:31:59,454 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 290 transitions. Word has length 94 [2023-12-02 08:31:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:31:59,454 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 290 transitions. [2023-12-02 08:31:59,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:31:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 290 transitions. [2023-12-02 08:31:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 08:31:59,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:31:59,455 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:31:59,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-02 08:31:59,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:59,656 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:31:59,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:31:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1754954375, now seen corresponding path program 1 times [2023-12-02 08:31:59,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:31:59,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719151736] [2023-12-02 08:31:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:59,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:31:59,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:31:59,658 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:31:59,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-02 08:31:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:59,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 08:31:59,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:00,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-12-02 08:32:00,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-12-02 08:32:01,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-12-02 08:32:01,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-12-02 08:32:01,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 08:32:02,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:32:02,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 08:32:03,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:03,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 39 [2023-12-02 08:32:04,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2023-12-02 08:32:04,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 64 [2023-12-02 08:32:05,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:05,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 64 [2023-12-02 08:32:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 33 proven. 153 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 08:32:05,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:06,699 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (forall ((v_ArrVal_598 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_598) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 .cse1) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse0 |c_~#signed_long_int_Array_0~0.offset|)))))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))))) (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse1)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))))) is different from false [2023-12-02 08:32:09,372 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:32:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719151736] [2023-12-02 08:32:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719151736] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2044422778] [2023-12-02 08:32:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:09,373 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:32:09,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:32:09,374 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:32:09,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-12-02 08:32:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:10,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 08:32:10,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:11,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:32:11,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:32:12,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 08:32:13,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2023-12-02 08:32:13,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 08:32:14,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2023-12-02 08:32:15,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 40 [2023-12-02 08:32:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:32:15,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:15,790 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_625) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse0 |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2023-12-02 08:32:15,902 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (_ BitVec 32)) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_623)) |c_~#double_Array_0~0.base| v_ArrVal_625) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul (select .cse0 |c_~#signed_long_int_Array_0~0.offset|) c_~last_1_signed_long_int_Array_0_1__0_~0))))) is different from false [2023-12-02 08:32:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2044422778] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707454761] [2023-12-02 08:32:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:18,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:32:18,202 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:32:18,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 08:32:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:18,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 08:32:18,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:18,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 08:32:19,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 08:32:21,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:32:22,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:22,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2023-12-02 08:32:22,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-02 08:32:22,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:22,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2023-12-02 08:32:23,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:23,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 40 [2023-12-02 08:32:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:32:23,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:24,029 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_652) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul (select .cse0 |c_~#signed_long_int_Array_0~0.offset|) c_~last_1_signed_long_int_Array_0_1__0_~0))))) is different from false [2023-12-02 08:32:24,157 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_651 (_ BitVec 32))) (not (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_651)) |c_~#double_Array_0~0.base| v_ArrVal_652) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul (select .cse0 |c_~#signed_long_int_Array_0~0.offset|) c_~last_1_signed_long_int_Array_0_1__0_~0))))) is different from false [2023-12-02 08:32:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707454761] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:26,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:32:26,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2023-12-02 08:32:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680905442] [2023-12-02 08:32:26,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:32:26,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 08:32:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:32:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 08:32:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1850, Unknown=25, NotChecked=470, Total=2652 [2023-12-02 08:32:26,759 INFO L87 Difference]: Start difference. First operand 223 states and 290 transitions. Second operand has 37 states, 34 states have (on average 4.029411764705882) internal successors, (137), 36 states have internal predecessors, (137), 11 states have call successors, (33), 8 states have call predecessors, (33), 11 states have return successors, (33), 8 states have call predecessors, (33), 11 states have call successors, (33) [2023-12-02 08:32:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:42,791 INFO L93 Difference]: Finished difference Result 700 states and 900 transitions. [2023-12-02 08:32:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 08:32:42,792 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 4.029411764705882) internal successors, (137), 36 states have internal predecessors, (137), 11 states have call successors, (33), 8 states have call predecessors, (33), 11 states have return successors, (33), 8 states have call predecessors, (33), 11 states have call successors, (33) Word has length 94 [2023-12-02 08:32:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:42,794 INFO L225 Difference]: With dead ends: 700 [2023-12-02 08:32:42,794 INFO L226 Difference]: Without dead ends: 478 [2023-12-02 08:32:42,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=961, Invalid=4146, Unknown=25, NotChecked=720, Total=5852 [2023-12-02 08:32:42,797 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1289 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:42,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1175 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2023-12-02 08:32:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-12-02 08:32:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 306. [2023-12-02 08:32:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 260 states have (on average 1.2576923076923077) internal successors, (327), 260 states have internal predecessors, (327), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-02 08:32:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 393 transitions. [2023-12-02 08:32:42,850 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 393 transitions. Word has length 94 [2023-12-02 08:32:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:42,850 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 393 transitions. [2023-12-02 08:32:42,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 4.029411764705882) internal successors, (137), 36 states have internal predecessors, (137), 11 states have call successors, (33), 8 states have call predecessors, (33), 11 states have return successors, (33), 8 states have call predecessors, (33), 11 states have call successors, (33) [2023-12-02 08:32:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 393 transitions. [2023-12-02 08:32:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-02 08:32:42,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:42,852 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:32:42,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-02 08:32:43,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-12-02 08:32:43,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-12-02 08:32:43,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:32:43,453 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:32:43,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2103308488, now seen corresponding path program 1 times [2023-12-02 08:32:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:32:43,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570871429] [2023-12-02 08:32:43,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:32:43,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:32:43,454 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:32:43,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-02 08:32:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:43,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:32:43,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:32:43,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:32:43,714 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:32:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570871429] [2023-12-02 08:32:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570871429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:32:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672862088] [2023-12-02 08:32:43,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:43,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:32:43,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:32:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:32:43,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:32:43,716 INFO L87 Difference]: Start difference. First operand 306 states and 393 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:32:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:43,937 INFO L93 Difference]: Finished difference Result 550 states and 714 transitions. [2023-12-02 08:32:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:32:43,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2023-12-02 08:32:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:43,940 INFO L225 Difference]: With dead ends: 550 [2023-12-02 08:32:43,940 INFO L226 Difference]: Without dead ends: 328 [2023-12-02 08:32:43,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:32:43,941 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:43,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 483 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:32:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-12-02 08:32:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 309. [2023-12-02 08:32:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 263 states have (on average 1.2547528517110267) internal successors, (330), 263 states have internal predecessors, (330), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-02 08:32:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 396 transitions. [2023-12-02 08:32:43,998 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 396 transitions. Word has length 95 [2023-12-02 08:32:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:43,998 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 396 transitions. [2023-12-02 08:32:43,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:32:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 396 transitions. [2023-12-02 08:32:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-02 08:32:43,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:43,999 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:32:44,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-02 08:32:44,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:32:44,200 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:32:44,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash -442933807, now seen corresponding path program 1 times [2023-12-02 08:32:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:32:44,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315747292] [2023-12-02 08:32:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:44,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:32:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:32:44,202 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:32:44,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-02 08:32:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:44,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 08:32:44,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:45,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:32:46,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:32:46,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:32:47,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:32:47,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:32:47,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:32:47,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:47,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 98 [2023-12-02 08:32:48,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 153 [2023-12-02 08:32:49,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:49,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 384 treesize of output 134 [2023-12-02 08:32:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-12-02 08:32:49,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:50,048 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_93| (_ BitVec 64))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_93|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_93|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_93|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_93|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_93|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_707) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:32:50,116 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_703 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_93| (_ BitVec 64))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_703) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_93|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_93|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_93|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_93|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_93|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_707) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:32:50,183 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_703 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_93| (_ BitVec 64)) (v_ArrVal_702 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_702))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_703) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_93|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_93|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_93|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_93|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_93|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_707) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2023-12-02 08:32:50,245 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:32:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315747292] [2023-12-02 08:32:50,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315747292] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1233981090] [2023-12-02 08:32:50,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:50,246 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:32:50,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:32:50,247 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:32:50,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 08:32:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:51,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 08:32:51,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:52,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 08:32:53,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:32:54,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:32:55,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:32:56,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:32:56,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:32:56,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 100 [2023-12-02 08:32:57,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 118 [2023-12-02 08:32:58,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 151 [2023-12-02 08:32:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-12-02 08:32:59,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:59,190 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_739) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2023-12-02 08:32:59,251 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_98| (_ BitVec 64))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_98|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_98|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_739) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_98|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_98|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_98|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:32:59,321 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_98| (_ BitVec 64)) (v_ArrVal_735 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_735) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_98|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_98|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_98|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_98|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_98|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_739) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:32:59,395 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_98| (_ BitVec 64)) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_735 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_734))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_735) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_98|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_98|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_739) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_98|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_98|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_98|)))))))) is different from false [2023-12-02 08:32:59,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1233981090] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:59,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069163808] [2023-12-02 08:32:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:59,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:59,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:32:59,457 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:32:59,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 08:33:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:01,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 08:33:01,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:02,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2023-12-02 08:33:11,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 102 [2023-12-02 08:33:12,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 102 [2023-12-02 08:33:13,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 102 [2023-12-02 08:33:13,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 102 [2023-12-02 08:33:18,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 102 [2023-12-02 08:33:18,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:33:18,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 102 [2023-12-02 08:33:18,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 153 [2023-12-02 08:33:19,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:33:19,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 384 treesize of output 134 [2023-12-02 08:33:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-02 08:33:19,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:19,486 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_103| (_ BitVec 64))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_103|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_103|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_103|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_103|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_103|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_707) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:33:19,559 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_103| (_ BitVec 64)) (v_ArrVal_768 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_768) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_103|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_103|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_707) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_103|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_103|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_103|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:33:19,619 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_103| (_ BitVec 64)) (v_ArrVal_767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_768 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_767))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_768) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_103|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_103|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_707) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_103|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_103|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_103|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 08:33:19,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069163808] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:19,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:33:19,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 27 [2023-12-02 08:33:19,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411203798] [2023-12-02 08:33:19,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:33:19,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 08:33:19,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:33:19,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 08:33:19,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=879, Unknown=26, NotChecked=690, Total=1722 [2023-12-02 08:33:19,675 INFO L87 Difference]: Start difference. First operand 309 states and 396 transitions. Second operand has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 27 states have internal predecessors, (110), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2023-12-02 08:33:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:33:33,356 INFO L93 Difference]: Finished difference Result 765 states and 969 transitions. [2023-12-02 08:33:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 08:33:33,357 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 27 states have internal predecessors, (110), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 95 [2023-12-02 08:33:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:33:33,360 INFO L225 Difference]: With dead ends: 765 [2023-12-02 08:33:33,360 INFO L226 Difference]: Without dead ends: 763 [2023-12-02 08:33:33,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=339, Invalid=1931, Unknown=26, NotChecked=1010, Total=3306 [2023-12-02 08:33:33,361 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 614 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:33:33,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 598 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-12-02 08:33:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-12-02 08:33:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 555. [2023-12-02 08:33:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 479 states have (on average 1.2505219206680585) internal successors, (599), 479 states have internal predecessors, (599), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:33:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 707 transitions. [2023-12-02 08:33:33,450 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 707 transitions. Word has length 95 [2023-12-02 08:33:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:33:33,451 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 707 transitions. [2023-12-02 08:33:33,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 27 states have internal predecessors, (110), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2023-12-02 08:33:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 707 transitions. [2023-12-02 08:33:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-02 08:33:33,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:33:33,453 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:33:33,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-02 08:33:33,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 08:33:33,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 08:33:34,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:33:34,054 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:33:34,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:34,054 INFO L85 PathProgramCache]: Analyzing trace with hash -935559981, now seen corresponding path program 1 times [2023-12-02 08:33:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:33:34,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080945656] [2023-12-02 08:33:34,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:34,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:33:34,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:33:34,056 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:33:34,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-02 08:33:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:34,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:33:34,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-12-02 08:33:34,280 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:33:34,280 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:33:34,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080945656] [2023-12-02 08:33:34,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080945656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:33:34,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:33:34,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:33:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980603412] [2023-12-02 08:33:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:33:34,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:33:34,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:33:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:33:34,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:33:34,282 INFO L87 Difference]: Start difference. First operand 555 states and 707 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:33:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:33:34,477 INFO L93 Difference]: Finished difference Result 1036 states and 1325 transitions. [2023-12-02 08:33:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:33:34,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2023-12-02 08:33:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:33:34,481 INFO L225 Difference]: With dead ends: 1036 [2023-12-02 08:33:34,481 INFO L226 Difference]: Without dead ends: 567 [2023-12-02 08:33:34,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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-12-02 08:33:34,483 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:33:34,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 300 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:33:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2023-12-02 08:33:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 555. [2023-12-02 08:33:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 479 states have (on average 1.244258872651357) internal successors, (596), 479 states have internal predecessors, (596), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:33:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 704 transitions. [2023-12-02 08:33:34,576 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 704 transitions. Word has length 95 [2023-12-02 08:33:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:33:34,577 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 704 transitions. [2023-12-02 08:33:34,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:33:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 704 transitions. [2023-12-02 08:33:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-02 08:33:34,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:33:34,579 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:33:34,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-12-02 08:33:34,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:33:34,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:33:34,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:34,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1241884375, now seen corresponding path program 1 times [2023-12-02 08:33:34,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:33:34,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715072552] [2023-12-02 08:33:34,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:34,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:33:34,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:33:34,785 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:33:34,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-02 08:33:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:35,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 08:33:35,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:35,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:33:36,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:33:37,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:33:37,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:33:38,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:33:38,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:33:38,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:33:38,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 96 [2023-12-02 08:33:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 151 [2023-12-02 08:33:39,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:33:39,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 132 [2023-12-02 08:33:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-02 08:33:40,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:40,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:33:40,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_820) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:33:41,066 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_819))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_820) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 08:33:41,119 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:33:41,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715072552] [2023-12-02 08:33:41,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715072552] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:41,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [15352156] [2023-12-02 08:33:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:41,120 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:33:41,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:33:41,121 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:33:41,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 08:33:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:42,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 08:33:42,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:43,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 08:33:50,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:33:51,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:33:52,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:33:53,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:33:53,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:33:53,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 98 [2023-12-02 08:33:54,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-12-02 08:33:57,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 81 [2023-12-02 08:33:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-02 08:33:57,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:57,672 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_115| (_ BitVec 64)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_115|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_115|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_115|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:33:57,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_115| (_ BitVec 64)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_850) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_115|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_115|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_115|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:33:57,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_115| (_ BitVec 64)) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_849))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_850) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_115|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_115|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_115|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_115|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2023-12-02 08:33:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [15352156] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355636197] [2023-12-02 08:33:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:33:57,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:33:57,873 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:33:57,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 08:33:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:58,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 08:33:58,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:59,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-02 08:34:08,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 108 [2023-12-02 08:34:09,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 108 [2023-12-02 08:34:09,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 108 [2023-12-02 08:34:10,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 108 [2023-12-02 08:34:15,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 108 [2023-12-02 08:34:15,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:34:15,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 104 [2023-12-02 08:34:15,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 151 [2023-12-02 08:34:16,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:34:16,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 132 [2023-12-02 08:34:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 139 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-02 08:34:16,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:34:16,591 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_120|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_120|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:34:16,649 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (v_ArrVal_880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_880) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_120|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_120|))))))) is different from false [2023-12-02 08:34:16,710 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (v_ArrVal_880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_879))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_880) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_120|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_120|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_120|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_822) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2023-12-02 08:34:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355636197] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:16,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:34:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 19] total 39 [2023-12-02 08:34:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802578609] [2023-12-02 08:34:16,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:34:16,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 08:34:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:34:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 08:34:16,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1714, Unknown=30, NotChecked=828, Total=2756 [2023-12-02 08:34:16,767 INFO L87 Difference]: Start difference. First operand 555 states and 704 transitions. Second operand has 40 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 36 states have internal predecessors, (125), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) [2023-12-02 08:34:19,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:21,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:23,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:27,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:33,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:35,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:37,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:39,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:41,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:43,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:48,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:50,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:52,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:54,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:56,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:34:58,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:35:00,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:35:02,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:35:30,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:35:34,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:35:40,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:35:42,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:35:44,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:35:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:44,840 INFO L93 Difference]: Finished difference Result 1307 states and 1631 transitions. [2023-12-02 08:35:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 08:35:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 36 states have internal predecessors, (125), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) Word has length 97 [2023-12-02 08:35:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:44,846 INFO L225 Difference]: With dead ends: 1307 [2023-12-02 08:35:44,846 INFO L226 Difference]: Without dead ends: 1305 [2023-12-02 08:35:44,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 311 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=796, Invalid=5521, Unknown=39, NotChecked=1476, Total=7832 [2023-12-02 08:35:44,850 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 504 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 3202 mSolverCounterSat, 124 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 3348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3202 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:44,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1197 Invalid, 3348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3202 Invalid, 22 Unknown, 0 Unchecked, 62.0s Time] [2023-12-02 08:35:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2023-12-02 08:35:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 598. [2023-12-02 08:35:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 508 states have (on average 1.2303149606299213) internal successors, (625), 510 states have internal predecessors, (625), 61 states have call successors, (61), 28 states have call predecessors, (61), 28 states have return successors, (61), 59 states have call predecessors, (61), 61 states have call successors, (61) [2023-12-02 08:35:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 747 transitions. [2023-12-02 08:35:44,950 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 747 transitions. Word has length 97 [2023-12-02 08:35:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:44,951 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 747 transitions. [2023-12-02 08:35:44,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 36 states have internal predecessors, (125), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) [2023-12-02 08:35:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 747 transitions. [2023-12-02 08:35:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-02 08:35:44,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:44,952 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:35:44,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-12-02 08:35:45,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 08:35:45,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-12-02 08:35:45,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:35:45,553 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:35:45,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2099142763, now seen corresponding path program 1 times [2023-12-02 08:35:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:35:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597333820] [2023-12-02 08:35:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:45,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:35:45,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:35:45,555 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:35:45,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-02 08:35:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:45,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:35:45,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:35:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 08:35:45,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:35:45,821 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:35:45,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597333820] [2023-12-02 08:35:45,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597333820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:45,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:35:45,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:35:45,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643638134] [2023-12-02 08:35:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:45,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:35:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:35:45,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:35:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:35:45,822 INFO L87 Difference]: Start difference. First operand 598 states and 747 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 08:35:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:46,161 INFO L93 Difference]: Finished difference Result 1021 states and 1269 transitions. [2023-12-02 08:35:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:35:46,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2023-12-02 08:35:46,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:46,164 INFO L225 Difference]: With dead ends: 1021 [2023-12-02 08:35:46,164 INFO L226 Difference]: Without dead ends: 501 [2023-12-02 08:35:46,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:35:46,165 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:46,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 407 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:35:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-12-02 08:35:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 483. [2023-12-02 08:35:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 423 states have (on average 1.2245862884160756) internal successors, (518), 425 states have internal predecessors, (518), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:35:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 598 transitions. [2023-12-02 08:35:46,248 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 598 transitions. Word has length 97 [2023-12-02 08:35:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:46,248 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 598 transitions. [2023-12-02 08:35:46,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 08:35:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 598 transitions. [2023-12-02 08:35:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 08:35:46,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:46,250 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:35:46,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-12-02 08:35:46,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:35:46,450 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:35:46,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:46,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1614009185, now seen corresponding path program 1 times [2023-12-02 08:35:46,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:35:46,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289790708] [2023-12-02 08:35:46,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:46,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:35:46,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:35:46,452 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:35:46,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-02 08:35:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:46,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 08:35:46,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:35:47,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:35:47,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:35:47,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:35:48,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 08:35:48,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-12-02 08:35:48,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2023-12-02 08:35:49,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:35:49,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 29 [2023-12-02 08:35:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:35:49,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:35:49,736 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_932))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) is different from false [2023-12-02 08:35:49,823 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_932))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))) is different from false [2023-12-02 08:35:49,879 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse0))) (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse1)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (bvslt (let ((.cse3 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_932))) (let ((.cse4 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse2 (select .cse4 .cse1))) (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse3 |c_~#signed_long_int_Array_0~0.base| (store .cse4 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse0)))) (_ bv2 32)) .cse2))) |c_~#unsigned_char_Array_0~0.base|) .cse0))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))))) is different from false [2023-12-02 08:35:49,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse0 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_930)))) (or (not (bvslt (bvadd (select .cse0 .cse1) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (bvslt (let ((.cse6 (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_932))) (let ((.cse5 (select .cse6 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse4 (select .cse5 .cse1))) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_932) |c_~#signed_long_int_Array_0~0.base| (store .cse5 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse4 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))))) is different from false [2023-12-02 08:35:50,054 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse0 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_930)))) (or (not (bvslt (bvadd (select .cse0 .cse1) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (bvslt (let ((.cse6 (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_932))) (let ((.cse5 (select .cse6 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse4 (select .cse5 .cse1))) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_932) |c_~#signed_long_int_Array_0~0.base| (store .cse5 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse4 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))))) is different from false [2023-12-02 08:35:50,171 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_929))) (let ((.cse7 (select .cse0 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse6 (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store .cse7 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_930))) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse5 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (bvslt (let ((.cse3 (store .cse6 |c_~#double_Array_0~0.base| v_ArrVal_932))) (let ((.cse1 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse2 (select .cse1 .cse5))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_932) |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse2 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse4))) .cse2)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)) (not (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse4))) (select .cse7 .cse5)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))))))) is different from false [2023-12-02 08:35:50,302 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:35:50,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289790708] [2023-12-02 08:35:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289790708] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:35:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [807408694] [2023-12-02 08:35:50,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:50,303 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:35:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:35:50,304 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:35:50,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-12-02 08:35:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:51,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 08:35:51,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:35:53,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-02 08:35:53,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-12-02 08:35:54,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2023-12-02 08:35:54,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2023-12-02 08:35:57,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 55 [2023-12-02 08:35:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-02 08:35:57,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:35:57,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [807408694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:57,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:35:57,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 24 [2023-12-02 08:35:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520211409] [2023-12-02 08:35:57,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:57,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 08:35:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:35:57,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 08:35:57,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=664, Unknown=6, NotChecked=342, Total=1122 [2023-12-02 08:35:57,488 INFO L87 Difference]: Start difference. First operand 483 states and 598 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:36:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:36:04,115 INFO L93 Difference]: Finished difference Result 823 states and 1016 transitions. [2023-12-02 08:36:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 08:36:04,119 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-02 08:36:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:36:04,121 INFO L225 Difference]: With dead ends: 823 [2023-12-02 08:36:04,121 INFO L226 Difference]: Without dead ends: 610 [2023-12-02 08:36:04,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=180, Invalid=1028, Unknown=6, NotChecked=426, Total=1640 [2023-12-02 08:36:04,122 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 339 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:36:04,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 523 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-02 08:36:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2023-12-02 08:36:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 489. [2023-12-02 08:36:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 429 states have (on average 1.2214452214452214) internal successors, (524), 431 states have internal predecessors, (524), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:36:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2023-12-02 08:36:04,206 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 98 [2023-12-02 08:36:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:36:04,206 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2023-12-02 08:36:04,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:36:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2023-12-02 08:36:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 08:36:04,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:36:04,208 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:36:04,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-12-02 08:36:04,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2023-12-02 08:36:04,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:36:04,615 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:36:04,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:36:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 61558178, now seen corresponding path program 1 times [2023-12-02 08:36:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:36:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274010530] [2023-12-02 08:36:04,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:04,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:36:04,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:36:04,617 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:36:04,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-02 08:36:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:04,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 08:36:04,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:36:05,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:36:05,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:36:06,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:36:06,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 08:36:06,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-12-02 08:36:06,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2023-12-02 08:36:07,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:36:07,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 30 [2023-12-02 08:36:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:36:07,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:36:07,785 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_987 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (not (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_987))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) is different from false [2023-12-02 08:36:07,838 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (forall ((v_ArrVal_987 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (not (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_987))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 .cse4))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32)) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3))) (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse4)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))))) is different from false [2023-12-02 08:36:07,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (v_ArrVal_985 (_ BitVec 32)) (v_ArrVal_987 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse5 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse6 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_985))) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (not (bvslt (let ((.cse2 (store .cse5 |c_~#double_Array_0~0.base| v_ArrVal_987))) (let ((.cse0 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse1 (select .cse0 .cse4))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_987) |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))) .cse1)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 |c_~#unsigned_char_Array_0~0.base|) .cse3))) (select .cse6 .cse4)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))))) is different from false [2023-12-02 08:36:08,002 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_985 (_ BitVec 32)) (v_ArrVal_987 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse0 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse0 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_985)))) (or (bvslt (bvadd (select .cse0 .cse1) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)) (not (bvslt (let ((.cse6 (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_987))) (let ((.cse5 (select .cse6 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse4 (select .cse5 .cse1))) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_987) |c_~#signed_long_int_Array_0~0.base| (store .cse5 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse4 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))))))) is different from false [2023-12-02 08:36:08,127 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (v_ArrVal_984 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_985 (_ BitVec 32)) (v_ArrVal_987 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse1 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_984))) (let ((.cse7 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse5 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse6 (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse7 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_985))) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (not (bvslt (let ((.cse3 (store .cse6 |c_~#double_Array_0~0.base| v_ArrVal_987))) (let ((.cse2 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 .cse5))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse1 |c_~#double_Array_0~0.base| v_ArrVal_987) |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse4))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) (bvslt (bvadd (select .cse7 .cse5) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse4)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))))))) is different from false [2023-12-02 08:36:08,269 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:36:08,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274010530] [2023-12-02 08:36:08,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274010530] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:36:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1723257431] [2023-12-02 08:36:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:08,270 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:36:08,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:36:08,271 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:36:08,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 08:36:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:09,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 08:36:09,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:36:11,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-02 08:36:11,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-12-02 08:36:11,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-12-02 08:36:12,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2023-12-02 08:36:14,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 42 [2023-12-02 08:36:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:36:14,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:36:14,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1723257431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:36:14,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:36:14,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 21 [2023-12-02 08:36:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562758694] [2023-12-02 08:36:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:36:14,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 08:36:14,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:36:14,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 08:36:14,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=532, Unknown=5, NotChecked=250, Total=870 [2023-12-02 08:36:14,845 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:36:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:36:24,456 INFO L93 Difference]: Finished difference Result 870 states and 1076 transitions. [2023-12-02 08:36:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 08:36:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-02 08:36:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:36:24,460 INFO L225 Difference]: With dead ends: 870 [2023-12-02 08:36:24,460 INFO L226 Difference]: Without dead ends: 651 [2023-12-02 08:36:24,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=178, Invalid=959, Unknown=5, NotChecked=340, Total=1482 [2023-12-02 08:36:24,461 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 321 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:36:24,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 470 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-02 08:36:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2023-12-02 08:36:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 508. [2023-12-02 08:36:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 448 states have (on average 1.21875) internal successors, (546), 450 states have internal predecessors, (546), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:36:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 626 transitions. [2023-12-02 08:36:24,544 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 626 transitions. Word has length 98 [2023-12-02 08:36:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:36:24,545 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 626 transitions. [2023-12-02 08:36:24,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:36:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 626 transitions. [2023-12-02 08:36:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-02 08:36:24,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:36:24,546 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:36:24,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-02 08:36:24,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2023-12-02 08:36:24,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:36:24,947 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:36:24,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:36:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2035801476, now seen corresponding path program 1 times [2023-12-02 08:36:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:36:24,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979943274] [2023-12-02 08:36:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:24,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:36:24,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:36:24,949 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:36:24,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-02 08:36:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:25,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 08:36:25,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:36:26,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-02 08:36:27,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 110 [2023-12-02 08:36:27,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 110 [2023-12-02 08:36:28,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 110 [2023-12-02 08:36:29,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 110 [2023-12-02 08:36:29,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 110 [2023-12-02 08:36:29,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:36:29,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 106 [2023-12-02 08:36:29,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 169 [2023-12-02 08:36:30,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:36:30,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 404 treesize of output 142 [2023-12-02 08:36:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-12-02 08:36:31,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:36:31,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1045) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2023-12-02 08:36:31,849 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_140| (_ BitVec 64))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_140|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_140|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_140|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_140|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_140|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1045) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:36:31,959 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_140| (_ BitVec 64))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1042) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_140|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_140|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1045) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_140|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_140|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_140|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:36:32,036 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_140| (_ BitVec 64))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1041))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1042) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_140|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_140|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1045) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_140|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_140|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_140|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 08:36:32,085 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:36:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979943274] [2023-12-02 08:36:32,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979943274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:36:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [227290516] [2023-12-02 08:36:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:32,085 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:36:32,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:36:32,086 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:36:32,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 08:36:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:33,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 08:36:33,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:36:34,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 08:36:35,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:36:36,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:36:36,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:36:37,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:36:37,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 08:36:38,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 100 [2023-12-02 08:36:38,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-12-02 08:36:39,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 81 [2023-12-02 08:36:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-12-02 08:36:39,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:36:39,937 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1077) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2023-12-02 08:36:39,979 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_145| (_ BitVec 64)) (v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_145|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_145|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1077) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_145|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_145|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_145|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:36:40,082 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_145| (_ BitVec 64)) (v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1074) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_145|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_145|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_145|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_145|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_145|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1077) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:36:40,145 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_145| (_ BitVec 64)) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1073))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1074) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_145|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_145|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_145|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_145|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_145|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1077) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2023-12-02 08:36:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [227290516] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:36:40,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025385575] [2023-12-02 08:36:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:40,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:36:40,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:36:40,199 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:36:40,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 08:36:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:40,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 08:36:40,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:36:41,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-12-02 08:36:54,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:36:55,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:36:56,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:36:56,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:36:59,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-12-02 08:36:59,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:36:59,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 98 [2023-12-02 08:37:00,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 169 [2023-12-02 08:37:01,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:37:01,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 404 treesize of output 142 [2023-12-02 08:37:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-02 08:37:01,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:37:02,455 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_149| (_ BitVec 64)) (v_ArrVal_1110 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_149|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_149|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_149|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1110) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:37:02,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_149| (_ BitVec 64)) (v_ArrVal_1110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1107) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_149|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_149|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1110) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_149|))))))) is different from false [2023-12-02 08:37:02,643 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_149| (_ BitVec 64)) (v_ArrVal_1110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1106))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1107) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_149|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_149|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1110) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_149|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_149|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 08:37:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025385575] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:37:02,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:37:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 29 [2023-12-02 08:37:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023786269] [2023-12-02 08:37:02,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:37:02,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 08:37:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:37:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 08:37:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1046, Unknown=39, NotChecked=836, Total=2070 [2023-12-02 08:37:02,704 INFO L87 Difference]: Start difference. First operand 508 states and 626 transitions. Second operand has 30 states, 30 states have (on average 4.3) internal successors, (129), 29 states have internal predecessors, (129), 6 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2023-12-02 08:37:15,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:37:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:37:19,639 INFO L93 Difference]: Finished difference Result 1003 states and 1237 transitions. [2023-12-02 08:37:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 08:37:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.3) internal successors, (129), 29 states have internal predecessors, (129), 6 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) Word has length 100 [2023-12-02 08:37:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:37:19,643 INFO L225 Difference]: With dead ends: 1003 [2023-12-02 08:37:19,643 INFO L226 Difference]: Without dead ends: 1001 [2023-12-02 08:37:19,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=431, Invalid=2326, Unknown=43, NotChecked=1232, Total=4032 [2023-12-02 08:37:19,645 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 908 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:37:19,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 563 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2023-12-02 08:37:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2023-12-02 08:37:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 775. [2023-12-02 08:37:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 694 states have (on average 1.2334293948126802) internal successors, (856), 694 states have internal predecessors, (856), 54 states have call successors, (54), 26 states have call predecessors, (54), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:37:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 964 transitions. [2023-12-02 08:37:19,739 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 964 transitions. Word has length 100 [2023-12-02 08:37:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:37:19,740 INFO L495 AbstractCegarLoop]: Abstraction has 775 states and 964 transitions. [2023-12-02 08:37:19,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.3) internal successors, (129), 29 states have internal predecessors, (129), 6 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2023-12-02 08:37:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 964 transitions. [2023-12-02 08:37:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 08:37:19,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:37:19,742 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:37:19,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-12-02 08:37:19,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-12-02 08:37:20,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2023-12-02 08:37:20,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:37:20,343 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:37:20,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:37:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 574317588, now seen corresponding path program 1 times [2023-12-02 08:37:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:37:20,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300901913] [2023-12-02 08:37:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:20,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:20,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:37:20,344 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:37:20,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-02 08:37:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:20,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 08:37:20,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:21,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:37:21,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:37:21,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:37:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:37:21,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:37:21,885 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:37:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300901913] [2023-12-02 08:37:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300901913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:37:21,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:37:21,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:37:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315493257] [2023-12-02 08:37:21,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:37:21,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 08:37:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:37:21,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 08:37:21,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:37:21,886 INFO L87 Difference]: Start difference. First operand 775 states and 964 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:37:23,264 INFO L93 Difference]: Finished difference Result 1753 states and 2204 transitions. [2023-12-02 08:37:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:37:23,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2023-12-02 08:37:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:37:23,270 INFO L225 Difference]: With dead ends: 1753 [2023-12-02 08:37:23,270 INFO L226 Difference]: Without dead ends: 1193 [2023-12-02 08:37:23,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:37:23,271 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 111 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:37:23,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 317 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 08:37:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2023-12-02 08:37:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1149. [2023-12-02 08:37:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1068 states have (on average 1.250936329588015) internal successors, (1336), 1068 states have internal predecessors, (1336), 54 states have call successors, (54), 26 states have call predecessors, (54), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:37:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1444 transitions. [2023-12-02 08:37:23,406 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1444 transitions. Word has length 101 [2023-12-02 08:37:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:37:23,406 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1444 transitions. [2023-12-02 08:37:23,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1444 transitions. [2023-12-02 08:37:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 08:37:23,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:37:23,409 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:37:23,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2023-12-02 08:37:23,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:23,609 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:37:23,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:37:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1945642346, now seen corresponding path program 1 times [2023-12-02 08:37:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:37:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790199021] [2023-12-02 08:37:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:23,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:23,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:37:23,611 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:37:23,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-02 08:37:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:23,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:37:23,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:37:23,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:37:23,938 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:37:23,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790199021] [2023-12-02 08:37:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790199021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:37:23,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:37:23,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:37:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619980384] [2023-12-02 08:37:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:37:23,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:37:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:37:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:37:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:37:23,940 INFO L87 Difference]: Start difference. First operand 1149 states and 1444 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:37:24,667 INFO L93 Difference]: Finished difference Result 2369 states and 2952 transitions. [2023-12-02 08:37:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:37:24,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2023-12-02 08:37:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:37:24,673 INFO L225 Difference]: With dead ends: 2369 [2023-12-02 08:37:24,673 INFO L226 Difference]: Without dead ends: 1517 [2023-12-02 08:37:24,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:37:24,675 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 93 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 08:37:24,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 278 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 08:37:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2023-12-02 08:37:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1395. [2023-12-02 08:37:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1314 states have (on average 1.230593607305936) internal successors, (1617), 1314 states have internal predecessors, (1617), 54 states have call successors, (54), 26 states have call predecessors, (54), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:37:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1725 transitions. [2023-12-02 08:37:24,807 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1725 transitions. Word has length 101 [2023-12-02 08:37:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:37:24,807 INFO L495 AbstractCegarLoop]: Abstraction has 1395 states and 1725 transitions. [2023-12-02 08:37:24,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1725 transitions. [2023-12-02 08:37:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 08:37:24,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:37:24,809 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:37:24,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2023-12-02 08:37:25,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:25,010 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:37:25,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:37:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash 714866198, now seen corresponding path program 1 times [2023-12-02 08:37:25,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:37:25,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346564952] [2023-12-02 08:37:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:25,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:25,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:37:25,012 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:37:25,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-12-02 08:37:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:25,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 08:37:25,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:37:25,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:37:25,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:37:25,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346564952] [2023-12-02 08:37:25,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346564952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:37:25,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:37:25,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:37:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722820063] [2023-12-02 08:37:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:37:25,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:37:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:37:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:37:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:37:25,270 INFO L87 Difference]: Start difference. First operand 1395 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:37:25,395 INFO L93 Difference]: Finished difference Result 2418 states and 2994 transitions. [2023-12-02 08:37:25,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:37:25,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2023-12-02 08:37:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:37:25,400 INFO L225 Difference]: With dead ends: 2418 [2023-12-02 08:37:25,400 INFO L226 Difference]: Without dead ends: 1252 [2023-12-02 08:37:25,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-12-02 08:37:25,402 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:37:25,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:37:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2023-12-02 08:37:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2023-12-02 08:37:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1171 states have (on average 1.219470538001708) internal successors, (1428), 1171 states have internal predecessors, (1428), 54 states have call successors, (54), 26 states have call predecessors, (54), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:37:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1536 transitions. [2023-12-02 08:37:25,502 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1536 transitions. Word has length 101 [2023-12-02 08:37:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:37:25,502 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1536 transitions. [2023-12-02 08:37:25,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1536 transitions. [2023-12-02 08:37:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 08:37:25,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:37:25,506 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:37:25,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2023-12-02 08:37:25,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:25,706 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:37:25,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:37:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -145036864, now seen corresponding path program 1 times [2023-12-02 08:37:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:37:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760888747] [2023-12-02 08:37:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:25,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:25,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:37:25,708 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:37:25,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-02 08:37:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:26,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 08:37:26,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:26,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:26,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:26,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:26,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:27,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:27,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 08:37:28,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 08:37:28,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-12-02 08:37:28,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:37:28,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 59 [2023-12-02 08:37:29,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:37:29,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 42 [2023-12-02 08:37:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 72 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-02 08:37:29,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:37:30,706 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse1 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1206))) (or (not (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))) (bvslt (bvadd .cse0 (select v_ArrVal_1206 .cse1)) .cse0))) (let ((.cse7 (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_1207))) (let ((.cse6 (select .cse7 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse4 (select .cse6 .cse1))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1207) |c_~#signed_long_int_Array_0~0.base| (store .cse6 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse4 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse7 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))) (bvslt (bvadd .cse4 .cse5) .cse5)))))))) is different from false [2023-12-02 08:37:30,940 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:37:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760888747] [2023-12-02 08:37:30,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760888747] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:37:30,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1238132637] [2023-12-02 08:37:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:30,941 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:37:30,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:37:30,942 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:37:30,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2023-12-02 08:37:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:32,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 08:37:32,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:33,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:37:34,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 08:37:34,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2023-12-02 08:37:37,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 37 [2023-12-02 08:37:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:37:37,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:37:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1238132637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:37:37,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:37:37,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2023-12-02 08:37:37,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151734249] [2023-12-02 08:37:37,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:37:37,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:37:37,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:37:37,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:37:37,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=455, Unknown=3, NotChecked=44, Total=600 [2023-12-02 08:37:37,648 INFO L87 Difference]: Start difference. First operand 1252 states and 1536 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:37:41,528 INFO L93 Difference]: Finished difference Result 2553 states and 3143 transitions. [2023-12-02 08:37:41,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:37:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2023-12-02 08:37:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:37:41,535 INFO L225 Difference]: With dead ends: 2553 [2023-12-02 08:37:41,535 INFO L226 Difference]: Without dead ends: 1596 [2023-12-02 08:37:41,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=166, Invalid=647, Unknown=3, NotChecked=54, Total=870 [2023-12-02 08:37:41,537 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 187 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:37:41,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 337 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 08:37:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2023-12-02 08:37:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1345. [2023-12-02 08:37:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1264 states have (on average 1.2159810126582278) internal successors, (1537), 1264 states have internal predecessors, (1537), 54 states have call successors, (54), 26 states have call predecessors, (54), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:37:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1645 transitions. [2023-12-02 08:37:41,645 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1645 transitions. Word has length 101 [2023-12-02 08:37:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:37:41,645 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1645 transitions. [2023-12-02 08:37:41,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1645 transitions. [2023-12-02 08:37:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 08:37:41,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:37:41,647 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:37:41,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Ended with exit code 0 [2023-12-02 08:37:41,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Ended with exit code 0 [2023-12-02 08:37:42,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:37:42,048 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:37:42,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:37:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash 504720545, now seen corresponding path program 1 times [2023-12-02 08:37:42,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:37:42,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650525757] [2023-12-02 08:37:42,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:42,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:42,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:37:42,050 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:37:42,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-12-02 08:37:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:42,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 08:37:42,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:43,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 08:37:43,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 08:37:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:37:43,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:37:43,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:37:43,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650525757] [2023-12-02 08:37:43,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650525757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:37:43,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:37:43,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:37:43,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391250589] [2023-12-02 08:37:43,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:37:43,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:37:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:37:43,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:37:43,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:37:43,672 INFO L87 Difference]: Start difference. First operand 1345 states and 1645 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:37:44,884 INFO L93 Difference]: Finished difference Result 2748 states and 3367 transitions. [2023-12-02 08:37:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:37:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2023-12-02 08:37:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:37:44,891 INFO L225 Difference]: With dead ends: 2748 [2023-12-02 08:37:44,891 INFO L226 Difference]: Without dead ends: 1731 [2023-12-02 08:37:44,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:37:44,892 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 106 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:37:44,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 274 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 08:37:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2023-12-02 08:37:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1693. [2023-12-02 08:37:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1612 states have (on average 1.2140198511166254) internal successors, (1957), 1612 states have internal predecessors, (1957), 54 states have call successors, (54), 26 states have call predecessors, (54), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:37:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2065 transitions. [2023-12-02 08:37:44,979 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2065 transitions. Word has length 102 [2023-12-02 08:37:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:37:44,979 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 2065 transitions. [2023-12-02 08:37:44,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:37:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2065 transitions. [2023-12-02 08:37:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 08:37:44,981 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:37:44,981 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:37:44,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2023-12-02 08:37:45,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:45,182 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:37:45,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:37:45,182 INFO L85 PathProgramCache]: Analyzing trace with hash 566760159, now seen corresponding path program 1 times [2023-12-02 08:37:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:37:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24975285] [2023-12-02 08:37:45,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:45,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:45,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:37:45,184 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:37:45,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-02 08:37:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:45,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:37:45,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:45,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:37:46,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:37:46,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:37:46,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:37:47,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:37:47,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:37:47,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:37:47,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-02 08:37:47,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:37:47,941 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1285 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1285) |c_~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |c_~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (_ bv0 8))) |c_ULTIMATE.start_step_#t~short20#1|) is different from false [2023-12-02 08:37:48,039 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1284)) (.cse1 (bvadd |c_~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (not (= ((_ extract 7 0) (select (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8))) (= ((_ extract 7 0) (select (select (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_1285) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8))))) is different from false [2023-12-02 08:37:48,237 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:37:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24975285] [2023-12-02 08:37:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24975285] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:37:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [971699532] [2023-12-02 08:37:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:48,237 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:37:48,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:37:48,238 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:37:48,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-12-02 08:37:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:48,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 08:37:48,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:49,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 08:37:49,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:49,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:50,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:50,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:50,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:51,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:37:51,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:37:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-12-02 08:37:51,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:37:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [971699532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:37:51,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:37:51,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2023-12-02 08:37:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707409714] [2023-12-02 08:37:51,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:37:51,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:37:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:37:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:37:51,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=295, Unknown=12, NotChecked=74, Total=462 [2023-12-02 08:37:51,569 INFO L87 Difference]: Start difference. First operand 1693 states and 2065 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:37:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:37:53,203 INFO L93 Difference]: Finished difference Result 2956 states and 3629 transitions. [2023-12-02 08:37:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:37:53,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2023-12-02 08:37:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:37:53,209 INFO L225 Difference]: With dead ends: 2956 [2023-12-02 08:37:53,210 INFO L226 Difference]: Without dead ends: 1639 [2023-12-02 08:37:53,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=138, Invalid=410, Unknown=12, NotChecked=90, Total=650 [2023-12-02 08:37:53,211 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 215 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:37:53,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 234 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 08:37:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2023-12-02 08:37:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1585. [2023-12-02 08:37:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1504 states have (on average 1.2174202127659575) internal successors, (1831), 1504 states have internal predecessors, (1831), 54 states have call successors, (54), 26 states have call predecessors, (54), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:37:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 1939 transitions. [2023-12-02 08:37:53,297 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 1939 transitions. Word has length 102 [2023-12-02 08:37:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:37:53,297 INFO L495 AbstractCegarLoop]: Abstraction has 1585 states and 1939 transitions. [2023-12-02 08:37:53,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:37:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1939 transitions. [2023-12-02 08:37:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 08:37:53,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:37:53,299 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:37:53,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Ended with exit code 0 [2023-12-02 08:37:53,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2023-12-02 08:37:53,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:53,699 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:37:53,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:37:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1050707051, now seen corresponding path program 1 times [2023-12-02 08:37:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:37:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531275593] [2023-12-02 08:37:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:53,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:37:53,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:37:53,701 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:37:53,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2023-12-02 08:37:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:53,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 08:37:54,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:54,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:37:55,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:37:55,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:37:55,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 08:37:55,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-12-02 08:37:55,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2023-12-02 08:37:57,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:37:57,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 43 [2023-12-02 08:37:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:37:57,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:37:57,694 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (not (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1343))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32))))) |c_~#unsigned_char_Array_0~0.base|) .cse3)))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) is different from false [2023-12-02 08:37:57,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (not (bvslt (let ((.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1343))) (let ((.cse2 (select .cse1 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse2 .cse4))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (_ bv2 32))))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))) (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3))) (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse4)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))))) is different from false [2023-12-02 08:37:58,096 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1342 (_ BitVec 32)) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse2 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse3 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse0 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_1342)))) (or (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse1))) (select .cse2 .cse3)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)) (not (bvslt (let ((.cse6 (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_1343))) (let ((.cse4 (select .cse6 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse5 (select .cse4 .cse3))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1343) |c_~#signed_long_int_Array_0~0.base| (store .cse4 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse5 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse1)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse1))) .cse5)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))))))) is different from false [2023-12-02 08:37:58,224 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1342 (_ BitVec 32)) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse0 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1340))) (let ((.cse7 (select .cse0 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse5 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse6 (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store .cse7 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_1342))) (.cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (not (bvslt (let ((.cse3 (store .cse6 |c_~#double_Array_0~0.base| v_ArrVal_1343))) (let ((.cse1 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse2 (select .cse1 .cse5))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_1343) |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse2 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse4)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse4))) .cse2)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) (bvslt (bvadd (select .cse7 .cse5) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse4)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))))))) is different from false [2023-12-02 08:37:58,391 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:37:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531275593] [2023-12-02 08:37:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531275593] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:37:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [743470588] [2023-12-02 08:37:58,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:58,392 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:37:58,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:37:58,393 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:37:58,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2023-12-02 08:37:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:59,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 08:37:59,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:38:01,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-02 08:38:01,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2023-12-02 08:38:01,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-12-02 08:38:01,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2023-12-02 08:38:03,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 37 [2023-12-02 08:38:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:38:03,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:38:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [743470588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:38:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:38:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2023-12-02 08:38:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278673660] [2023-12-02 08:38:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:38:03,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:38:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:38:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:38:03,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=442, Unknown=4, NotChecked=180, Total=702 [2023-12-02 08:38:03,675 INFO L87 Difference]: Start difference. First operand 1585 states and 1939 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:38:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:38:06,576 INFO L93 Difference]: Finished difference Result 2429 states and 2971 transitions. [2023-12-02 08:38:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:38:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2023-12-02 08:38:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:38:06,585 INFO L225 Difference]: With dead ends: 2429 [2023-12-02 08:38:06,585 INFO L226 Difference]: Without dead ends: 1701 [2023-12-02 08:38:06,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=133, Invalid=691, Unknown=4, NotChecked=228, Total=1056 [2023-12-02 08:38:06,587 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:38:06,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 238 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 08:38:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2023-12-02 08:38:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1517. [2023-12-02 08:38:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1436 states have (on average 1.2172701949860725) internal successors, (1748), 1436 states have internal predecessors, (1748), 54 states have call successors, (54), 26 states have call predecessors, (54), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 08:38:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1856 transitions. [2023-12-02 08:38:06,675 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1856 transitions. Word has length 102 [2023-12-02 08:38:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:38:06,675 INFO L495 AbstractCegarLoop]: Abstraction has 1517 states and 1856 transitions. [2023-12-02 08:38:06,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:38:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1856 transitions. [2023-12-02 08:38:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 08:38:06,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:38:06,677 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:38:06,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (51)] Ended with exit code 0 [2023-12-02 08:38:06,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Ended with exit code 0 [2023-12-02 08:38:07,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:38:07,078 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:38:07,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:38:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1581347530, now seen corresponding path program 1 times [2023-12-02 08:38:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:38:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082763206] [2023-12-02 08:38:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:38:07,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:38:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:38:07,080 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:38:07,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2023-12-02 08:38:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:38:07,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 08:38:07,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:38:08,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:38:09,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:38:09,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:38:09,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:38:10,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:38:10,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 92 [2023-12-02 08:38:10,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:38:10,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 96 [2023-12-02 08:38:10,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 151 [2023-12-02 08:38:11,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:38:11,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 132 [2023-12-02 08:38:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-02 08:38:12,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:38:13,044 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1401 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_183| (_ BitVec 64))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_183|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_183|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1401) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_183|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_183|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_183|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:38:13,138 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_183| (_ BitVec 64))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1399) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_183|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_183|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_183|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_183|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_183|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1401) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:38:13,195 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1399 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_183| (_ BitVec 64))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1398))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1399) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_183|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_183|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1401) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_183|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_183|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_183|)))))))) is different from false [2023-12-02 08:38:13,244 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:38:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082763206] [2023-12-02 08:38:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082763206] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:38:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1316578905] [2023-12-02 08:38:13,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:38:13,244 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:38:13,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:38:13,245 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:38:13,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2023-12-02 08:38:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:38:14,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 08:38:14,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:38:15,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 08:38:22,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:38:22,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:38:23,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:38:24,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:38:24,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2023-12-02 08:38:24,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 98 [2023-12-02 08:38:25,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 125 [2023-12-02 08:38:26,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 140 [2023-12-02 08:38:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-02 08:38:26,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:38:26,425 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1433) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2023-12-02 08:38:26,469 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_188| (_ BitVec 64)) (v_ArrVal_1433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_188|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_188|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_188|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_188|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_188|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1433) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:38:26,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_188| (_ BitVec 64)) (v_ArrVal_1430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1430) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_188|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_188|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1433) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_188|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_188|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_188|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:38:26,640 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_188| (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1429))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1430) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_188|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_188|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1433) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_188|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_188|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_188|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 08:38:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1316578905] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:38:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255003739] [2023-12-02 08:38:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:38:26,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:38:26,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:38:26,696 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:38:26,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2023-12-02 08:38:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:38:27,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 08:38:27,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:38:28,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2023-12-02 08:38:36,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 100 [2023-12-02 08:38:37,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 100 [2023-12-02 08:38:37,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 100 [2023-12-02 08:38:38,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 100 [2023-12-02 08:38:42,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 100 [2023-12-02 08:38:42,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:38:42,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 100 [2023-12-02 08:38:43,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 151 [2023-12-02 08:38:43,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:38:43,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 132 [2023-12-02 08:38:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 139 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-02 08:38:43,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:38:44,446 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1401 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_193| (_ BitVec 64))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select |c_#memory_int| |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_193|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_193|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1401) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_193|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_193|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_193|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2023-12-02 08:38:44,557 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1401 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_193| (_ BitVec 64))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1462) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_193|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_193|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_193|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_193|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_193|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1401) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 08:38:44,622 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1401 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_193| (_ BitVec 64))) (let ((.cse6 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1461))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1462) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_193|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_193|))) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1401) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_193|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_193|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_193|)))))))) is different from false [2023-12-02 08:38:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255003739] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:38:44,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:38:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 20] total 40 [2023-12-02 08:38:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590907893] [2023-12-02 08:38:44,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:38:44,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 08:38:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:38:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 08:38:44,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1890, Unknown=29, NotChecked=970, Total=3080 [2023-12-02 08:38:44,679 INFO L87 Difference]: Start difference. First operand 1517 states and 1856 transitions. Second operand has 41 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 37 states have internal predecessors, (136), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) [2023-12-02 08:38:48,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:38:50,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:38:54,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:38:58,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:00,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:02,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:04,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:06,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:08,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:12,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:15,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:17,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:19,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:21,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:23,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:25,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:27,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:44,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:48,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:56,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:39:57,184 INFO L93 Difference]: Finished difference Result 2003 states and 2428 transitions. [2023-12-02 08:39:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 08:39:57,185 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 37 states have internal predecessors, (136), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) Word has length 102 [2023-12-02 08:39:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:39:57,191 INFO L225 Difference]: With dead ends: 2003 [2023-12-02 08:39:57,191 INFO L226 Difference]: Without dead ends: 2001 [2023-12-02 08:39:57,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 339 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=817, Invalid=5511, Unknown=32, NotChecked=1650, Total=8010 [2023-12-02 08:39:57,194 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 376 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 3226 mSolverCounterSat, 108 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 3353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3226 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:39:57,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1228 Invalid, 3353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3226 Invalid, 19 Unknown, 0 Unchecked, 57.9s Time] [2023-12-02 08:39:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2023-12-02 08:39:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 994. [2023-12-02 08:39:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 934 states have (on average 1.2119914346895075) internal successors, (1132), 936 states have internal predecessors, (1132), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:39:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1212 transitions. [2023-12-02 08:39:57,265 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1212 transitions. Word has length 102 [2023-12-02 08:39:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:39:57,266 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1212 transitions. [2023-12-02 08:39:57,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 37 states have internal predecessors, (136), 8 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) [2023-12-02 08:39:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1212 transitions. [2023-12-02 08:39:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 08:39:57,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:39:57,267 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:39:57,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (53)] Ended with exit code 0 [2023-12-02 08:39:57,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2023-12-02 08:39:57,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2023-12-02 08:39:57,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:39:57,868 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:39:57,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:39:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 568240185, now seen corresponding path program 1 times [2023-12-02 08:39:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:39:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426816966] [2023-12-02 08:39:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:39:57,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:39:57,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:39:57,870 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:39:57,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2023-12-02 08:39:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:39:58,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 08:39:58,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:39:59,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:39:59,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 08:39:59,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 08:39:59,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:39:59,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 53 [2023-12-02 08:40:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:40:00,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:40:00,135 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:40:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426816966] [2023-12-02 08:40:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426816966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:40:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:40:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 08:40:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640069150] [2023-12-02 08:40:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:40:00,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:40:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:40:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:40:00,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:40:00,137 INFO L87 Difference]: Start difference. First operand 994 states and 1212 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:40:02,343 INFO L93 Difference]: Finished difference Result 1084 states and 1311 transitions. [2023-12-02 08:40:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:40:02,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-12-02 08:40:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:40:02,348 INFO L225 Difference]: With dead ends: 1084 [2023-12-02 08:40:02,348 INFO L226 Difference]: Without dead ends: 1082 [2023-12-02 08:40:02,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-12-02 08:40:02,349 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 08:40:02,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 546 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 08:40:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2023-12-02 08:40:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1056. [2023-12-02 08:40:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 996 states have (on average 1.2058232931726907) internal successors, (1201), 998 states have internal predecessors, (1201), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:40:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1281 transitions. [2023-12-02 08:40:02,419 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1281 transitions. Word has length 103 [2023-12-02 08:40:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:40:02,419 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1281 transitions. [2023-12-02 08:40:02,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1281 transitions. [2023-12-02 08:40:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 08:40:02,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:40:02,421 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:40:02,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Forceful destruction successful, exit code 0 [2023-12-02 08:40:02,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:02,621 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:40:02,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:40:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1951719749, now seen corresponding path program 1 times [2023-12-02 08:40:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:40:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936336472] [2023-12-02 08:40:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:02,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:02,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:40:02,623 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:40:02,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2023-12-02 08:40:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:02,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:40:02,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:02,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 08:40:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:40:02,953 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:40:02,953 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:40:02,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936336472] [2023-12-02 08:40:02,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936336472] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:40:02,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:40:02,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:40:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984868362] [2023-12-02 08:40:02,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:40:02,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:40:02,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:40:02,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:40:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:40:02,955 INFO L87 Difference]: Start difference. First operand 1056 states and 1281 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:40:03,435 INFO L93 Difference]: Finished difference Result 1911 states and 2320 transitions. [2023-12-02 08:40:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:40:03,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-12-02 08:40:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:40:03,441 INFO L225 Difference]: With dead ends: 1911 [2023-12-02 08:40:03,441 INFO L226 Difference]: Without dead ends: 1076 [2023-12-02 08:40:03,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:40:03,443 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 10 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:40:03,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 246 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 08:40:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2023-12-02 08:40:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1056. [2023-12-02 08:40:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 996 states have (on average 1.2018072289156627) internal successors, (1197), 998 states have internal predecessors, (1197), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:40:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1277 transitions. [2023-12-02 08:40:03,554 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1277 transitions. Word has length 103 [2023-12-02 08:40:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:40:03,555 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1277 transitions. [2023-12-02 08:40:03,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1277 transitions. [2023-12-02 08:40:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 08:40:03,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:40:03,556 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:40:03,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Ended with exit code 0 [2023-12-02 08:40:03,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:03,757 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:40:03,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:40:03,757 INFO L85 PathProgramCache]: Analyzing trace with hash 708788795, now seen corresponding path program 1 times [2023-12-02 08:40:03,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:40:03,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116172970] [2023-12-02 08:40:03,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:03,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:03,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:40:03,759 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:40:03,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Waiting until timeout for monitored process [2023-12-02 08:40:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:04,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:40:04,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:04,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 08:40:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:40:04,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:40:04,084 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:40:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116172970] [2023-12-02 08:40:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116172970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:40:04,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:40:04,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:40:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707063675] [2023-12-02 08:40:04,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:40:04,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:40:04,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:40:04,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:40:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:40:04,086 INFO L87 Difference]: Start difference. First operand 1056 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:40:04,530 INFO L93 Difference]: Finished difference Result 1750 states and 2121 transitions. [2023-12-02 08:40:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:40:04,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-12-02 08:40:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:40:04,535 INFO L225 Difference]: With dead ends: 1750 [2023-12-02 08:40:04,535 INFO L226 Difference]: Without dead ends: 882 [2023-12-02 08:40:04,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:40:04,536 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:40:04,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 08:40:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2023-12-02 08:40:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2023-12-02 08:40:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 822 states have (on average 1.1958637469586375) internal successors, (983), 824 states have internal predecessors, (983), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:40:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1063 transitions. [2023-12-02 08:40:04,609 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1063 transitions. Word has length 103 [2023-12-02 08:40:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:40:04,609 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1063 transitions. [2023-12-02 08:40:04,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1063 transitions. [2023-12-02 08:40:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 08:40:04,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:40:04,610 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:40:04,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Ended with exit code 0 [2023-12-02 08:40:04,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:04,811 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:40:04,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:40:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1620217212, now seen corresponding path program 1 times [2023-12-02 08:40:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:40:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824283679] [2023-12-02 08:40:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:04,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:04,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:40:04,812 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:40:04,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2023-12-02 08:40:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:05,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:40:05,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:05,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:40:06,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:40:06,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 08:40:06,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-12-02 08:40:06,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2023-12-02 08:40:07,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:40:07,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 30 [2023-12-02 08:40:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-12-02 08:40:07,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:40:08,328 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (not (bvslt (let ((.cse0 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1560))) (let ((.cse1 (select .cse0 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse3 (select .cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (select (select (store .cse0 |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse2))))) .cse3))) |c_~#unsigned_char_Array_0~0.base|) .cse2)))) .cse3)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))))) is different from false [2023-12-02 08:40:08,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse0))) (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) .cse1)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (forall ((v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (not (bvslt (let ((.cse2 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1560))) (let ((.cse3 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse4 (select .cse3 .cse1))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store .cse3 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse0))))) .cse4))) |c_~#unsigned_char_Array_0~0.base|) .cse0))) .cse4)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|)))))) is different from false [2023-12-02 08:40:08,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (v_ArrVal_1558 (_ BitVec 32)) (v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse6 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse5 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse6 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_1558))) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse4 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|))) (or (not (bvslt (let ((.cse2 (store .cse5 |c_~#double_Array_0~0.base| v_ArrVal_1560))) (let ((.cse1 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse0 (select .cse1 .cse4))) (bvadd .cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1560) |c_~#signed_long_int_Array_0~0.base| (store .cse1 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#unsigned_char_Array_0~0.base|) .cse3))))) .cse0))) |c_~#unsigned_char_Array_0~0.base|) .cse3))))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 |c_~#unsigned_char_Array_0~0.base|) .cse3))) (select .cse6 .cse4)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))))) is different from false [2023-12-02 08:40:08,566 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1558 (_ BitVec 32)) (v_ArrVal_1560 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem95#1| (_ BitVec 8))) (let ((.cse2 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse3 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse0 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_1558)))) (or (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse1))) (select .cse2 .cse3)) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)) (not (bvslt (let ((.cse6 (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_1560))) (let ((.cse4 (select .cse6 |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse5 (select .cse4 .cse3))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1560) |c_~#signed_long_int_Array_0~0.base| (store .cse4 (bvadd |c_~#signed_long_int_Array_0~0.offset| (_ bv12 32)) (bvadd .cse5 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 |c_~#unsigned_char_Array_0~0.base|) .cse1)))))))) |c_~#unsigned_char_Array_0~0.base|) .cse1))) .cse5)))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem95#1|))))))) is different from false [2023-12-02 08:40:08,795 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:40:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824283679] [2023-12-02 08:40:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824283679] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:40:08,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [532436538] [2023-12-02 08:40:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:08,796 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:40:08,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:40:08,797 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:40:08,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (59)] Waiting until timeout for monitored process [2023-12-02 08:40:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:09,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 08:40:09,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:11,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:40:11,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:40:11,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2023-12-02 08:40:12,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-12-02 08:40:14,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 38 [2023-12-02 08:40:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:40:14,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:40:14,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [532436538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:40:14,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:40:14,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2023-12-02 08:40:14,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722334316] [2023-12-02 08:40:14,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:40:14,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:40:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:40:14,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:40:14,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=365, Unknown=4, NotChecked=164, Total=600 [2023-12-02 08:40:14,753 INFO L87 Difference]: Start difference. First operand 882 states and 1063 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:40:19,274 INFO L93 Difference]: Finished difference Result 1619 states and 1950 transitions. [2023-12-02 08:40:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:40:19,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-12-02 08:40:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:40:19,279 INFO L225 Difference]: With dead ends: 1619 [2023-12-02 08:40:19,279 INFO L226 Difference]: Without dead ends: 925 [2023-12-02 08:40:19,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=118, Invalid=596, Unknown=4, NotChecked=212, Total=930 [2023-12-02 08:40:19,280 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:40:19,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 271 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 08:40:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2023-12-02 08:40:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 835. [2023-12-02 08:40:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 775 states have (on average 1.1974193548387098) internal successors, (928), 777 states have internal predecessors, (928), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:40:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1008 transitions. [2023-12-02 08:40:19,362 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1008 transitions. Word has length 103 [2023-12-02 08:40:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:40:19,363 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1008 transitions. [2023-12-02 08:40:19,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1008 transitions. [2023-12-02 08:40:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 08:40:19,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:40:19,364 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:40:19,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (59)] Ended with exit code 0 [2023-12-02 08:40:19,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Ended with exit code 0 [2023-12-02 08:40:19,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:19,765 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:40:19,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:40:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash 725497478, now seen corresponding path program 1 times [2023-12-02 08:40:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:40:19,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249334512] [2023-12-02 08:40:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:19,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:19,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:40:19,767 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:40:19,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2023-12-02 08:40:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:20,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:40:20,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:20,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:40:20,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:40:21,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:40:21,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:40:21,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:40:22,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:40:22,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 08:40:22,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-12-02 08:40:22,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 08:40:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-02 08:40:22,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:40:23,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1617 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1616)) (.cse1 (bvadd |c_~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (not (= ((_ extract 7 0) (select (select (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_1617) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8))))) is different from false [2023-12-02 08:40:23,076 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1615) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1616)) (.cse1 (bvadd |c_~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select (store .cse0 |c_~#double_Array_0~0.base| v_ArrVal_1617) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8)))))) is different from false [2023-12-02 08:40:23,120 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:40:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249334512] [2023-12-02 08:40:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249334512] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:40:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [847445763] [2023-12-02 08:40:23,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:23,120 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:40:23,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:40:23,121 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:40:23,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (61)] Waiting until timeout for monitored process [2023-12-02 08:40:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:23,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 08:40:23,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:24,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 08:40:24,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:40:24,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:40:25,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:40:25,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:40:25,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:40:25,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 08:40:26,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-12-02 08:40:26,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-12-02 08:40:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-12-02 08:40:26,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:40:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [847445763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:40:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:40:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2023-12-02 08:40:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53356764] [2023-12-02 08:40:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:40:26,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:40:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:40:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:40:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=455, Unknown=12, NotChecked=90, Total=650 [2023-12-02 08:40:26,553 INFO L87 Difference]: Start difference. First operand 835 states and 1008 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:40:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:40:28,380 INFO L93 Difference]: Finished difference Result 1351 states and 1622 transitions. [2023-12-02 08:40:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:40:28,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2023-12-02 08:40:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:40:28,383 INFO L225 Difference]: With dead ends: 1351 [2023-12-02 08:40:28,383 INFO L226 Difference]: Without dead ends: 653 [2023-12-02 08:40:28,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=128, Invalid=570, Unknown=12, NotChecked=102, Total=812 [2023-12-02 08:40:28,384 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:40:28,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 258 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 08:40:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-12-02 08:40:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 617. [2023-12-02 08:40:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 557 states have (on average 1.163375224416517) internal successors, (648), 559 states have internal predecessors, (648), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:40:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 728 transitions. [2023-12-02 08:40:28,457 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 728 transitions. Word has length 106 [2023-12-02 08:40:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:40:28,457 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 728 transitions. [2023-12-02 08:40:28,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-02 08:40:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 728 transitions. [2023-12-02 08:40:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 08:40:28,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:40:28,458 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 08:40:28,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Ended with exit code 0 [2023-12-02 08:40:28,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (61)] Ended with exit code 0 [2023-12-02 08:40:28,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:40:28,859 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:40:28,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:40:28,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1402672451, now seen corresponding path program 1 times [2023-12-02 08:40:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:40:28,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390138205] [2023-12-02 08:40:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:28,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:28,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:40:28,861 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:40:28,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2023-12-02 08:40:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:29,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:40:29,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 08:40:29,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:40:29,229 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:40:29,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390138205] [2023-12-02 08:40:29,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390138205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:40:29,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:40:29,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:40:29,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925347645] [2023-12-02 08:40:29,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:40:29,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:40:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:40:29,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:40:29,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:40:29,230 INFO L87 Difference]: Start difference. First operand 617 states and 728 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:40:29,955 INFO L93 Difference]: Finished difference Result 1179 states and 1385 transitions. [2023-12-02 08:40:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:40:29,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2023-12-02 08:40:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:40:29,958 INFO L225 Difference]: With dead ends: 1179 [2023-12-02 08:40:29,958 INFO L226 Difference]: Without dead ends: 699 [2023-12-02 08:40:29,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:40:29,960 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 60 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 08:40:29,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 279 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 08:40:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2023-12-02 08:40:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 607. [2023-12-02 08:40:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 547 states have (on average 1.1590493601462524) internal successors, (634), 549 states have internal predecessors, (634), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 08:40:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 714 transitions. [2023-12-02 08:40:30,045 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 714 transitions. Word has length 107 [2023-12-02 08:40:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:40:30,045 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 714 transitions. [2023-12-02 08:40:30,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 08:40:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 714 transitions. [2023-12-02 08:40:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-02 08:40:30,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:40:30,046 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:40:30,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Ended with exit code 0 [2023-12-02 08:40:30,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:30,247 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:40:30,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:40:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1642983309, now seen corresponding path program 1 times [2023-12-02 08:40:30,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:40:30,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760428023] [2023-12-02 08:40:30,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:30,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:40:30,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:40:30,249 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:40:30,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Waiting until timeout for monitored process [2023-12-02 08:40:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:30,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:40:30,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:32,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:40:33,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:40:34,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:40:34,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2023-12-02 08:40:34,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-02 08:40:35,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:40:35,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2023-12-02 08:40:37,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:40:37,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 40 [2023-12-02 08:40:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 291 proven. 20 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2023-12-02 08:40:37,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:40:40,388 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1715 (_ BitVec 32))) (not (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_1715)) |c_~#double_Array_0~0.base| v_ArrVal_1716) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select .cse0 |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2023-12-02 08:40:42,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((~last_1_signed_long_int_Array_0_1__0_~0 (_ BitVec 32)) (v_ArrVal_1716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1715 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |c_~#signed_long_int_Array_0~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (or (not (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse2 (bvadd (_ bv8 32) |c_~#signed_long_int_Array_0~0.offset|) v_ArrVal_1715)) |c_~#double_Array_0~0.base| v_ArrVal_1716) |c_~#signed_long_int_Array_0~0.base|))) (bvslt (select .cse0 .cse1) (bvmul (select .cse0 |c_~#signed_long_int_Array_0~0.offset|) ~last_1_signed_long_int_Array_0_1__0_~0)))) (bvslt (select .cse2 .cse1) (bvmul (select .cse2 |c_~#signed_long_int_Array_0~0.offset|) ~last_1_signed_long_int_Array_0_1__0_~0))))) is different from false [2023-12-02 08:40:42,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:40:42,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760428023] [2023-12-02 08:40:42,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760428023] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:40:42,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1136143269] [2023-12-02 08:40:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:42,735 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:40:42,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:40:42,736 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:40:42,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46752ef6-91b7-4caf-ad6c-02ff86969be0/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (64)] Waiting until timeout for monitored process