./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21018b8dbfba8116b3b0bab68e9887f4757cf1a4556541f23f42e4d95555f99e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:31:52,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:31:52,386 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:31:52,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:31:52,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:31:52,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:31:52,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:31:52,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:31:52,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:31:52,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:31:52,419 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:31:52,419 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:31:52,419 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:31:52,420 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:31:52,420 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:31:52,420 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:31:52,421 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:31:52,421 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:31:52,421 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:31:52,422 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:31:52,422 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:31:52,424 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:31:52,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:31:52,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:31:52,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:31:52,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:31:52,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:31:52,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:31:52,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:31:52,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:31:52,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:31:52,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:31:52,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:31:52,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:31:52,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:31:52,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:31:52,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:31:52,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:31:52,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:31:52,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:31:52,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:31:52,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:31:52,435 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:31:52,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:31:52,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:31:52,436 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:31:52,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:31:52,436 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_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21018b8dbfba8116b3b0bab68e9887f4757cf1a4556541f23f42e4d95555f99e [2024-11-09 04:31:52,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:31:52,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:31:52,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:31:52,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:31:52,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:31:52,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i Unable to find full path for "g++" [2024-11-09 04:31:54,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:31:55,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:31:55,091 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i [2024-11-09 04:31:55,104 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/data/5f03cde6b/65bb98929d4043a3889cf3dbc4463805/FLAG73a1e20e1 [2024-11-09 04:31:55,423 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/data/5f03cde6b/65bb98929d4043a3889cf3dbc4463805 [2024-11-09 04:31:55,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:31:55,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:31:55,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:31:55,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:31:55,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:31:55,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fd8863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55, skipping insertion in model container [2024-11-09 04:31:55,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:31:55,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i[917,930] [2024-11-09 04:31:55,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:31:55,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:31:55,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i[917,930] [2024-11-09 04:31:55,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:31:55,866 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:31:55,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55 WrapperNode [2024-11-09 04:31:55,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:31:55,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:31:55,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:31:55,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:31:55,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,938 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 537 [2024-11-09 04:31:55,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:31:55,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:31:55,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:31:55,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:31:55,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:31:55,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:31:55,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:31:55,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:31:55,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (1/1) ... [2024-11-09 04:31:55,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:31:56,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:56,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:31:56,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:31:56,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:31:56,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 04:31:56,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:31:56,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 04:31:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:31:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 04:31:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:31:56,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:31:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:31:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:31:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:31:56,222 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:31:56,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:31:56,910 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-09 04:31:56,912 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:31:57,477 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:31:57,480 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 04:31:57,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:31:57 BoogieIcfgContainer [2024-11-09 04:31:57,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:31:57,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:31:57,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:31:57,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:31:57,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:31:55" (1/3) ... [2024-11-09 04:31:57,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1656644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:31:57, skipping insertion in model container [2024-11-09 04:31:57,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:55" (2/3) ... [2024-11-09 04:31:57,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1656644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:31:57, skipping insertion in model container [2024-11-09 04:31:57,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:31:57" (3/3) ... [2024-11-09 04:31:57,494 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-70.i [2024-11-09 04:31:57,510 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:31:57,510 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:31:57,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:31:57,577 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@16725186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:31:57,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:31:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:31:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 04:31:57,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:57,591 INFO L215 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:57,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:57,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:57,597 INFO L85 PathProgramCache]: Analyzing trace with hash 486862778, now seen corresponding path program 1 times [2024-11-09 04:31:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:57,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453990744] [2024-11-09 04:31:57,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:31:59,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:32:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:32:00,984 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:32:00,986 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:32:00,987 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:32:00,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:32:00,993 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 04:32:01,138 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:32:01,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:32:01 BoogieIcfgContainer [2024-11-09 04:32:01,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:32:01,145 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:32:01,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:32:01,146 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:32:01,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:31:57" (3/4) ... [2024-11-09 04:32:01,150 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 04:32:01,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:32:01,153 INFO L158 Benchmark]: Toolchain (without parser) took 5724.52ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 128.2MB in the beginning and 132.0MB in the end (delta: -3.7MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,154 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 92.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:32:01,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.09ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 110.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.75ms. Allocated memory is still 159.4MB. Free memory was 110.8MB in the beginning and 106.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,157 INFO L158 Benchmark]: Boogie Preprocessor took 52.01ms. Allocated memory is still 159.4MB. Free memory was 106.7MB in the beginning and 103.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,158 INFO L158 Benchmark]: RCFGBuilder took 1488.96ms. Allocated memory is still 159.4MB. Free memory was 103.0MB in the beginning and 105.5MB in the end (delta: -2.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,159 INFO L158 Benchmark]: TraceAbstraction took 3661.11ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 104.6MB in the beginning and 133.0MB in the end (delta: -28.4MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,159 INFO L158 Benchmark]: Witness Printer took 6.49ms. Allocated memory is still 255.9MB. Free memory was 133.0MB in the beginning and 132.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:32:01,163 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.27ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 92.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.09ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 110.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.75ms. Allocated memory is still 159.4MB. Free memory was 110.8MB in the beginning and 106.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.01ms. Allocated memory is still 159.4MB. Free memory was 106.7MB in the beginning and 103.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1488.96ms. Allocated memory is still 159.4MB. Free memory was 103.0MB in the beginning and 105.5MB in the end (delta: -2.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3661.11ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 104.6MB in the beginning and 133.0MB in the end (delta: -28.4MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. * Witness Printer took 6.49ms. Allocated memory is still 255.9MB. Free memory was 133.0MB in the beginning and 132.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 103, overapproximation of shiftLeft at line 66, overapproximation of someBinaryArithmeticDOUBLEoperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L29] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L30] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[3]); [L33] double* double_Array_0_arraydouble_Array_0arrayVar4_Pointer = &(double_Array_0[4]); [L34-L36] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[2]); [L40-L42] signed long int signed_long_int_Array_0[1] = { -50 }; [L43] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L44-L46] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L48] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L49-L51] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L52] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L53] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L82] double_Array_0[0] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[0] [L83] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L83] EXPR double_Array_0[0] [L83] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L83] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L83] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L84] double_Array_0[1] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[1] [L85] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L85] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) [L85] EXPR double_Array_0[1] [L85] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L85] EXPR double_Array_0[1] [L85] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L85] EXPR (double_Array_0[1] >= 0.0F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L85] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L86] double_Array_0[3] = __VERIFIER_nondet_double() [L87] EXPR double_Array_0[3] [L87] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L87] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) [L87] EXPR double_Array_0[3] [L87] EXPR double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F [L87] EXPR double_Array_0[3] [L87] EXPR double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F [L87] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L87] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L88] double_Array_0[4] = __VERIFIER_nondet_double() [L89] EXPR double_Array_0[4] [L89] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F [L89] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) [L89] EXPR double_Array_0[4] [L89] EXPR double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F [L89] EXPR double_Array_0[4] [L89] EXPR double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F [L89] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L89] CALL assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L90] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L91] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L91] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L92] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L92] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L93] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L95] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L96] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L97] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L97] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L97] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L98] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L111] RET updateVariables() [L112] CALL step() [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L58] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L58] (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) [L59] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L59] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L62] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L62] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) [L65] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L65] unsigned short int stepLocal_0 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)); [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L66] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L66] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L66] COND TRUE stepLocal_0 <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L67] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L67] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L67] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) [L67] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) [L71] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L71] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)); [L72] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L72] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < stepLocal_1) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L75] (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) = (((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1 [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1) [L103] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1 [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1) [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1)) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L103] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L103] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L103] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) [L103] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L103] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1)) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1)) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) [L103] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1)) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) [L103] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1)) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L103-L104] return ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((17222 - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) + (((((29916) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (29916) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) == ((signed char) 8)) : 1)) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) <= (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 1, TraceHistogramMax: 12, 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=33occurred 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.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 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 [2024-11-09 04:32:01,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21018b8dbfba8116b3b0bab68e9887f4757cf1a4556541f23f42e4d95555f99e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:32:03,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:32:03,829 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 04:32:03,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:32:03,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:32:03,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:32:03,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:32:03,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:32:03,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:32:03,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:32:03,891 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:32:03,891 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:32:03,891 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:32:03,892 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:32:03,892 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:32:03,892 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:32:03,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:32:03,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:32:03,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:32:03,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:32:03,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:32:03,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:32:03,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:32:03,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:32:03,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:32:03,903 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:32:03,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:32:03,904 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:32:03,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:32:03,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:32:03,904 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:32:03,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:32:03,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:32:03,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:32:03,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:32:03,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:32:03,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:32:03,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:32:03,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:32:03,906 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 04:32:03,907 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:32:03,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:32:03,909 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:32:03,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21018b8dbfba8116b3b0bab68e9887f4757cf1a4556541f23f42e4d95555f99e [2024-11-09 04:32:04,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:32:04,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:32:04,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:32:04,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:32:04,336 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:32:04,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i Unable to find full path for "g++" [2024-11-09 04:32:06,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:32:06,842 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:32:06,843 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i [2024-11-09 04:32:06,854 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/data/d033ea7e8/89ea933fc2b04c848e5557cc32aafaf6/FLAGc3b738ae8 [2024-11-09 04:32:06,880 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/data/d033ea7e8/89ea933fc2b04c848e5557cc32aafaf6 [2024-11-09 04:32:06,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:32:06,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:32:06,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:32:06,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:32:06,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:32:06,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:32:06" (1/1) ... [2024-11-09 04:32:06,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d6475b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:06, skipping insertion in model container [2024-11-09 04:32:06,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:32:06" (1/1) ... [2024-11-09 04:32:06,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:32:07,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i[917,930] [2024-11-09 04:32:07,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:32:07,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:32:07,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i[917,930] [2024-11-09 04:32:07,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:32:07,467 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:32:07,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07 WrapperNode [2024-11-09 04:32:07,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:32:07,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:32:07,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:32:07,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:32:07,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,576 INFO L138 Inliner]: procedures = 36, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 508 [2024-11-09 04:32:07,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:32:07,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:32:07,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:32:07,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:32:07,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:32:07,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:32:07,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:32:07,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:32:07,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (1/1) ... [2024-11-09 04:32:07,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:32:07,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:07,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:32:07,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:32:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:32:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 04:32:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 04:32:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 04:32:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-09 04:32:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 04:32:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 04:32:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-09 04:32:07,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 04:32:07,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-09 04:32:07,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:32:07,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:32:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:32:07,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:32:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 04:32:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-09 04:32:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 04:32:07,957 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:32:07,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:32:09,627 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-09 04:32:09,629 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:32:09,647 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:32:09,648 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 04:32:09,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:32:09 BoogieIcfgContainer [2024-11-09 04:32:09,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:32:09,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:32:09,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:32:09,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:32:09,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:32:06" (1/3) ... [2024-11-09 04:32:09,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294026bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:32:09, skipping insertion in model container [2024-11-09 04:32:09,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:07" (2/3) ... [2024-11-09 04:32:09,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294026bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:32:09, skipping insertion in model container [2024-11-09 04:32:09,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:32:09" (3/3) ... [2024-11-09 04:32:09,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-70.i [2024-11-09 04:32:09,679 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:32:09,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:32:09,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:32:09,751 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36dc199d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:32:09,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:32:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 04:32:09,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:09,768 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:09,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:09,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:09,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1349067299, now seen corresponding path program 1 times [2024-11-09 04:32:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:09,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418961191] [2024-11-09 04:32:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:09,791 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 [2024-11-09 04:32:09,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:09,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:09,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:10,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 04:32:10,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-09 04:32:10,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:10,357 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418961191] [2024-11-09 04:32:10,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418961191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:10,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:10,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:32:10,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448978211] [2024-11-09 04:32:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:10,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 04:32:10,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:10,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 04:32:10,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:32:10,394 INFO L87 Difference]: Start difference. First operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:10,424 INFO L93 Difference]: Finished difference Result 195 states and 302 transitions. [2024-11-09 04:32:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 04:32:10,427 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-09 04:32:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:10,434 INFO L225 Difference]: With dead ends: 195 [2024-11-09 04:32:10,435 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 04:32:10,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:32:10,441 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:10,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:32:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 04:32:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 04:32:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-09 04:32:10,486 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 115 [2024-11-09 04:32:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:10,487 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-09 04:32:10,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-09 04:32:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 04:32:10,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:10,491 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:10,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 04:32:10,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:10,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 238939981, now seen corresponding path program 1 times [2024-11-09 04:32:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:10,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837275840] [2024-11-09 04:32:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:10,694 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 [2024-11-09 04:32:10,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:10,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:10,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:11,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:32:11,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 04:32:11,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:11,252 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837275840] [2024-11-09 04:32:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837275840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181477722] [2024-11-09 04:32:11,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:32:11,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:11,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:32:11,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:32:11,260 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:11,377 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2024-11-09 04:32:11,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:32:11,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-09 04:32:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:11,380 INFO L225 Difference]: With dead ends: 193 [2024-11-09 04:32:11,380 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 04:32:11,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:32:11,383 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:11,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 04:32:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 04:32:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-11-09 04:32:11,405 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 115 [2024-11-09 04:32:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:11,407 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-11-09 04:32:11,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-11-09 04:32:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 04:32:11,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:11,412 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:11,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:11,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:11,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:11,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1206290635, now seen corresponding path program 1 times [2024-11-09 04:32:11,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:11,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519981803] [2024-11-09 04:32:11,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:11,615 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 [2024-11-09 04:32:11,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:11,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:11,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:12,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 04:32:12,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:32:12,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:12,174 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519981803] [2024-11-09 04:32:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519981803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:12,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:12,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311497879] [2024-11-09 04:32:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:12,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:12,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:12,177 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:14,445 INFO L93 Difference]: Finished difference Result 206 states and 300 transitions. [2024-11-09 04:32:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 04:32:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:14,448 INFO L225 Difference]: With dead ends: 206 [2024-11-09 04:32:14,448 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 04:32:14,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:14,450 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 13 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:14,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 402 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 04:32:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 04:32:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2024-11-09 04:32:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-11-09 04:32:14,461 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 115 [2024-11-09 04:32:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:14,461 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-11-09 04:32:14,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-11-09 04:32:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 04:32:14,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:14,464 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:14,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:14,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:14,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:14,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash -380292981, now seen corresponding path program 1 times [2024-11-09 04:32:14,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:14,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416476189] [2024-11-09 04:32:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:14,667 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 [2024-11-09 04:32:14,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:14,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:14,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 (5)] Waiting until timeout for monitored process [2024-11-09 04:32:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:15,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:32:15,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:15,157 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 17 treesize of output 9 [2024-11-09 04:32:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:32:15,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:15,201 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416476189] [2024-11-09 04:32:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416476189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:15,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:15,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:32:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831538034] [2024-11-09 04:32:15,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:15,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:32:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:32:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:32:15,204 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:16,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:32:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:16,947 INFO L93 Difference]: Finished difference Result 201 states and 289 transitions. [2024-11-09 04:32:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:32:16,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 04:32:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:16,949 INFO L225 Difference]: With dead ends: 201 [2024-11-09 04:32:16,950 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 04:32:16,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:32:16,952 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:16,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 04:32:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 04:32:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 04:32:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-11-09 04:32:16,961 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 115 [2024-11-09 04:32:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:16,962 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-11-09 04:32:16,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-11-09 04:32:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 04:32:16,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:16,965 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:16,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 (5)] Ended with exit code 0 [2024-11-09 04:32:17,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:17,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:17,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1968640883, now seen corresponding path program 1 times [2024-11-09 04:32:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:17,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840448535] [2024-11-09 04:32:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:17,167 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 [2024-11-09 04:32:17,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:17,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:17,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 04:32:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:17,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:32:17,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:32:17,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:17,782 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840448535] [2024-11-09 04:32:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840448535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:17,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:17,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:17,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731616369] [2024-11-09 04:32:17,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:17,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:32:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:17,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:32:17,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:32:17,785 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:17,840 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2024-11-09 04:32:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:32:17,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 04:32:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:17,843 INFO L225 Difference]: With dead ends: 203 [2024-11-09 04:32:17,843 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 04:32:17,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:32:17,844 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:17,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:32:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 04:32:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 04:32:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-11-09 04:32:17,866 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 115 [2024-11-09 04:32:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:17,866 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-11-09 04:32:17,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-11-09 04:32:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 04:32:17,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:17,873 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:17,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 04:32:18,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:18,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:18,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1874684920, now seen corresponding path program 1 times [2024-11-09 04:32:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:18,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684112025] [2024-11-09 04:32:18,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:18,075 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 [2024-11-09 04:32:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:18,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:18,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:18,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 04:32:18,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:32:18,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:18,686 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:18,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684112025] [2024-11-09 04:32:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684112025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:18,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:18,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:32:18,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639243367] [2024-11-09 04:32:18,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:18,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:18,689 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:18,816 INFO L93 Difference]: Finished difference Result 212 states and 301 transitions. [2024-11-09 04:32:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:18,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-09 04:32:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:18,818 INFO L225 Difference]: With dead ends: 212 [2024-11-09 04:32:18,820 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 04:32:18,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:18,821 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:18,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 644 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 04:32:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 04:32:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2024-11-09 04:32:18,839 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 117 [2024-11-09 04:32:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:18,840 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2024-11-09 04:32:18,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2024-11-09 04:32:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 04:32:18,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:18,846 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:18,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:19,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:19,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:19,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -99677558, now seen corresponding path program 1 times [2024-11-09 04:32:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176822683] [2024-11-09 04:32:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:19,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 [2024-11-09 04:32:19,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:19,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:19,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:19,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 04:32:19,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:32:19,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:19,642 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176822683] [2024-11-09 04:32:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176822683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:32:19,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694262096] [2024-11-09 04:32:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:19,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:32:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:32:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:19,645 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:19,786 INFO L93 Difference]: Finished difference Result 220 states and 307 transitions. [2024-11-09 04:32:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-09 04:32:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:19,788 INFO L225 Difference]: With dead ends: 220 [2024-11-09 04:32:19,789 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 04:32:19,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:19,790 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:19,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 766 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 04:32:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 04:32:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2024-11-09 04:32:19,798 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 117 [2024-11-09 04:32:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:19,798 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2024-11-09 04:32:19,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:32:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-11-09 04:32:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 04:32:19,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:19,801 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:19,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:20,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:20,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:20,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash -97830516, now seen corresponding path program 1 times [2024-11-09 04:32:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:20,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667827734] [2024-11-09 04:32:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:20,003 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 [2024-11-09 04:32:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:20,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:20,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 (9)] Waiting until timeout for monitored process [2024-11-09 04:32:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:20,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:32:20,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:20,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:20,686 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 155 treesize of output 65 [2024-11-09 04:32:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 04:32:20,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:20,753 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:20,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667827734] [2024-11-09 04:32:20,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667827734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:20,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:20,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778142163] [2024-11-09 04:32:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:20,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:20,756 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:24,278 INFO L93 Difference]: Finished difference Result 222 states and 308 transitions. [2024-11-09 04:32:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:24,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-09 04:32:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:24,279 INFO L225 Difference]: With dead ends: 222 [2024-11-09 04:32:24,279 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 04:32:24,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:24,281 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 125 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:24,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 401 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 04:32:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 04:32:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 04:32:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 98 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2024-11-09 04:32:24,289 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 117 [2024-11-09 04:32:24,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:24,289 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2024-11-09 04:32:24,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2024-11-09 04:32:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 04:32:24,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:24,291 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:24,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 (9)] Ended with exit code 0 [2024-11-09 04:32:24,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:24,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:24,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash 257770214, now seen corresponding path program 1 times [2024-11-09 04:32:24,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:24,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771812052] [2024-11-09 04:32:24,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:24,493 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 [2024-11-09 04:32:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:24,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:24,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:24,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:32:24,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:25,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:25,229 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 173 treesize of output 65 [2024-11-09 04:32:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-09 04:32:25,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:25,286 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:25,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771812052] [2024-11-09 04:32:25,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771812052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:25,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:25,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:25,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526857215] [2024-11-09 04:32:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:25,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:25,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:25,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:25,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:25,289 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:27,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:29,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:29,590 INFO L93 Difference]: Finished difference Result 222 states and 306 transitions. [2024-11-09 04:32:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:29,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-09 04:32:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:29,592 INFO L225 Difference]: With dead ends: 222 [2024-11-09 04:32:29,592 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 04:32:29,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:29,593 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 116 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:29,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 397 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 04:32:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 04:32:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 04:32:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 153 transitions. [2024-11-09 04:32:29,605 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 153 transitions. Word has length 119 [2024-11-09 04:32:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:29,605 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 153 transitions. [2024-11-09 04:32:29,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 153 transitions. [2024-11-09 04:32:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 04:32:29,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:29,607 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:29,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:32:29,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:29,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2096349174, now seen corresponding path program 1 times [2024-11-09 04:32:29,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:29,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460438779] [2024-11-09 04:32:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:29,809 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 [2024-11-09 04:32:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:29,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:29,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 04:32:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:30,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 04:32:30,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-09 04:32:30,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:30,402 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:30,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460438779] [2024-11-09 04:32:30,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460438779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:30,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:30,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:32:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933426686] [2024-11-09 04:32:30,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:30,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:30,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:30,405 INFO L87 Difference]: Start difference. First operand 112 states and 153 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 04:32:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:30,743 INFO L93 Difference]: Finished difference Result 225 states and 308 transitions. [2024-11-09 04:32:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:30,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 121 [2024-11-09 04:32:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:30,745 INFO L225 Difference]: With dead ends: 225 [2024-11-09 04:32:30,745 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 04:32:30,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:30,746 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:30,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 579 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:32:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 04:32:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2024-11-09 04:32:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2024-11-09 04:32:30,761 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 121 [2024-11-09 04:32:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:30,761 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2024-11-09 04:32:30,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 04:32:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2024-11-09 04:32:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 04:32:30,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:30,763 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:30,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 04:32:30,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:30,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:30,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash 321554892, now seen corresponding path program 1 times [2024-11-09 04:32:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:30,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335126243] [2024-11-09 04:32:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:30,972 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 [2024-11-09 04:32:30,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:30,974 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:30,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:31,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:32:31,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:31,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:31,804 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 173 treesize of output 65 [2024-11-09 04:32:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 04:32:31,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:31,862 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335126243] [2024-11-09 04:32:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335126243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230822506] [2024-11-09 04:32:31,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:31,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:31,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:31,864 INFO L87 Difference]: Start difference. First operand 112 states and 152 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:34,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:36,005 INFO L93 Difference]: Finished difference Result 222 states and 302 transitions. [2024-11-09 04:32:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-09 04:32:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:36,007 INFO L225 Difference]: With dead ends: 222 [2024-11-09 04:32:36,008 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 04:32:36,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:36,009 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 106 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:36,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 389 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 04:32:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 04:32:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 04:32:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2024-11-09 04:32:36,019 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 121 [2024-11-09 04:32:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:36,020 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2024-11-09 04:32:36,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2024-11-09 04:32:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 04:32:36,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:36,023 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:36,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:36,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:36,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:36,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1373018406, now seen corresponding path program 1 times [2024-11-09 04:32:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805407317] [2024-11-09 04:32:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:36,224 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 [2024-11-09 04:32:36,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:36,225 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:36,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:32:36,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:37,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:37,068 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 175 treesize of output 67 [2024-11-09 04:32:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 04:32:37,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:37,125 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805407317] [2024-11-09 04:32:37,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805407317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:37,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:37,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:37,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643185017] [2024-11-09 04:32:37,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:37,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:37,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:37,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:37,127 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:40,001 INFO L93 Difference]: Finished difference Result 221 states and 299 transitions. [2024-11-09 04:32:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2024-11-09 04:32:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:40,003 INFO L225 Difference]: With dead ends: 221 [2024-11-09 04:32:40,003 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 04:32:40,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:40,004 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 98 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:40,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 383 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 04:32:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 04:32:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-11-09 04:32:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 96 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:32:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2024-11-09 04:32:40,010 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 123 [2024-11-09 04:32:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:40,011 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2024-11-09 04:32:40,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:32:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2024-11-09 04:32:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 04:32:40,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:40,013 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:40,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:32:40,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2090459022, now seen corresponding path program 1 times [2024-11-09 04:32:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:32:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940981751] [2024-11-09 04:32:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:40,214 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 [2024-11-09 04:32:40,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:32:40,216 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:32:40,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 04:32:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:40,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:32:40,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:41,445 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 [2024-11-09 04:32:42,798 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 [2024-11-09 04:32:43,520 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 [2024-11-09 04:32:44,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 18 treesize of output 13 [2024-11-09 04:32:44,937 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 [2024-11-09 04:32:45,648 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 [2024-11-09 04:32:46,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 18 treesize of output 13 [2024-11-09 04:32:46,712 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 [2024-11-09 04:32:47,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-09 04:32:47,452 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 [2024-11-09 04:32:47,525 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 [2024-11-09 04:32:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 237 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 04:32:47,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:47,738 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_395) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)))) is different from false [2024-11-09 04:32:47,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_394) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_395) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)))) is different from false [2024-11-09 04:32:48,102 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:32:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940981751] [2024-11-09 04:32:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940981751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1430031803] [2024-11-09 04:32:48,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:48,102 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:32:48,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:32:48,105 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:32:48,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-09 04:32:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 04:32:49,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:49,905 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 [2024-11-09 04:32:50,679 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 [2024-11-09 04:32:51,258 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 [2024-11-09 04:32:51,816 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 [2024-11-09 04:32:52,456 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 [2024-11-09 04:32:53,117 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 [2024-11-09 04:32:53,673 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 [2024-11-09 04:32:54,177 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 [2024-11-09 04:32:54,632 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 13 treesize of output 1 [2024-11-09 04:32:54,936 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 [2024-11-09 04:32:55,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 17 treesize of output 12 [2024-11-09 04:32:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 04:32:55,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:55,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_437) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (_ bv0 8))) is different from false [2024-11-09 04:32:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1430031803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435124390] [2024-11-09 04:32:55,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:55,723 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:55,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 04:32:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:57,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 04:32:57,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:58,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 17 treesize of output 12 [2024-11-09 04:32:58,739 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 [2024-11-09 04:32:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:32:58,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:58,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435124390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:58,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:32:58,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16, 12] total 28 [2024-11-09 04:32:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869847319] [2024-11-09 04:32:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:32:58,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:32:58,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:32:58,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=930, Unknown=68, NotChecked=204, Total=1406 [2024-11-09 04:32:58,767 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:33:00,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:04,276 INFO L93 Difference]: Finished difference Result 261 states and 351 transitions. [2024-11-09 04:33:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:33:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-09 04:33:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:04,278 INFO L225 Difference]: With dead ends: 261 [2024-11-09 04:33:04,278 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 04:33:04,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=217, Invalid=986, Unknown=69, NotChecked=210, Total=1482 [2024-11-09 04:33:04,280 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:04,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 345 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-09 04:33:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 04:33:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2024-11-09 04:33:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:33:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2024-11-09 04:33:04,288 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 125 [2024-11-09 04:33:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:04,289 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2024-11-09 04:33:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:33:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2024-11-09 04:33:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 04:33:04,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:04,291 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:33:04,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 04:33:04,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:33:04,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-09 04:33:04,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:33:04,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:04,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -973060912, now seen corresponding path program 1 times [2024-11-09 04:33:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:33:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572688090] [2024-11-09 04:33:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:04,893 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 [2024-11-09 04:33:04,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:33:04,894 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:33:04,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 04:33:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:05,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 04:33:05,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:33:05,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:33:05,449 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:33:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572688090] [2024-11-09 04:33:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572688090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:33:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920863522] [2024-11-09 04:33:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:33:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:33:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:33:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:33:05,451 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:33:06,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:10,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:10,191 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2024-11-09 04:33:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:33:10,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-09 04:33:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:10,192 INFO L225 Difference]: With dead ends: 270 [2024-11-09 04:33:10,192 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 04:33:10,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:33:10,193 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 37 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:10,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 369 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 04:33:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 04:33:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 122. [2024-11-09 04:33:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:33:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2024-11-09 04:33:10,201 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 126 [2024-11-09 04:33:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:10,201 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2024-11-09 04:33:10,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:33:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2024-11-09 04:33:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 04:33:10,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:10,203 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:33:10,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 04:33:10,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:33:10,403 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1030925456, now seen corresponding path program 1 times [2024-11-09 04:33:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:33:10,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506977698] [2024-11-09 04:33:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:10,405 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 [2024-11-09 04:33:10,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:33:10,406 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:33:10,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:33:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:10,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:33:10,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:33:10,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:33:10,932 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:33:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506977698] [2024-11-09 04:33:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506977698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:10,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:33:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590701923] [2024-11-09 04:33:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:10,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:33:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:33:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:33:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:33:10,935 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:33:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:11,013 INFO L93 Difference]: Finished difference Result 244 states and 327 transitions. [2024-11-09 04:33:11,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:33:11,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-09 04:33:11,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:11,015 INFO L225 Difference]: With dead ends: 244 [2024-11-09 04:33:11,015 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 04:33:11,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:33:11,016 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:11,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:33:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 04:33:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 04:33:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 111 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:33:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2024-11-09 04:33:11,024 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 126 [2024-11-09 04:33:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:11,025 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2024-11-09 04:33:11,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:33:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2024-11-09 04:33:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:33:11,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:11,027 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:33:11,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:33:11,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:33:11,227 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:11,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1014766391, now seen corresponding path program 1 times [2024-11-09 04:33:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:33:11,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883865507] [2024-11-09 04:33:11,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:11,229 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 [2024-11-09 04:33:11,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:33:11,230 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:33:11,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:33:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:11,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 04:33:11,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:16,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-09 04:33:16,326 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 34 treesize of output 36 [2024-11-09 04:33:16,507 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 73 treesize of output 45 [2024-11-09 04:33:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 04:33:16,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:33:17,451 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_561 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_step_#t~mem12#1_17| (_ BitVec 8))) (not (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_561) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_560))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (_ bv47138 32)))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset .cse1)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_17|) ((_ zero_extend 16) ((_ extract 15 0) .cse1)))))))) is different from false [2024-11-09 04:33:17,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:33:17,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883865507] [2024-11-09 04:33:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883865507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:17,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [512482100] [2024-11-09 04:33:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:17,651 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:33:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:33:17,652 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:33:17,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-09 04:33:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:19,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 04:33:19,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:22,877 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-09 04:33:22,878 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-09 04:33:22,938 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:33:22,939 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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-11-09 04:33:23,534 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 29 [2024-11-09 04:33:23,826 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 36 treesize of output 34 [2024-11-09 04:33:24,522 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 79 treesize of output 67 [2024-11-09 04:33:24,816 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 79 treesize of output 67 [2024-11-09 04:33:25,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 125 treesize of output 81 [2024-11-09 04:33:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:33:25,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:33:25,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [512482100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:25,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:33:25,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [12] total 26 [2024-11-09 04:33:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690617171] [2024-11-09 04:33:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:25,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 04:33:25,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:33:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 04:33:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=899, Unknown=2, NotChecked=60, Total=1056 [2024-11-09 04:33:25,795 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:33:30,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:33,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:40,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:43,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:43,918 INFO L93 Difference]: Finished difference Result 363 states and 477 transitions. [2024-11-09 04:33:43,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 04:33:43,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-09 04:33:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:43,921 INFO L225 Difference]: With dead ends: 363 [2024-11-09 04:33:43,922 INFO L226 Difference]: Without dead ends: 241 [2024-11-09 04:33:43,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=234, Invalid=1930, Unknown=2, NotChecked=90, Total=2256 [2024-11-09 04:33:43,924 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 486 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:43,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 663 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2024-11-09 04:33:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-09 04:33:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 145. [2024-11-09 04:33:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:33:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 191 transitions. [2024-11-09 04:33:43,941 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 191 transitions. Word has length 127 [2024-11-09 04:33:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:43,942 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 191 transitions. [2024-11-09 04:33:43,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:33:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2024-11-09 04:33:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:33:43,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:43,944 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:33:43,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:33:44,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-09 04:33:44,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:33:44,345 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:44,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2035834745, now seen corresponding path program 1 times [2024-11-09 04:33:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:33:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301869896] [2024-11-09 04:33:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:44,346 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 [2024-11-09 04:33:44,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:33:44,348 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:33:44,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:33:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:45,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:33:45,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:51,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 [2024-11-09 04:33:53,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-09 04:33:53,732 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 45 treesize of output 43 [2024-11-09 04:33:54,016 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 49 treesize of output 43 [2024-11-09 04:33:54,350 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 49 treesize of output 43 [2024-11-09 04:33:54,529 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 49 treesize of output 43 [2024-11-09 04:33:54,697 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 49 treesize of output 29 [2024-11-09 04:33:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 04:33:54,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:33:55,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_640) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_641) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) is different from false [2024-11-09 04:33:59,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem7#1| (_ BitVec 8)) (|ULTIMATE.start_step_#t~ite10#1| (_ BitVec 32)) (v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_636) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_637))) (or (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store (store (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem7#1|)) (_ bv17222 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) |ULTIMATE.start_step_#t~ite10#1|))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_639) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_640) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_641) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))) (not (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))))))) is different from false [2024-11-09 04:34:00,226 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:34:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301869896] [2024-11-09 04:34:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301869896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1510001784] [2024-11-09 04:34:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:34:00,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:34:00,229 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:34:00,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-09 04:34:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:02,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 04:34:02,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:06,091 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-09 04:34:06,091 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-09 04:34:06,132 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:34:06,132 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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-11-09 04:34:06,675 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 29 [2024-11-09 04:34:07,392 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 48 [2024-11-09 04:34:08,245 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 78 treesize of output 66 [2024-11-09 04:34:08,593 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 78 treesize of output 66 [2024-11-09 04:34:08,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:34:08,934 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 54 [2024-11-09 04:34:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:34:09,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:34:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1510001784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:34:09,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:34:09,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2024-11-09 04:34:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884283711] [2024-11-09 04:34:09,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:34:09,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:34:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:34:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:34:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1083, Unknown=37, NotChecked=138, Total=1406 [2024-11-09 04:34:09,199 INFO L87 Difference]: Start difference. First operand 145 states and 191 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:34:14,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:34:17,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:34:21,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:34:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:28,845 INFO L93 Difference]: Finished difference Result 406 states and 533 transitions. [2024-11-09 04:34:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:34:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-09 04:34:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:28,850 INFO L225 Difference]: With dead ends: 406 [2024-11-09 04:34:28,851 INFO L226 Difference]: Without dead ends: 264 [2024-11-09 04:34:28,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=237, Invalid=1714, Unknown=37, NotChecked=174, Total=2162 [2024-11-09 04:34:28,854 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 426 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 32 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:28,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 648 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 813 Invalid, 21 Unknown, 0 Unchecked, 17.5s Time] [2024-11-09 04:34:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-09 04:34:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 160. [2024-11-09 04:34:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.289655172413793) internal successors, (187), 145 states have internal predecessors, (187), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:34:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2024-11-09 04:34:28,872 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 127 [2024-11-09 04:34:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:28,873 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2024-11-09 04:34:28,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:34:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2024-11-09 04:34:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:34:28,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:28,875 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:28,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:34:29,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-09 04:34:29,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:34:29,276 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:34:29,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1233621109, now seen corresponding path program 1 times [2024-11-09 04:34:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:34:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067320823] [2024-11-09 04:34:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:29,277 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 [2024-11-09 04:34:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:34:29,278 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:34:29,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:34:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:30,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 04:34:30,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:33,678 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 [2024-11-09 04:34:34,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-09 04:34:34,823 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 34 treesize of output 36 [2024-11-09 04:34:34,970 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 73 treesize of output 45 [2024-11-09 04:34:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 04:34:35,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:34:35,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_step_#t~mem12#1_29| (_ BitVec 8))) (not (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_716) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_715))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32))))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset .cse1)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_29|) ((_ zero_extend 16) ((_ extract 15 0) .cse1)))))))) is different from false [2024-11-09 04:34:35,724 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:34:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067320823] [2024-11-09 04:34:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067320823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [817204862] [2024-11-09 04:34:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:34:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:34:35,726 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:34:35,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-09 04:34:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:38,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 04:34:38,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:41,328 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-09 04:34:41,329 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-09 04:34:41,376 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:34:41,376 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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-11-09 04:34:41,889 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 29 [2024-11-09 04:34:42,175 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 36 treesize of output 34 [2024-11-09 04:34:42,880 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 59 treesize of output 51 [2024-11-09 04:34:43,156 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 59 treesize of output 51 [2024-11-09 04:34:43,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 105 treesize of output 69 [2024-11-09 04:34:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:34:44,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:34:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [817204862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:34:44,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:34:44,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [12] total 26 [2024-11-09 04:34:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104692454] [2024-11-09 04:34:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:34:44,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 04:34:44,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:34:44,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 04:34:44,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=896, Unknown=3, NotChecked=60, Total=1056 [2024-11-09 04:34:44,146 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:34:49,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:34:52,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:34:59,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:35:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:01,825 INFO L93 Difference]: Finished difference Result 423 states and 555 transitions. [2024-11-09 04:35:01,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 04:35:01,826 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-09 04:35:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:01,828 INFO L225 Difference]: With dead ends: 423 [2024-11-09 04:35:01,828 INFO L226 Difference]: Without dead ends: 266 [2024-11-09 04:35:01,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=232, Invalid=1839, Unknown=3, NotChecked=88, Total=2162 [2024-11-09 04:35:01,829 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 372 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:01,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 773 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2024-11-09 04:35:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-09 04:35:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 163. [2024-11-09 04:35:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 148 states have internal predecessors, (192), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:35:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 216 transitions. [2024-11-09 04:35:01,851 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 216 transitions. Word has length 127 [2024-11-09 04:35:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:01,855 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 216 transitions. [2024-11-09 04:35:01,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:35:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 216 transitions. [2024-11-09 04:35:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:35:01,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:01,857 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:01,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:35:02,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-09 04:35:02,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:35:02,258 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:02,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2040277833, now seen corresponding path program 1 times [2024-11-09 04:35:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:35:02,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346964541] [2024-11-09 04:35:02,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:02,259 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 [2024-11-09 04:35:02,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:35:02,262 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:35:02,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 04:35:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:03,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:35:03,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:08,636 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 [2024-11-09 04:35:09,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-09 04:35:10,167 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 45 treesize of output 43 [2024-11-09 04:35:10,398 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 49 treesize of output 43 [2024-11-09 04:35:10,598 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 49 treesize of output 43 [2024-11-09 04:35:10,769 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 49 treesize of output 43 [2024-11-09 04:35:10,931 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 49 treesize of output 29 [2024-11-09 04:35:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 04:35:11,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:11,143 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_796) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) is different from false [2024-11-09 04:35:11,286 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store (store |c_#memory_int| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_794) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_795) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_796) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) is different from false [2024-11-09 04:35:13,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem7#1| (_ BitVec 8)) (|ULTIMATE.start_step_#t~ite10#1| (_ BitVec 32)) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_792) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_791))) (or (not (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store (store (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem7#1|)) (_ bv17222 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) |ULTIMATE.start_step_#t~ite10#1|))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_794) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_795) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_796) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))))) is different from false [2024-11-09 04:35:14,297 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:35:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346964541] [2024-11-09 04:35:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346964541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1337843723] [2024-11-09 04:35:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:14,297 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:35:14,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:35:14,299 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:35:14,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-09 04:35:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:16,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 04:35:16,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:20,142 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-09 04:35:20,142 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-09 04:35:20,187 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:35:20,187 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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-11-09 04:35:20,231 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 5 treesize of output 3 [2024-11-09 04:35:20,928 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 29 [2024-11-09 04:35:21,601 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 56 treesize of output 48 [2024-11-09 04:35:22,741 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 79 treesize of output 65 [2024-11-09 04:35:23,229 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 79 treesize of output 65 [2024-11-09 04:35:23,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:23,576 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 79 treesize of output 51 [2024-11-09 04:35:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:35:23,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:35:23,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1337843723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:35:23,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:35:23,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2024-11-09 04:35:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648773142] [2024-11-09 04:35:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:35:23,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:35:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:35:23,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:35:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1025, Unknown=33, NotChecked=204, Total=1406 [2024-11-09 04:35:23,851 INFO L87 Difference]: Start difference. First operand 163 states and 216 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:35:30,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:35:33,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:35:37,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:35:39,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:35:40,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:35:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:51,875 INFO L93 Difference]: Finished difference Result 471 states and 616 transitions. [2024-11-09 04:35:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:35:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-09 04:35:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:51,879 INFO L225 Difference]: With dead ends: 471 [2024-11-09 04:35:51,879 INFO L226 Difference]: Without dead ends: 311 [2024-11-09 04:35:51,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=243, Invalid=1716, Unknown=33, NotChecked=264, Total=2256 [2024-11-09 04:35:51,881 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 461 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 29 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:51,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 751 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 883 Invalid, 15 Unknown, 0 Unchecked, 25.6s Time] [2024-11-09 04:35:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-09 04:35:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 166. [2024-11-09 04:35:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:35:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 221 transitions. [2024-11-09 04:35:51,899 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 221 transitions. Word has length 127 [2024-11-09 04:35:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:51,900 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 221 transitions. [2024-11-09 04:35:51,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:35:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 221 transitions. [2024-11-09 04:35:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:35:51,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:51,902 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:51,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-09 04:35:52,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 04:35:52,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:35:52,303 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:52,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:52,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2125119045, now seen corresponding path program 1 times [2024-11-09 04:35:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:35:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888051116] [2024-11-09 04:35:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:52,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 [2024-11-09 04:35:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:35:52,308 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:35:52,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:35:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:53,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 04:35:53,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:00,186 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:36:00,187 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2024-11-09 04:36:00,274 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:36:00,274 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 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-09 04:36:01,035 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 54 treesize of output 48 [2024-11-09 04:36:01,491 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 56 treesize of output 50 [2024-11-09 04:36:01,710 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 56 treesize of output 50 [2024-11-09 04:36:01,893 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 56 treesize of output 36 [2024-11-09 04:36:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 04:36:01,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:36:02,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_870 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_870) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_871) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) is different from false [2024-11-09 04:36:04,823 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_871 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (|ULTIMATE.start_step_#t~mem7#1| (_ BitVec 8)) (|ULTIMATE.start_step_#t~ite10#1| (_ BitVec 32)) (v_ArrVal_870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_868 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_868))) (or (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (bvneg ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem7#1|)) (_ bv17222 32) |ULTIMATE.start_step_#t~ite10#1|))))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_870) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_871) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))) (not (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))))))) is different from false [2024-11-09 04:36:05,178 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:36:05,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888051116] [2024-11-09 04:36:05,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888051116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:36:05,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [755212491] [2024-11-09 04:36:05,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:05,178 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:36:05,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:36:05,179 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:36:05,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 04:36:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:07,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 04:36:07,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:12,717 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-09 04:36:12,718 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 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 04:36:13,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 36 treesize of output 29 [2024-11-09 04:36:13,302 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 36 treesize of output 29 [2024-11-09 04:36:13,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 36 treesize of output 24 [2024-11-09 04:36:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:36:13,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:36:13,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [755212491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:36:13,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:36:13,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2024-11-09 04:36:13,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689851430] [2024-11-09 04:36:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:36:13,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:36:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:36:13,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:36:13,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=595, Unknown=32, NotChecked=106, Total=870 [2024-11-09 04:36:13,607 INFO L87 Difference]: Start difference. First operand 166 states and 221 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:36:16,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:36:18,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:36:20,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:36:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:36:21,450 INFO L93 Difference]: Finished difference Result 383 states and 507 transitions. [2024-11-09 04:36:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:36:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-09 04:36:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:36:21,452 INFO L225 Difference]: With dead ends: 383 [2024-11-09 04:36:21,453 INFO L226 Difference]: Without dead ends: 220 [2024-11-09 04:36:21,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=165, Invalid=679, Unknown=34, NotChecked=114, Total=992 [2024-11-09 04:36:21,461 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 267 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:36:21,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 447 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 398 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-11-09 04:36:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-09 04:36:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 155. [2024-11-09 04:36:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.2857142857142858) internal successors, (180), 140 states have internal predecessors, (180), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:36:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 204 transitions. [2024-11-09 04:36:21,477 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 204 transitions. Word has length 127 [2024-11-09 04:36:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:36:21,478 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 204 transitions. [2024-11-09 04:36:21,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:36:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 204 transitions. [2024-11-09 04:36:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:36:21,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:36:21,480 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:36:21,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:36:21,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-09 04:36:21,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:36:21,880 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:36:21,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:36:21,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1524239481, now seen corresponding path program 1 times [2024-11-09 04:36:21,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:36:21,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203258157] [2024-11-09 04:36:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:21,882 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 [2024-11-09 04:36:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:36:21,885 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:36:21,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 (29)] Waiting until timeout for monitored process [2024-11-09 04:36:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:22,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:36:22,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:29,322 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:36:29,323 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2024-11-09 04:36:29,374 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:36:29,374 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 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-09 04:36:29,406 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 5 treesize of output 3 [2024-11-09 04:36:29,884 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 46 treesize of output 44 [2024-11-09 04:36:30,132 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 50 treesize of output 44 [2024-11-09 04:36:30,383 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 50 treesize of output 44 [2024-11-09 04:36:30,574 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 50 treesize of output 44 [2024-11-09 04:36:30,748 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 50 treesize of output 30 [2024-11-09 04:36:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 04:36:33,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:36:33,194 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_944) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))))) is different from false [2024-11-09 04:36:34,232 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem7#1| (_ BitVec 8)) (|ULTIMATE.start_step_#t~ite10#1| (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_940))) (or (not (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store (store (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem7#1|)) (_ bv17222 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) |ULTIMATE.start_step_#t~ite10#1|))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_942) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_943) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_944) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))))) is different from false [2024-11-09 04:36:34,735 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:36:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203258157] [2024-11-09 04:36:34,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203258157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:36:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125608418] [2024-11-09 04:36:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:34,735 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:36:34,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:36:34,736 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:36:34,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-09 04:36:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:37,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 04:36:37,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:41,169 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-09 04:36:41,170 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 2 case distinctions, treesize of input 37 treesize of output 47 [2024-11-09 04:36:41,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 37 treesize of output 30 [2024-11-09 04:36:42,272 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 37 treesize of output 30 [2024-11-09 04:36:42,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 37 treesize of output 30 [2024-11-09 04:36:44,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 37 treesize of output 25 [2024-11-09 04:36:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:36:48,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:36:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1125608418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:36:48,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:36:48,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 23 [2024-11-09 04:36:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241791924] [2024-11-09 04:36:48,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:36:48,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:36:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:36:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:36:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=742, Unknown=36, NotChecked=118, Total=1056 [2024-11-09 04:36:48,506 INFO L87 Difference]: Start difference. First operand 155 states and 204 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:36:52,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:36:57,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:36:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:36:57,296 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2024-11-09 04:36:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:36:57,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-09 04:36:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:36:57,298 INFO L225 Difference]: With dead ends: 351 [2024-11-09 04:36:57,298 INFO L226 Difference]: Without dead ends: 199 [2024-11-09 04:36:57,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=193, Invalid=835, Unknown=36, NotChecked=126, Total=1190 [2024-11-09 04:36:57,300 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 192 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 11 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:36:57,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 537 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 645 Invalid, 4 Unknown, 0 Unchecked, 8.4s Time] [2024-11-09 04:36:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-09 04:36:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2024-11-09 04:36:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:36:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2024-11-09 04:36:57,316 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 127 [2024-11-09 04:36:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:36:57,317 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2024-11-09 04:36:57,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:36:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2024-11-09 04:36:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:36:57,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:36:57,318 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:36:57,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 (29)] Ended with exit code 0 [2024-11-09 04:36:57,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-09 04:36:57,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:36:57,722 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:36:57,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:36:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1749659461, now seen corresponding path program 1 times [2024-11-09 04:36:57,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:36:57,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399040655] [2024-11-09 04:36:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:57,723 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 [2024-11-09 04:36:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:36:57,725 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:36:57,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:36:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:58,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 04:36:58,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:04,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-09 04:37:04,781 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 50 treesize of output 44 [2024-11-09 04:37:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 04:37:05,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:37:06,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv17222 32) |c_ULTIMATE.start_step_#t~ite10#1| (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem7#1|))))))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset .cse1)))) (or (forall ((|v_ULTIMATE.start_step_#t~mem12#1_51| (_ BitVec 8))) (not (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_51|) ((_ zero_extend 16) ((_ extract 15 0) .cse1)))))) (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1018))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (let ((.cse3 (bvshl .cse2 .cse2))) (or (bvsgt .cse2 .cse3) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) .cse3))))))))) is different from false [2024-11-09 04:37:06,371 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv17222 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem7#1|))))))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset .cse1)))) (or (forall ((|v_ULTIMATE.start_step_#t~mem12#1_51| (_ BitVec 8))) (not (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_51|) ((_ zero_extend 16) ((_ extract 15 0) .cse1)))))) (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1018))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (let ((.cse3 (bvshl .cse2 .cse2))) (or (bvsgt .cse2 .cse3) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) .cse3))))))))) is different from false [2024-11-09 04:37:06,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32))) (let ((.cse4 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (_ bv17222 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))))))) (let ((.cse3 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset .cse4)))) (or (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1018))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (let ((.cse1 (bvshl .cse0 .cse0))) (or (bvsgt .cse0 .cse1) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) .cse1)))))) (forall ((|v_ULTIMATE.start_step_#t~mem12#1_51| (_ BitVec 8))) (not (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_51|) ((_ zero_extend 16) ((_ extract 15 0) .cse4)))))))))) is different from false [2024-11-09 04:37:07,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem12#1_51| (_ BitVec 8)) (v_ArrVal_1016 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1016) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1015))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (_ bv17222 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))))))) (let ((.cse0 (store .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset .cse1)))) (let ((.cse4 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1018))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (let ((.cse3 (bvshl .cse2 .cse2))) (or (not (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvadd ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_51|) ((_ zero_extend 16) ((_ extract 15 0) .cse1))))) (bvsgt .cse2 .cse3) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) .cse3))))))))) is different from false [2024-11-09 04:37:07,800 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:37:07,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399040655] [2024-11-09 04:37:07,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399040655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:37:07,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1039431498] [2024-11-09 04:37:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:07,801 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:37:07,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:37:07,802 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:37:07,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-09 04:37:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:10,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 04:37:10,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:16,910 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 12 treesize of output 8 [2024-11-09 04:37:20,484 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:37:20,484 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 54 [2024-11-09 04:37:20,552 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:37:20,552 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 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-09 04:37:20,614 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 5 treesize of output 3 [2024-11-09 04:37:21,839 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 59 treesize of output 49 [2024-11-09 04:37:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 40 proven. 44 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 04:37:23,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:37:23,416 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1058) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) is different from false [2024-11-09 04:37:23,438 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1057) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1058) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) is different from false [2024-11-09 04:37:26,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (v_ArrVal_1056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1057 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1053))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))))))))) (let ((.cse1 (store .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset .cse2)))) (or (bvslt (_ bv29916 32) .cse0) (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select (store (store (store .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_1056) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1057) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1058) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))) (not (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvadd ((_ zero_extend 16) ((_ extract 15 0) .cse2)) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))))))))))) is different from false [2024-11-09 04:37:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1039431498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:37:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826683694] [2024-11-09 04:37:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:27,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:27,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:37:27,507 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:37:27,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-09 04:37:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:27,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 04:37:27,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:30,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:30,290 INFO L349 Elim1Store]: treesize reduction 41, result has 26.8 percent of original size [2024-11-09 04:37:30,291 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 2 case distinctions, treesize of input 42 treesize of output 48 [2024-11-09 04:37:30,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:30,758 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 85 treesize of output 49 [2024-11-09 04:37:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:37:31,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:37:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826683694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:37:31,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:37:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16, 17] total 37 [2024-11-09 04:37:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087878068] [2024-11-09 04:37:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:37:31,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:37:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:37:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:37:31,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2335, Unknown=21, NotChecked=742, Total=3422 [2024-11-09 04:37:31,038 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:37:34,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:37:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:36,846 INFO L93 Difference]: Finished difference Result 307 states and 403 transitions. [2024-11-09 04:37:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:37:36,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-09 04:37:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:36,849 INFO L225 Difference]: With dead ends: 307 [2024-11-09 04:37:36,850 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 04:37:36,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=345, Invalid=2524, Unknown=21, NotChecked=770, Total=3660 [2024-11-09 04:37:36,852 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 78 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:36,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 378 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-09 04:37:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 04:37:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-09 04:37:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 139 states have (on average 1.2733812949640289) internal successors, (177), 139 states have internal predecessors, (177), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:37:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2024-11-09 04:37:36,875 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 127 [2024-11-09 04:37:36,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:36,875 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2024-11-09 04:37:36,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:37:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2024-11-09 04:37:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:37:36,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:36,878 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:37:36,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-09 04:37:37,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-09 04:37:37,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:37:37,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:37:37,479 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:37:37,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1615645955, now seen corresponding path program 1 times [2024-11-09 04:37:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:37:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944496869] [2024-11-09 04:37:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:37,480 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 [2024-11-09 04:37:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:37:37,482 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:37:37,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:37:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:38,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 04:37:38,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:46,534 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:37:46,534 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2024-11-09 04:37:46,601 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:37:46,601 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 3 case distinctions, treesize of input 51 treesize of output 54 [2024-11-09 04:37:47,416 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 60 treesize of output 50 [2024-11-09 04:37:48,890 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 112 treesize of output 90 [2024-11-09 04:37:49,405 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 112 treesize of output 90 [2024-11-09 04:37:50,607 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 172 treesize of output 100 [2024-11-09 04:37:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 04:37:50,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:37:51,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1128))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) .cse1)))) (bvslt (_ bv29916 32) .cse1))))) is different from false [2024-11-09 04:37:55,854 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1124))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (let ((.cse2 (store .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (_ bv17222 32) .cse1))))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (.cse4 (store (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1127) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1128))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))) (.cse3 (bvshl .cse5 .cse5))) (or (bvslt (_ bv29916 32) .cse0) (bvslt (_ bv29916 32) .cse1) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) .cse3) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) .cse0 (_ bv17222 32))))) (bvsgt .cse5 .cse3)))))))) is different from false [2024-11-09 04:38:21,673 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:38:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944496869] [2024-11-09 04:38:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944496869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1051025938] [2024-11-09 04:38:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:21,674 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:38:21,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:38:21,675 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:38:21,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-09 04:38:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:24,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 04:38:24,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:30,149 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 [2024-11-09 04:38:31,155 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:38:31,156 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2024-11-09 04:38:31,215 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:38:31,216 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 3 case distinctions, treesize of input 51 treesize of output 54 [2024-11-09 04:38:31,551 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 60 treesize of output 50 [2024-11-09 04:38:32,411 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 112 treesize of output 90 [2024-11-09 04:38:32,637 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 112 treesize of output 90 [2024-11-09 04:38:33,090 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 172 treesize of output 100 [2024-11-09 04:38:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 04:38:33,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:33,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1166 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1166))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) .cse1 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))))))) (bvslt (_ bv29916 32) .cse1))))) is different from false [2024-11-09 04:38:34,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1162 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1162))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (let ((.cse4 (store .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32)) .cse0 (_ bv17222 32)))))))) (let ((.cse5 (store (store .cse4 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1127) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1128)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (let ((.cse3 (bvshl .cse2 .cse2)) (.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (bvslt (_ bv29916 32) .cse0) (bvslt (_ bv29916 32) .cse1) (bvsgt .cse2 .cse3) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) .cse3) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse1 (_ bv17222 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))))))))))) is different from false [2024-11-09 04:39:10,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1051025938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:39:10,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730719145] [2024-11-09 04:39:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:39:10,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:10,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:39:10,537 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:39:10,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-09 04:39:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:39:12,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 04:39:12,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:39:19,422 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 [2024-11-09 04:39:22,314 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:39:22,314 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2024-11-09 04:39:22,378 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:39:22,378 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 3 case distinctions, treesize of input 51 treesize of output 54 [2024-11-09 04:39:22,425 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 5 treesize of output 3 [2024-11-09 04:39:23,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:23,669 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 60 treesize of output 50 [2024-11-09 04:39:25,742 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 112 treesize of output 90 [2024-11-09 04:39:26,408 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 112 treesize of output 90 [2024-11-09 04:39:28,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:39:28,429 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 178 treesize of output 100 [2024-11-09 04:39:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 71 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-09 04:39:28,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:39:28,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1204 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1204))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) .cse1 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32)))))) (bvslt (_ bv29916 32) .cse1))))) is different from false [2024-11-09 04:39:30,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1201))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (let ((.cse3 (store .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse6 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (_ bv17222 32) .cse0))))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (.cse2 (store (store .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1127) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1128))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))) (.cse4 (bvshl .cse5 .cse5))) (or (bvslt (_ bv29916 32) .cse0) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) .cse1 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) .cse4) (bvslt (_ bv29916 32) .cse1) (bvsgt .cse5 .cse4)))))))) is different from false [2024-11-09 04:40:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730719145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:40:20,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:40:20,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 43 [2024-11-09 04:40:20,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880970887] [2024-11-09 04:40:20,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:40:20,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 04:40:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:40:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 04:40:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=2823, Unknown=32, NotChecked=690, Total=3906 [2024-11-09 04:40:20,823 INFO L87 Difference]: Start difference. First operand 154 states and 201 transitions. Second operand has 44 states, 40 states have (on average 3.45) internal successors, (138), 39 states have internal predecessors, (138), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-09 04:40:34,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:40:50,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:40:54,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:40:56,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:40:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:40:57,955 INFO L93 Difference]: Finished difference Result 470 states and 605 transitions. [2024-11-09 04:40:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 04:40:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 3.45) internal successors, (138), 39 states have internal predecessors, (138), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 127 [2024-11-09 04:40:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:40:57,959 INFO L225 Difference]: With dead ends: 470 [2024-11-09 04:40:57,959 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 04:40:57,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 409 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 130.6s TimeCoverageRelationStatistics Valid=885, Invalid=5587, Unknown=32, NotChecked=978, Total=7482 [2024-11-09 04:40:57,962 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 564 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 3649 mSolverCounterSat, 36 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 3689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3649 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:40:57,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 2297 Invalid, 3689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3649 Invalid, 4 Unknown, 0 Unchecked, 31.4s Time] [2024-11-09 04:40:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 04:40:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 164. [2024-11-09 04:40:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 148 states have (on average 1.2702702702702702) internal successors, (188), 148 states have internal predecessors, (188), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:40:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 212 transitions. [2024-11-09 04:40:57,979 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 212 transitions. Word has length 127 [2024-11-09 04:40:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:40:57,980 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 212 transitions. [2024-11-09 04:40:57,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 3.45) internal successors, (138), 39 states have internal predecessors, (138), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-09 04:40:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 212 transitions. [2024-11-09 04:40:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 04:40:57,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:40:57,982 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:40:57,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:40:58,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2024-11-09 04:40:58,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-09 04:40:58,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:40:58,583 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:40:58,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:40:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1396791237, now seen corresponding path program 1 times [2024-11-09 04:40:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:40:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180314381] [2024-11-09 04:40:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:40:58,584 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 [2024-11-09 04:40:58,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:40:58,585 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:40:58,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:40:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:40:59,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 04:40:59,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:05,868 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:41:05,868 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2024-11-09 04:41:05,922 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:41:05,923 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 3 case distinctions, treesize of input 51 treesize of output 54 [2024-11-09 04:41:06,574 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 60 treesize of output 50 [2024-11-09 04:41:07,635 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 85 treesize of output 71 [2024-11-09 04:41:07,981 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 85 treesize of output 71 [2024-11-09 04:41:08,861 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 145 treesize of output 89 [2024-11-09 04:41:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 04:41:09,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:41:09,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1240))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (bvslt (_ bv29916 32) .cse0) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse0 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (_ bv17222 32))))))))) is different from false [2024-11-09 04:41:10,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1239) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1240))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse0 (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)))) (bvslt (_ bv29916 32) .cse0))))) is different from false [2024-11-09 04:41:12,817 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1237))) (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (let ((.cse2 (store .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) .cse3 (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))))))))))) (let ((.cse4 (store (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1239) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1240))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (bvslt (_ bv29916 32) .cse0) (not (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (bvsgt .cse1 (bvshl .cse1 .cse1)))) (bvslt (_ bv29916 32) .cse3) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (_ bv17222 32) .cse0))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))))))))))) is different from false [2024-11-09 04:41:48,394 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180314381] [2024-11-09 04:41:48,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180314381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:41:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [261452190] [2024-11-09 04:41:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:48,395 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:41:48,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:41:48,396 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:41:48,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-09 04:41:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:51,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 04:41:51,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:55,940 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 12 treesize of output 8 [2024-11-09 04:41:59,142 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:41:59,142 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 54 [2024-11-09 04:41:59,190 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:41:59,190 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 3 case distinctions, treesize of input 59 treesize of output 60 [2024-11-09 04:41:59,221 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 5 treesize of output 3 [2024-11-09 04:42:00,378 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 68 treesize of output 54 [2024-11-09 04:42:02,551 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 73 treesize of output 61 [2024-11-09 04:42:03,311 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 73 treesize of output 61 [2024-11-09 04:42:05,283 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 143 treesize of output 87 [2024-11-09 04:42:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 40 proven. 44 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 04:42:05,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:05,411 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1277))) (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) .cse0 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)))) (bvslt (_ bv29916 32) .cse0))))) is different from false [2024-11-09 04:42:07,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1274))) (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (let ((.cse4 (store .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) .cse2))))))) (let ((.cse0 (store (store .cse4 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1239) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1240))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) .cse1)))) (bvslt (_ bv29916 32) .cse2) (not (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (bvsgt .cse3 (bvshl .cse3 .cse3)))) (bvslt (_ bv29916 32) .cse1)))))))) is different from false [2024-11-09 04:42:32,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [261452190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:42:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131903224] [2024-11-09 04:42:32,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:32,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:42:32,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:42:32,645 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:42:32,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-09 04:42:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:34,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 04:42:34,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:39,943 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 12 treesize of output 8 [2024-11-09 04:42:44,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2024-11-09 04:42:45,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:42:45,182 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 59 treesize of output 49 [2024-11-09 04:42:47,150 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 86 treesize of output 70 [2024-11-09 04:42:47,865 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 86 treesize of output 70 [2024-11-09 04:42:49,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:49,887 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 152 treesize of output 86 [2024-11-09 04:42:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 40 proven. 71 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 04:42:49,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:50,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1314))) (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse1 (_ bv17222 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32)))))) (bvslt (_ bv29916 32) .cse1))))) is different from false [2024-11-09 04:42:52,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1310) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1311))) (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (let ((.cse1 (store .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) .cse2 (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse5 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32))))))))) (let ((.cse4 (store (store .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1239) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1240))) (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (or (not (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (bvsgt .cse0 (bvshl .cse0 .cse0)))) (bvslt (_ bv29916 32) .cse2) (bvslt (_ bv29916 32) .cse3) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse4 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) .cse3 (_ bv17222 32)))))))))))) is different from false [2024-11-09 04:42:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131903224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:42:56,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:42:56,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 26] total 66 [2024-11-09 04:42:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996569806] [2024-11-09 04:42:56,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:42:56,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-09 04:42:56,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:56,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-09 04:42:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=5775, Unknown=84, NotChecked=1148, Total=7656 [2024-11-09 04:42:56,550 INFO L87 Difference]: Start difference. First operand 164 states and 212 transitions. Second operand has 67 states, 61 states have (on average 2.721311475409836) internal successors, (166), 58 states have internal predecessors, (166), 8 states have call successors, (26), 7 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-11-09 04:43:21,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:43:42,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:43:46,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:43:47,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:43:50,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:43:54,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:43:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:43:58,576 INFO L93 Difference]: Finished difference Result 494 states and 631 transitions. [2024-11-09 04:43:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 04:43:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 61 states have (on average 2.721311475409836) internal successors, (166), 58 states have internal predecessors, (166), 8 states have call successors, (26), 7 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 127 [2024-11-09 04:43:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:43:58,579 INFO L225 Difference]: With dead ends: 494 [2024-11-09 04:43:58,580 INFO L226 Difference]: Without dead ends: 333 [2024-11-09 04:43:58,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 385 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4065 ImplicationChecksByTransitivity, 95.1s TimeCoverageRelationStatistics Valid=1353, Invalid=9489, Unknown=106, NotChecked=1484, Total=12432 [2024-11-09 04:43:58,585 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 767 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 4861 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 4861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:43:58,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 3516 Invalid, 4943 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [82 Valid, 4861 Invalid, 0 Unknown, 0 Unchecked, 54.0s Time] [2024-11-09 04:43:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-09 04:43:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 170. [2024-11-09 04:43:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 153 states have (on average 1.2679738562091503) internal successors, (194), 153 states have internal predecessors, (194), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:43:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 218 transitions. [2024-11-09 04:43:58,611 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 218 transitions. Word has length 127 [2024-11-09 04:43:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:43:58,611 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 218 transitions. [2024-11-09 04:43:58,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 61 states have (on average 2.721311475409836) internal successors, (166), 58 states have internal predecessors, (166), 8 states have call successors, (26), 7 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-11-09 04:43:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 218 transitions. [2024-11-09 04:43:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 04:43:58,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:43:58,613 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:43:58,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-09 04:43:58,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 04:43:59,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2024-11-09 04:43:59,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:43:59,214 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:43:59,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:43:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1085181540, now seen corresponding path program 1 times [2024-11-09 04:43:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:43:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283302009] [2024-11-09 04:43:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:43:59,215 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 [2024-11-09 04:43:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:43:59,216 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:43:59,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 04:43:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:43:59,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 04:43:59,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:44:04,244 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 [2024-11-09 04:44:05,185 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 04:44:05,185 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2024-11-09 04:44:05,241 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-09 04:44:05,242 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 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-09 04:44:05,706 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 43 treesize of output 41 [2024-11-09 04:44:05,923 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 80 treesize of output 52 [2024-11-09 04:44:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 04:44:05,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:44:06,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (|v_ULTIMATE.start_step_#t~mem12#1_89| (_ BitVec 8)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1350))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))))))))) (bvsge ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset .cse1)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvadd ((_ zero_extend 16) ((_ extract 15 0) .cse1)) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem12#1_89|))))))) is different from false [2024-11-09 04:44:06,843 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:44:06,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283302009] [2024-11-09 04:44:06,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283302009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:44:06,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455460992] [2024-11-09 04:44:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:06,844 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:44:06,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:44:06,845 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:44:06,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-09 04:44:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:09,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 04:44:09,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:44:13,353 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-09 04:44:13,354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-09 04:44:13,405 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:44:13,405 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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-11-09 04:44:14,019 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 29 [2024-11-09 04:44:14,733 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 56 treesize of output 48 [2024-11-09 04:44:16,361 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 79 treesize of output 65 [2024-11-09 04:44:16,803 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 79 treesize of output 65 [2024-11-09 04:44:17,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:17,975 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 125 treesize of output 85 [2024-11-09 04:44:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:44:18,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:44:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1455460992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:18,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:44:18,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [12] total 28 [2024-11-09 04:44:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402056669] [2024-11-09 04:44:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:18,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 04:44:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:44:18,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 04:44:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1024, Unknown=1, NotChecked=64, Total=1190 [2024-11-09 04:44:18,327 INFO L87 Difference]: Start difference. First operand 170 states and 218 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:44:26,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:44:29,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:44:32,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:44:44,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:44:47,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:44:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:49,333 INFO L93 Difference]: Finished difference Result 486 states and 621 transitions. [2024-11-09 04:44:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 04:44:49,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-09 04:44:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:49,336 INFO L225 Difference]: With dead ends: 486 [2024-11-09 04:44:49,336 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 04:44:49,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=289, Invalid=2470, Unknown=1, NotChecked=102, Total=2862 [2024-11-09 04:44:49,338 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 398 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:49,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1187 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1488 Invalid, 1 Unknown, 0 Unchecked, 26.5s Time] [2024-11-09 04:44:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 04:44:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 172. [2024-11-09 04:44:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 155 states have (on average 1.270967741935484) internal successors, (197), 155 states have internal predecessors, (197), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:44:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 221 transitions. [2024-11-09 04:44:49,364 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 221 transitions. Word has length 129 [2024-11-09 04:44:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:49,364 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 221 transitions. [2024-11-09 04:44:49,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:44:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 221 transitions. [2024-11-09 04:44:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 04:44:49,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:49,366 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:49,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:44:49,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2024-11-09 04:44:49,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:44:49,767 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:44:49,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1147221154, now seen corresponding path program 1 times [2024-11-09 04:44:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:44:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731219119] [2024-11-09 04:44:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:49,768 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 [2024-11-09 04:44:49,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:44:49,769 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:44:49,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:44:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:50,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 04:44:50,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:44:56,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:44:57,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-09 04:44:57,887 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 43 treesize of output 41 [2024-11-09 04:44:59,246 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 70 treesize of output 58 [2024-11-09 04:44:59,563 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 70 treesize of output 58 [2024-11-09 04:45:00,348 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 116 treesize of output 72 [2024-11-09 04:45:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 04:45:00,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:45:01,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1427))) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)))))) is different from false [2024-11-09 04:45:01,212 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1426) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1427))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))) (_ bv2 32)))))))) is different from false [2024-11-09 04:45:04,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1423) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1424))) (let ((.cse2 (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))))))))))) (or (not (bvslt (_ bv29916 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) (let ((.cse1 (store (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1426) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1427))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv47138 32) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset)))))))))) (not (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (bvshl .cse3 .cse3)))))))) is different from false [2024-11-09 04:45:07,260 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:45:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731219119] [2024-11-09 04:45:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731219119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1719703865] [2024-11-09 04:45:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:07,261 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:45:07,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:45:07,263 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:45:07,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2024-11-09 04:45:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:09,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 04:45:09,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:13,370 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-09 04:45:13,371 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 33 [2024-11-09 04:45:13,415 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 04:45:13,415 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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-11-09 04:45:13,441 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 5 treesize of output 3 [2024-11-09 04:45:14,117 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 29 [2024-11-09 04:45:16,898 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 104 treesize of output 84 [2024-11-09 04:45:17,501 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 104 treesize of output 84 [2024-11-09 04:45:19,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:19,022 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 135 treesize of output 91 [2024-11-09 04:45:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:45:19,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:45:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1719703865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:19,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:45:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [20] total 34 [2024-11-09 04:45:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524761050] [2024-11-09 04:45:19,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:19,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 04:45:19,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:45:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 04:45:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1839, Unknown=6, NotChecked=270, Total=2352 [2024-11-09 04:45:19,084 INFO L87 Difference]: Start difference. First operand 172 states and 221 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:45:27,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:45:31,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:45:34,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:45:36,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:45:43,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:45:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:50,361 INFO L93 Difference]: Finished difference Result 498 states and 638 transitions. [2024-11-09 04:45:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 04:45:50,362 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-09 04:45:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:50,364 INFO L225 Difference]: With dead ends: 498 [2024-11-09 04:45:50,364 INFO L226 Difference]: Without dead ends: 329 [2024-11-09 04:45:50,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=529, Invalid=3637, Unknown=6, NotChecked=384, Total=4556 [2024-11-09 04:45:50,365 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 316 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:50,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1358 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1796 Invalid, 2 Unknown, 0 Unchecked, 27.2s Time] [2024-11-09 04:45:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-09 04:45:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 172. [2024-11-09 04:45:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 155 states have (on average 1.270967741935484) internal successors, (197), 155 states have internal predecessors, (197), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:45:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 221 transitions. [2024-11-09 04:45:50,389 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 221 transitions. Word has length 129 [2024-11-09 04:45:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:50,390 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 221 transitions. [2024-11-09 04:45:50,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:45:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 221 transitions. [2024-11-09 04:45:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 04:45:50,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:50,391 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:45:50,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2024-11-09 04:45:50,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:45:50,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:45:50,792 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:45:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:50,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1224518108, now seen corresponding path program 1 times [2024-11-09 04:45:50,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:45:50,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850780261] [2024-11-09 04:45:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:50,793 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 [2024-11-09 04:45:50,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:45:50,794 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:45:50,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:45:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:51,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 04:45:51,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:51,910 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 [2024-11-09 04:45:52,997 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 [2024-11-09 04:45:53,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 18 treesize of output 13 [2024-11-09 04:45:54,168 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 [2024-11-09 04:45:54,770 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 [2024-11-09 04:45:55,329 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 [2024-11-09 04:45:55,902 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 [2024-11-09 04:45:56,343 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 [2024-11-09 04:45:56,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-09 04:45:56,956 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 [2024-11-09 04:45:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 237 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 04:45:57,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:45:57,636 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:45:57,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850780261] [2024-11-09 04:45:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850780261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [110802139] [2024-11-09 04:45:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:57,637 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:45:57,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:45:57,640 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:45:57,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2024-11-09 04:45:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:59,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 04:45:59,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:59,655 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 [2024-11-09 04:46:00,439 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 [2024-11-09 04:46:01,074 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 [2024-11-09 04:46:01,661 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 [2024-11-09 04:46:02,287 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 [2024-11-09 04:46:03,056 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 [2024-11-09 04:46:03,618 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 [2024-11-09 04:46:04,103 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 [2024-11-09 04:46:04,547 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 13 treesize of output 1 [2024-11-09 04:46:04,788 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 [2024-11-09 04:46:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 04:46:04,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:46:04,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1548) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset))))) is different from false [2024-11-09 04:46:05,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1547) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base v_ArrVal_1546))) (or (= ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (_ bv0 8)) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1505) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset))))))) is different from false [2024-11-09 04:46:05,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [110802139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097676018] [2024-11-09 04:46:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:05,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:05,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:05,103 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:46:05,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-09 04:46:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:06,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 04:46:06,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:07,655 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 [2024-11-09 04:46:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 04:46:07,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:46:07,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097676018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:07,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:46:07,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15, 11] total 28 [2024-11-09 04:46:07,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194691314] [2024-11-09 04:46:07,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:07,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:46:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:46:07,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:46:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=865, Unknown=27, NotChecked=126, Total=1190 [2024-11-09 04:46:07,759 INFO L87 Difference]: Start difference. First operand 172 states and 221 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:46:09,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:46:12,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:46:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:12,885 INFO L93 Difference]: Finished difference Result 330 states and 424 transitions. [2024-11-09 04:46:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:46:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-09 04:46:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:12,887 INFO L225 Difference]: With dead ends: 330 [2024-11-09 04:46:12,887 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 04:46:12,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=182, Invalid=921, Unknown=27, NotChecked=130, Total=1260 [2024-11-09 04:46:12,888 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:12,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 387 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-09 04:46:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 04:46:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-09 04:46:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 144 states have (on average 1.25) internal successors, (180), 144 states have internal predecessors, (180), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:46:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 204 transitions. [2024-11-09 04:46:12,914 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 204 transitions. Word has length 129 [2024-11-09 04:46:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:12,915 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 204 transitions. [2024-11-09 04:46:12,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 04:46:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2024-11-09 04:46:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 04:46:12,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:12,917 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:12,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:46:13,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2024-11-09 04:46:13,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2024-11-09 04:46:13,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:13,518 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:13,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:13,518 INFO L85 PathProgramCache]: Analyzing trace with hash 148785054, now seen corresponding path program 1 times [2024-11-09 04:46:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:46:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781524021] [2024-11-09 04:46:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:13,519 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 [2024-11-09 04:46:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:46:13,520 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 04:46:13,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba4b11d0-1aae-4d68-84bd-de4fdb5254fd/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 04:46:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:14,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 04:46:14,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:21,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-09 04:46:22,602 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 51 treesize of output 45 [2024-11-09 04:46:24,669 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 78 treesize of output 64 [2024-11-09 04:46:25,042 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 78 treesize of output 64 [2024-11-09 04:46:25,966 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 138 treesize of output 82 [2024-11-09 04:46:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 04:46:26,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:46:26,979 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1616))) (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (_ bv17222 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)))))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)))))) is different from false [2024-11-09 04:46:27,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_1615) c_~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base v_ArrVal_1616))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (bvadd (_ bv17222 32) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))))))))) is different from false