./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:24:19,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:24:19,819 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:24:19,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:24:19,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:24:19,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:24:19,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:24:19,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:24:19,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:24:19,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:24:19,869 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:24:19,869 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:24:19,870 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:24:19,870 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:24:19,870 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:24:19,871 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:24:19,871 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:24:19,871 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:24:19,871 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:24:19,872 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:24:19,872 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:24:19,876 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:24:19,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:24:19,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:24:19,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:24:19,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:24:19,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:24:19,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:24:19,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:24:19,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:24:19,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:24:19,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:24:19,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:24:19,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:24:19,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:24:19,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:24:19,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:24:19,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:24:19,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:24:19,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:24:19,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:24:19,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:24:19,894 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:24:19,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:24:19,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:24:19,895 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:24:19,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:24:19,896 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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 -> 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e [2024-11-09 05:24:20,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:24:20,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:24:20,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:24:20,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:24:20,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:24:20,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i Unable to find full path for "g++" [2024-11-09 05:24:22,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:24:22,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:24:22,391 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2024-11-09 05:24:22,401 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/data/f0c30352c/d217518163034233903a00e7dd051469/FLAGf39b0eca5 [2024-11-09 05:24:22,424 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/data/f0c30352c/d217518163034233903a00e7dd051469 [2024-11-09 05:24:22,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:24:22,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:24:22,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:24:22,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:24:22,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:24:22,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcb682f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22, skipping insertion in model container [2024-11-09 05:24:22,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:24:22,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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2024-11-09 05:24:22,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:24:22,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:24:22,796 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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2024-11-09 05:24:22,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:24:22,849 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:24:22,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22 WrapperNode [2024-11-09 05:24:22,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:24:22,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:24:22,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:24:22,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:24:22,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,925 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2024-11-09 05:24:22,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:24:22,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:24:22,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:24:22,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:24:22,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:24:22,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:24:22,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:24:22,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:24:22,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (1/1) ... [2024-11-09 05:24:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:24:23,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:24:23,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:24:23,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:24:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:24:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 05:24:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:24:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 05:24:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:24:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 05:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 05:24:23,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 05:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:24:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:24:23,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:24:23,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:24:23,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:24:23,798 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-09 05:24:23,799 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:24:24,423 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:24:24,424 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:24:24,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:24:24 BoogieIcfgContainer [2024-11-09 05:24:24,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:24:24,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:24:24,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:24:24,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:24:24,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:24:22" (1/3) ... [2024-11-09 05:24:24,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dee8c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:24:24, skipping insertion in model container [2024-11-09 05:24:24,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:22" (2/3) ... [2024-11-09 05:24:24,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dee8c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:24:24, skipping insertion in model container [2024-11-09 05:24:24,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:24:24" (3/3) ... [2024-11-09 05:24:24,440 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-31.i [2024-11-09 05:24:24,462 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:24:24,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:24:24,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:24:24,535 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;@54e0d034, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:24:24,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:24:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:24:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 05:24:24,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:24,550 INFO L215 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:24,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:24:24,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:24,557 INFO L85 PathProgramCache]: Analyzing trace with hash 670137007, now seen corresponding path program 1 times [2024-11-09 05:24:24,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:24:24,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690094226] [2024-11-09 05:24:24,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:24:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:24:25,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1173835023] [2024-11-09 05:24:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:25,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:24:25,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:24:25,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:24:25,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:24:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:24:26,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:24:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:24:26,609 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:24:26,611 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:24:26,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 05:24:26,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:24:26,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 05:24:26,820 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 05:24:26,914 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:24:26,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:24:26 BoogieIcfgContainer [2024-11-09 05:24:26,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:24:26,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:24:26,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:24:26,921 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:24:26,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:24:24" (3/4) ... [2024-11-09 05:24:26,924 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 05:24:26,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:24:26,927 INFO L158 Benchmark]: Toolchain (without parser) took 4498.36ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 120.8MB in the beginning and 136.1MB in the end (delta: -15.2MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-11-09 05:24:26,928 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 161.5MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:24:26,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.92ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 104.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 05:24:26,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.39ms. Allocated memory is still 161.5MB. Free memory was 104.5MB in the beginning and 100.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 05:24:26,931 INFO L158 Benchmark]: Boogie Preprocessor took 60.61ms. Allocated memory is still 161.5MB. Free memory was 100.9MB in the beginning and 98.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:24:26,932 INFO L158 Benchmark]: RCFGBuilder took 1438.02ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 98.3MB in the beginning and 126.4MB in the end (delta: -28.1MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2024-11-09 05:24:26,932 INFO L158 Benchmark]: TraceAbstraction took 2487.58ms. Allocated memory is still 205.5MB. Free memory was 125.4MB in the beginning and 136.1MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:24:26,934 INFO L158 Benchmark]: Witness Printer took 8.62ms. Allocated memory is still 205.5MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:24:26,937 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.29ms. Allocated memory is still 161.5MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.92ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 104.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.39ms. Allocated memory is still 161.5MB. Free memory was 104.5MB in the beginning and 100.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.61ms. Allocated memory is still 161.5MB. Free memory was 100.9MB in the beginning and 98.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1438.02ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 98.3MB in the beginning and 126.4MB in the end (delta: -28.1MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2487.58ms. Allocated memory is still 205.5MB. Free memory was 125.4MB in the beginning and 136.1MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.62ms. Allocated memory is still 205.5MB. Free memory is still 136.1MB. 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 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] double double_Array_0[2] = { 0.97, 32.6 }; [L30] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L35] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0][0]); [L36] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1][0]); [L37] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer = &(signed_long_int_Array_0[0][1]); [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer = &(signed_long_int_Array_0[1][1]); [L39-L41] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L44] double last_1_double_Array_0_0_ = 0.97; [L45] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L104] EXPR double_Array_0[0] [L104] last_1_double_Array_0_0_ = double_Array_0[0] [L105] EXPR signed_long_int_Array_0[1][0] [L105] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L85] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L86] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L86] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L87] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L88] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L89] EXPR BOOL_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L89] CALL assume_abort_if_not(BOOL_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(BOOL_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L90] EXPR BOOL_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L90] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L91] double_Array_0[1] = __VERIFIER_nondet_double() [L92] EXPR double_Array_0[1] [L92] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L92] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) [L92] EXPR double_Array_0[1] [L92] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L92] EXPR double_Array_0[1] [L92] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L92] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L93] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L94] EXPR signed_long_int_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L95] EXPR signed_long_int_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L95] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L96] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L97] EXPR signed_long_int_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L97] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L97] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] EXPR signed_long_int_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L99] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L100] EXPR 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L100] CALL assume_abort_if_not(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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L100] RET assume_abort_if_not(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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L101] EXPR 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) [L101] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L116] RET updateVariables() [L117] CALL step() [L49] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L49] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L49] COND TRUE ! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_)) [L50] COND TRUE ((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_ [L51] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L51] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L52] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L52] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L58] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L58] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L58] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L61] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L61] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) [L63] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L63] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L63] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L74] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L74] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L76] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L76] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L77] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L77] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) = (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L108] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1) [L108] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))))) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))) [L108] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))))) [L108] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L108] EXPR (! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L108] EXPR (((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1 [L108] EXPR (! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L108] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) [L108] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) [L108] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L108] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L108] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) [L108] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) [L108-L109] return ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ; [L118] RET, EXPR property() [L118] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 1, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 2 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 05:24:26,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:24:29,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:24:29,628 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 05:24:29,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:24:29,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:24:29,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:24:29,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:24:29,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:24:29,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:24:29,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:24:29,674 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:24:29,674 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:24:29,675 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:24:29,676 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:24:29,676 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:24:29,676 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:24:29,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:24:29,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:24:29,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:24:29,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:24:29,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:24:29,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:24:29,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:24:29,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:24:29,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:24:29,683 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 05:24:29,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:24:29,684 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 05:24:29,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:24:29,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:24:29,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:24:29,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:24:29,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 05:24:29,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:24:29,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:24:29,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:24:29,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:24:29,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:24:29,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:24:29,688 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 05:24:29,688 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 05:24:29,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:24:29,691 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:24:29,692 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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 -> 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e [2024-11-09 05:24:30,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:24:30,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:24:30,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:24:30,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:24:30,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:24:30,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i Unable to find full path for "g++" [2024-11-09 05:24:32,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:24:32,777 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:24:32,778 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2024-11-09 05:24:32,788 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/data/a4b7d1fe5/56b3929f073946b08c7974ef36579907/FLAG1cef6bc82 [2024-11-09 05:24:32,990 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/data/a4b7d1fe5/56b3929f073946b08c7974ef36579907 [2024-11-09 05:24:32,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:24:32,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:24:32,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:24:32,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:24:33,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:24:33,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:24:32" (1/1) ... [2024-11-09 05:24:33,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd3bdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33, skipping insertion in model container [2024-11-09 05:24:33,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:24:32" (1/1) ... [2024-11-09 05:24:33,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:24:33,274 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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2024-11-09 05:24:33,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:24:33,433 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:24:33,462 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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2024-11-09 05:24:33,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:24:33,554 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:24:33,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33 WrapperNode [2024-11-09 05:24:33,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:24:33,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:24:33,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:24:33,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:24:33,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,642 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-11-09 05:24:33,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:24:33,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:24:33,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:24:33,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:24:33,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:24:33,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:24:33,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:24:33,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:24:33,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (1/1) ... [2024-11-09 05:24:33,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:24:33,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:24:33,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:24:33,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:24:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:24:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 05:24:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 05:24:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 05:24:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 05:24:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 05:24:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-09 05:24:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 05:24:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 05:24:33,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 05:24:33,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:24:33,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:24:33,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 05:24:33,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 05:24:33,929 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:24:33,931 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:24:34,678 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-09 05:24:34,678 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:24:34,693 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:24:34,694 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:24:34,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:24:34 BoogieIcfgContainer [2024-11-09 05:24:34,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:24:34,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:24:34,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:24:34,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:24:34,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:24:32" (1/3) ... [2024-11-09 05:24:34,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6bf2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:24:34, skipping insertion in model container [2024-11-09 05:24:34,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:24:33" (2/3) ... [2024-11-09 05:24:34,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6bf2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:24:34, skipping insertion in model container [2024-11-09 05:24:34,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:24:34" (3/3) ... [2024-11-09 05:24:34,703 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-31.i [2024-11-09 05:24:34,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:24:34,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:24:34,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:24:34,790 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;@50df29f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:24:34,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:24:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:24:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 05:24:34,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:34,806 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:34,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:24:34,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:34,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1826797769, now seen corresponding path program 1 times [2024-11-09 05:24:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:24:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507121863] [2024-11-09 05:24:34,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:34,824 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 05:24:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:24:34,826 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:34,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:35,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 05:24:35,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:24:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-09 05:24:35,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:24:35,215 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:24:35,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507121863] [2024-11-09 05:24:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507121863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:35,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:24:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245753165] [2024-11-09 05:24:35,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:35,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 05:24:35,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:24:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 05:24:35,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:24:35,259 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:24:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:35,306 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2024-11-09 05:24:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 05:24:35,309 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-09 05:24:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:35,318 INFO L225 Difference]: With dead ends: 164 [2024-11-09 05:24:35,318 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 05:24:35,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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 05:24:35,324 INFO L432 NwaCegarLoop]: 114 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, 114 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 05:24:35,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:24:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 05:24:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 05:24:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:24:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-09 05:24:35,376 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2024-11-09 05:24:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:35,376 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-09 05:24:35,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:24:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-09 05:24:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 05:24:35,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:35,385 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:35,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:35,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:35,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:24:35,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:35,588 INFO L85 PathProgramCache]: Analyzing trace with hash 529969649, now seen corresponding path program 1 times [2024-11-09 05:24:35,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:24:35,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053774730] [2024-11-09 05:24:35,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:35,589 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 05:24:35,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:24:35,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:35,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:35,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:24:35,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:24:35,985 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 05:24:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:24:36,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:24:36,032 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:24:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053774730] [2024-11-09 05:24:36,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053774730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:24:36,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:24:36,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:24:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582112566] [2024-11-09 05:24:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:24:36,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:24:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:24:36,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:24:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:24:36,036 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:24:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:24:36,084 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2024-11-09 05:24:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:24:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-09 05:24:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:24:36,087 INFO L225 Difference]: With dead ends: 157 [2024-11-09 05:24:36,090 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 05:24:36,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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 05:24:36,092 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:24:36,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:24:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 05:24:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 05:24:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:24:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-09 05:24:36,109 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2024-11-09 05:24:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:24:36,113 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-09 05:24:36,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:24:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-09 05:24:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 05:24:36,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:24:36,117 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:24:36,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:36,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:36,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:24:36,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:24:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1058378253, now seen corresponding path program 1 times [2024-11-09 05:24:36,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:24:36,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785577023] [2024-11-09 05:24:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:36,320 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 05:24:36,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:24:36,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:36,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:24:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:36,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:24:36,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:24:40,699 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 05:24:41,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:24:42,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:24:42,476 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 32 treesize of output 30 [2024-11-09 05:24:42,791 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 30 [2024-11-09 05:24:43,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2024-11-09 05:24:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 05:24:43,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:24:46,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset (bvadd (bvneg (select (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_71))) (let ((.cse0 (bvadd (select (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))))) (= .cse0 (let ((.cse1 (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset .cse0)))) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))))))) is different from false [2024-11-09 05:24:49,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset (bvadd (bvneg (select (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_71))) (let ((.cse0 (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) (select (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)))) (= .cse0 (let ((.cse1 (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset .cse0)))) (bvadd (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))))))))) is different from false [2024-11-09 05:24:49,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_69))) (store .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (store (select .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset (bvadd (bvneg (select (select .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) ((_ zero_extend 24) ((_ extract 7 0) (select v_ArrVal_69 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))))) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_71))) (let ((.cse0 (bvadd (select (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))))) (= .cse0 (let ((.cse1 (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset .cse0)))) (bvadd (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))) (_ bv2 32)))))))) is different from false [2024-11-09 05:24:49,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:24:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785577023] [2024-11-09 05:24:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785577023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:24:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [95240449] [2024-11-09 05:24:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:24:49,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:24:49,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:24:49,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:24:49,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 05:24:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:24:51,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 05:24:51,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:25:02,671 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 05:25:05,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:25:08,053 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-09 05:25:08,053 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 25 treesize of output 35 [2024-11-09 05:25:09,048 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 41 treesize of output 35 [2024-11-09 05:25:09,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-11-09 05:25:10,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2024-11-09 05:25:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 05:25:12,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:25:13,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_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_71 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset))))) (let ((.cse3 (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset .cse4)))) (store .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (store (select .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse4)) (bvneg (select (select .cse3 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))))))) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_71))) (let ((.cse2 (bvadd (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))))) (= (let ((.cse0 (store .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset .cse2)))) (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))) .cse2)))) is different from false [2024-11-09 05:25:14,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [95240449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:25:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655767761] [2024-11-09 05:25:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:25:14,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:25:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:25:14,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:25:14,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:25:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:25:14,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 05:25:14,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:25:22,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:25:22,257 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 26 treesize of output 29 [2024-11-09 05:25:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 05:25:23,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:25:23,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:25:23,205 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 119 treesize of output 106 [2024-11-09 05:25:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:25:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655767761] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 05:25:27,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:25:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13, 14, 7] total 25 [2024-11-09 05:25:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010319939] [2024-11-09 05:25:27,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:25:27,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:25:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:25:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:25:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=548, Unknown=13, NotChecked=212, Total=930 [2024-11-09 05:25:27,538 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:25:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:25:30,648 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2024-11-09 05:25:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:25:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-09 05:25:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:25:30,652 INFO L225 Difference]: With dead ends: 191 [2024-11-09 05:25:30,652 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 05:25:30,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=182, Invalid=691, Unknown=13, NotChecked=236, Total=1122 [2024-11-09 05:25:30,654 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 161 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:25:30,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 292 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 05:25:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 05:25:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2024-11-09 05:25:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:25:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-09 05:25:30,670 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 94 [2024-11-09 05:25:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:25:30,670 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-09 05:25:30,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:25:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-09 05:25:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 05:25:30,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:25:30,673 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:25:30,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:25:30,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 05:25:31,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-09 05:25:31,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:25:31,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:25:31,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:25:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1412940558, now seen corresponding path program 1 times [2024-11-09 05:25:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:25:31,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991141608] [2024-11-09 05:25:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:25:31,276 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 05:25:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:25:31,280 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:31,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:25:31,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:25:31,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:25:31,608 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 05:25:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:25:31,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:25:31,716 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:25:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991141608] [2024-11-09 05:25:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991141608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:25:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:25:31,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:25:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605653855] [2024-11-09 05:25:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:25:31,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:25:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:25:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:25:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:25:31,719 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:25:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:25:31,817 INFO L93 Difference]: Finished difference Result 165 states and 233 transitions. [2024-11-09 05:25:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:25:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-09 05:25:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:25:31,820 INFO L225 Difference]: With dead ends: 165 [2024-11-09 05:25:31,820 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 05:25:31,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:25:31,822 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:25:31,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:25:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 05:25:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 05:25:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:25:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 117 transitions. [2024-11-09 05:25:31,840 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 117 transitions. Word has length 96 [2024-11-09 05:25:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:25:31,840 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 117 transitions. [2024-11-09 05:25:31,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:25:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 117 transitions. [2024-11-09 05:25:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 05:25:31,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:25:31,845 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:25:31,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:25:32,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:32,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:25:32,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:25:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1019913548, now seen corresponding path program 1 times [2024-11-09 05:25:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:25:32,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755553006] [2024-11-09 05:25:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:25:32,048 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 05:25:32,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:25:32,049 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:32,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:25:32,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 05:25:32,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:25:44,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:25:45,212 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 24 treesize of output 27 [2024-11-09 05:25:45,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-09 05:25:46,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2024-11-09 05:25:47,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 52 [2024-11-09 05:25:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:25:47,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:25:47,804 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:25:47,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755553006] [2024-11-09 05:25:47,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755553006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:25:47,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:25:47,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:25:47,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551358157] [2024-11-09 05:25:47,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:25:47,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:25:47,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:25:47,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:25:47,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:25:47,808 INFO L87 Difference]: Start difference. First operand 84 states and 117 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:25:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:25:55,712 INFO L93 Difference]: Finished difference Result 201 states and 279 transitions. [2024-11-09 05:25:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:25:55,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-09 05:25:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:25:55,714 INFO L225 Difference]: With dead ends: 201 [2024-11-09 05:25:55,715 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 05:25:55,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-09 05:25:55,716 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 192 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:25:55,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 405 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 05:25:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 05:25:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 86. [2024-11-09 05:25:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:25:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2024-11-09 05:25:55,732 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 96 [2024-11-09 05:25:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:25:55,732 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2024-11-09 05:25:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:25:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2024-11-09 05:25:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 05:25:55,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:25:55,735 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:25:55,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:55,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:55,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:25:55,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:25:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash -490676581, now seen corresponding path program 1 times [2024-11-09 05:25:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:25:55,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779368906] [2024-11-09 05:25:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:25:55,938 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 05:25:55,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:25:55,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:55,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:25:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:25:56,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 05:25:56,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:26:05,488 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 05:26:08,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:26:10,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:26:10,900 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 32 treesize of output 30 [2024-11-09 05:26:11,340 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 30 [2024-11-09 05:26:11,808 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 51 treesize of output 27 [2024-11-09 05:26:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 05:26:12,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:26:14,344 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:26:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779368906] [2024-11-09 05:26:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779368906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:26:14,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [716855524] [2024-11-09 05:26:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:14,345 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:26:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:26:14,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:26:14,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-09 05:26:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:14,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 05:26:14,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:26:18,925 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 05:26:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:26:19,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:26:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [716855524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:19,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:26:19,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-09 05:26:19,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550603098] [2024-11-09 05:26:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:19,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:26:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:26:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:26:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=344, Unknown=15, NotChecked=0, Total=420 [2024-11-09 05:26:19,494 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:26:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:22,021 INFO L93 Difference]: Finished difference Result 201 states and 277 transitions. [2024-11-09 05:26:22,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:26:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-09 05:26:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:22,024 INFO L225 Difference]: With dead ends: 201 [2024-11-09 05:26:22,024 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 05:26:22,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=67, Invalid=380, Unknown=15, NotChecked=0, Total=462 [2024-11-09 05:26:22,026 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 149 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:22,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 343 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 05:26:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 05:26:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 86. [2024-11-09 05:26:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:26:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-11-09 05:26:22,040 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 96 [2024-11-09 05:26:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:22,041 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-11-09 05:26:22,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:26:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-11-09 05:26:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 05:26:22,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:22,048 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:26:22,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:26:22,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-09 05:26:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:26:22,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:26:22,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash -81200918, now seen corresponding path program 1 times [2024-11-09 05:26:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:26:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049603233] [2024-11-09 05:26:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:22,450 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 05:26:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:26:22,454 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:26:22,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:26:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:22,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 05:26:22,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:26:26,537 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 05:26:30,082 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 05:26:31,879 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 05:26:33,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:26:35,753 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 05:26:37,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:26:38,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:26:38,488 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 05:26:39,037 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 05:26:39,434 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 27 treesize of output 15 [2024-11-09 05:26:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 05:26:39,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:26:40,839 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_251))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_252) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))))))) is different from false [2024-11-09 05:26:40,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_250 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_250) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_251))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_252) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset)))) (= ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset)) (_ bv0 8))))) is different from false [2024-11-09 05:26:41,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_249) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_250) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_251))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (not (= ((_ extract 7 0) (select (select (store .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_252) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset)) (_ bv0 8)))))) is different from false [2024-11-09 05:26:41,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:26:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049603233] [2024-11-09 05:26:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049603233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:26:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1788099602] [2024-11-09 05:26:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:26:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:26:41,311 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:26:41,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-09 05:26:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:41,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 05:26:41,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:26:45,622 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 05:26:45,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 05:26:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:26:49,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:26:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1788099602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:26:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-11-09 05:26:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607616714] [2024-11-09 05:26:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:49,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:26:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:26:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:26:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=490, Unknown=4, NotChecked=144, Total=756 [2024-11-09 05:26:49,943 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:26:55,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:26:56,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:26:58,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:27:00,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:27:02,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:27:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:27:02,066 INFO L93 Difference]: Finished difference Result 194 states and 264 transitions. [2024-11-09 05:27:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:27:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-09 05:27:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:27:02,068 INFO L225 Difference]: With dead ends: 194 [2024-11-09 05:27:02,068 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 05:27:02,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=135, Invalid=575, Unknown=4, NotChecked=156, Total=870 [2024-11-09 05:27:02,071 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 127 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:27:02,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 261 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2024-11-09 05:27:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 05:27:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2024-11-09 05:27:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:27:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-11-09 05:27:02,093 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 97 [2024-11-09 05:27:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:27:02,093 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-11-09 05:27:02,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:27:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-09 05:27:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 05:27:02,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:27:02,095 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:27:02,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:27:02,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-09 05:27:02,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:27:02,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:27:02,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:27:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash -928397417, now seen corresponding path program 1 times [2024-11-09 05:27:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:27:02,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288866403] [2024-11-09 05:27:02,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:02,497 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 05:27:02,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:27:02,500 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:27:02,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:27:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:02,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 05:27:02,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:14,723 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 05:27:17,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 05:27:17,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:18,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:18,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:19,822 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 54 treesize of output 30 [2024-11-09 05:27:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 05:27:20,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:27:22,372 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:27:22,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288866403] [2024-11-09 05:27:22,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288866403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:27:22,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [681450948] [2024-11-09 05:27:22,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:22,373 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:27:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:27:22,374 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:27:22,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-09 05:27:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:23,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 05:27:23,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:35,132 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 05:27:37,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 05:27:37,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:37,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:38,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:38,923 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 54 treesize of output 30 [2024-11-09 05:27:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 05:27:38,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:27:41,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [681450948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:27:41,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466656957] [2024-11-09 05:27:41,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:41,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:27:41,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:27:41,051 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:27:41,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 05:27:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:41,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 05:27:41,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:53,826 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 05:27:55,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 05:27:56,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:56,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:56,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-11-09 05:27:57,503 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 54 treesize of output 30 [2024-11-09 05:27:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 05:27:57,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:28:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466656957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:28:00,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:28:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 12 [2024-11-09 05:28:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521569588] [2024-11-09 05:28:00,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:28:00,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:28:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:28:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:28:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=345, Unknown=37, NotChecked=0, Total=462 [2024-11-09 05:28:00,011 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 05:28:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:28:08,351 INFO L93 Difference]: Finished difference Result 223 states and 303 transitions. [2024-11-09 05:28:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:28:08,353 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 98 [2024-11-09 05:28:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:28:08,354 INFO L225 Difference]: With dead ends: 223 [2024-11-09 05:28:08,355 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 05:28:08,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 344 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=159, Invalid=506, Unknown=37, NotChecked=0, Total=702 [2024-11-09 05:28:08,356 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 254 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:28:08,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 488 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-09 05:28:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 05:28:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2024-11-09 05:28:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:28:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2024-11-09 05:28:08,374 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 98 [2024-11-09 05:28:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:28:08,375 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2024-11-09 05:28:08,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 05:28:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2024-11-09 05:28:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 05:28:08,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:28:08,376 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:28:08,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:28:08,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-09 05:28:08,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 05:28:08,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:28:08,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:28:08,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:28:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1261902014, now seen corresponding path program 1 times [2024-11-09 05:28:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:28:08,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211815392] [2024-11-09 05:28:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:08,979 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 05:28:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:28:08,980 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:28:08,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 (16)] Waiting until timeout for monitored process [2024-11-09 05:28:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:09,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 05:28:09,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:28:18,814 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 05:28:21,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:28:24,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:28:24,460 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 32 treesize of output 30 [2024-11-09 05:28:24,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 36 treesize of output 30 [2024-11-09 05:28:25,367 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 51 treesize of output 27 [2024-11-09 05:28:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 05:28:25,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:28:25,977 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem30#1_28| (_ BitVec 8)) (v_ArrVal_385 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (select (select (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_385) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem30#1_28|)))) is different from false [2024-11-09 05:28:29,380 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:28:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211815392] [2024-11-09 05:28:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211815392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:28:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [838407134] [2024-11-09 05:28:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:29,381 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:28:29,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:28:29,382 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:28:29,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-09 05:28:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:30,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 05:28:30,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:28:42,979 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 05:28:45,608 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 05:28:48,357 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 05:28:48,782 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 24 treesize of output 27 [2024-11-09 05:28:49,492 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 29 treesize of output 25 [2024-11-09 05:28:50,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2024-11-09 05:28:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 05:28:52,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:28:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:28:53,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [838407134] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 05:28:53,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:28:53,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 24 [2024-11-09 05:28:53,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262275626] [2024-11-09 05:28:53,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:28:53,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:28:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:28:53,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:28:53,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=621, Unknown=6, NotChecked=50, Total=756 [2024-11-09 05:28:53,947 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:28:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:28:56,876 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2024-11-09 05:28:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:28:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-09 05:28:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:28:56,878 INFO L225 Difference]: With dead ends: 286 [2024-11-09 05:28:56,878 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 05:28:56,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=91, Invalid=777, Unknown=6, NotChecked=56, Total=930 [2024-11-09 05:28:56,879 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 36 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:28:56,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 541 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 05:28:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 05:28:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 128. [2024-11-09 05:28:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 115 states have internal predecessors, (153), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:28:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2024-11-09 05:28:56,896 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 99 [2024-11-09 05:28:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:28:56,897 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2024-11-09 05:28:56,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:28:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2024-11-09 05:28:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 05:28:56,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:28:56,898 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:28:56,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-09 05:28:57,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 (16)] Ended with exit code 0 [2024-11-09 05:28:57,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:28:57,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:28:57,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:28:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2011996928, now seen corresponding path program 1 times [2024-11-09 05:28:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:28:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665468602] [2024-11-09 05:28:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:57,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 05:28:57,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:28:57,307 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:28:57,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:28:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:57,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:28:57,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:28:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:28:58,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:28:58,031 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:28:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665468602] [2024-11-09 05:28:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665468602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:28:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:28:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:28:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377394364] [2024-11-09 05:28:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:28:58,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:28:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:28:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:28:58,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:28:58,033 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:29:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:00,188 INFO L93 Difference]: Finished difference Result 306 states and 417 transitions. [2024-11-09 05:29:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:29:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-09 05:29:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:00,190 INFO L225 Difference]: With dead ends: 306 [2024-11-09 05:29:00,190 INFO L226 Difference]: Without dead ends: 181 [2024-11-09 05:29:00,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:29:00,191 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:29:00,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 388 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 05:29:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-09 05:29:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 138. [2024-11-09 05:29:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:29:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2024-11-09 05:29:00,206 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 99 [2024-11-09 05:29:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:00,207 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2024-11-09 05:29:00,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:29:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2024-11-09 05:29:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 05:29:00,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:00,208 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:29:00,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:29:00,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:29:00,409 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:29:00,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:00,410 INFO L85 PathProgramCache]: Analyzing trace with hash 423649026, now seen corresponding path program 1 times [2024-11-09 05:29:00,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:29:00,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633005604] [2024-11-09 05:29:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:00,410 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 05:29:00,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:29:00,411 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:29:00,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:29:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:00,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:29:00,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:29:01,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:29:01,044 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:29:01,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633005604] [2024-11-09 05:29:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633005604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:29:01,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:29:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:29:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141092850] [2024-11-09 05:29:01,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:29:01,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:29:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:29:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:29:01,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:29:01,046 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:29:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:03,305 INFO L93 Difference]: Finished difference Result 304 states and 407 transitions. [2024-11-09 05:29:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:29:03,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-09 05:29:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:03,308 INFO L225 Difference]: With dead ends: 304 [2024-11-09 05:29:03,308 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 05:29:03,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:29:03,309 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 39 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:29:03,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 377 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 05:29:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 05:29:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2024-11-09 05:29:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 113 states have internal predecessors, (145), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:29:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2024-11-09 05:29:03,354 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 99 [2024-11-09 05:29:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2024-11-09 05:29:03,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:29:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2024-11-09 05:29:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 05:29:03,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:03,356 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:29:03,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:29:03,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:29:03,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:29:03,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -541076033, now seen corresponding path program 1 times [2024-11-09 05:29:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:29:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751970839] [2024-11-09 05:29:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:03,558 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 05:29:03,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:29:03,559 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:29:03,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Waiting until timeout for monitored process [2024-11-09 05:29:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:03,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 05:29:03,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:07,110 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 26 treesize of output 24 [2024-11-09 05:29:12,426 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 26 treesize of output 24 [2024-11-09 05:29:18,026 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 26 treesize of output 24 [2024-11-09 05:29:22,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 05:29:27,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 05:29:33,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-09 05:29:40,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:40,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2024-11-09 05:29:43,048 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 67 [2024-11-09 05:29:44,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:44,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 86 [2024-11-09 05:29:47,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:47,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 85 [2024-11-09 05:29:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 203 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 05:29:47,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:29:50,373 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (forall ((v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_481))) (store .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset (bvadd (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))))))))) (bvslt (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))))))) is different from false [2024-11-09 05:29:50,589 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd (select (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (forall ((v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_481))) (store .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset (bvadd (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))))))))) (bvslt (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))))))) is different from false [2024-11-09 05:29:50,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset (bvadd (bvneg (select (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))))) (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (bvslt (bvadd (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|))) (forall ((v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (let ((.cse2 (store .cse0 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_481))) (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) (select (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))))))) (bvslt (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) c_~last_1_signed_long_int_Array_0_1__0_~0))))))) is different from false [2024-11-09 05:29:55,248 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:29:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751970839] [2024-11-09 05:29:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751970839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:29:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [182174959] [2024-11-09 05:29:55,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:29:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:29:55,250 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:29:55,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-09 05:29:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:56,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 05:29:56,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:08,955 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 05:30:12,542 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 05:30:19,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:30:25,889 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2024-11-09 05:30:25,890 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 46 treesize of output 51 [2024-11-09 05:30:27,728 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:30:27,728 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 74 treesize of output 64 [2024-11-09 05:30:27,985 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 18 treesize of output 16 [2024-11-09 05:30:29,769 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-09 05:30:29,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 96 [2024-11-09 05:30:34,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 74 [2024-11-09 05:30:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 05:30:34,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:39,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base (_ BitVec 32)) (v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset (_ BitVec 32))) (not (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset (bvadd (bvneg (select (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) ((_ zero_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_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_509))) (store .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))))))) (bvslt (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset) c_~last_1_signed_long_int_Array_0_1__0_~0))))) is different from false [2024-11-09 05:30:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [182174959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:30:45,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831999508] [2024-11-09 05:30:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:30:45,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:30:45,248 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:30:45,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 05:30:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:45,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 05:30:45,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:06,485 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2024-11-09 05:31:06,486 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 39 treesize of output 48 [2024-11-09 05:31:09,170 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:31:09,171 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 79 treesize of output 69 [2024-11-09 05:31:09,343 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 18 treesize of output 16 [2024-11-09 05:31:11,461 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-09 05:31:11,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 101 [2024-11-09 05:31:21,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 167 [2024-11-09 05:31:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:31:22,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:31:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831999508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:31:22,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:31:22,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19, 15] total 42 [2024-11-09 05:31:22,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452737463] [2024-11-09 05:31:22,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:31:22,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:31:22,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:31:22,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:31:22,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2214, Unknown=35, NotChecked=404, Total=2970 [2024-11-09 05:31:22,745 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:31:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:31:50,696 INFO L93 Difference]: Finished difference Result 459 states and 603 transitions. [2024-11-09 05:31:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:31:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-09 05:31:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:31:50,698 INFO L225 Difference]: With dead ends: 459 [2024-11-09 05:31:50,698 INFO L226 Difference]: Without dead ends: 336 [2024-11-09 05:31:50,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=408, Invalid=2877, Unknown=37, NotChecked=460, Total=3782 [2024-11-09 05:31:50,701 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 200 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 12 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:31:50,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 802 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 926 Invalid, 13 Unknown, 0 Unchecked, 16.2s Time] [2024-11-09 05:31:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-09 05:31:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 188. [2024-11-09 05:31:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.2515337423312884) internal successors, (204), 163 states have internal predecessors, (204), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 05:31:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 248 transitions. [2024-11-09 05:31:50,735 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 248 transitions. Word has length 99 [2024-11-09 05:31:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:31:50,736 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 248 transitions. [2024-11-09 05:31:50,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:31:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 248 transitions. [2024-11-09 05:31:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 05:31:50,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:31:50,738 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:31:50,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:31:50,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-09 05:31:51,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-09 05:31:51,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:31:51,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:31:51,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:31:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1652853115, now seen corresponding path program 1 times [2024-11-09 05:31:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:31:51,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870607361] [2024-11-09 05:31:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:51,340 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 05:31:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:31:51,341 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:31:51,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:31:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:51,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:31:51,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:31:51,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:31:51,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:31:51,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870607361] [2024-11-09 05:31:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870607361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:31:51,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:31:51,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:31:51,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329093889] [2024-11-09 05:31:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:31:51,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:31:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:31:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:31:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:31:51,920 INFO L87 Difference]: Start difference. First operand 188 states and 248 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:31:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:31:52,308 INFO L93 Difference]: Finished difference Result 314 states and 416 transitions. [2024-11-09 05:31:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:31:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-11-09 05:31:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:31:52,310 INFO L225 Difference]: With dead ends: 314 [2024-11-09 05:31:52,310 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 05:31:52,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:31:52,311 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:31:52,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:31:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 05:31:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2024-11-09 05:31:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.2515337423312884) internal successors, (204), 163 states have internal predecessors, (204), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 05:31:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 248 transitions. [2024-11-09 05:31:52,336 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 248 transitions. Word has length 100 [2024-11-09 05:31:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:31:52,337 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 248 transitions. [2024-11-09 05:31:52,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:31:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 248 transitions. [2024-11-09 05:31:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 05:31:52,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:31:52,338 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:31:52,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:31:52,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:31:52,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:31:52,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:31:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1018014364, now seen corresponding path program 1 times [2024-11-09 05:31:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:31:52,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968702254] [2024-11-09 05:31:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:52,541 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 05:31:52,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:31:52,545 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:31:52,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Waiting until timeout for monitored process [2024-11-09 05:31:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:52,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 05:31:52,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:32:01,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 05:32:06,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:09,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:13,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:17,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:18,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:19,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 100 [2024-11-09 05:32:20,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2024-11-09 05:32:24,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 81 [2024-11-09 05:32:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 05:32:25,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:32:27,689 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_586))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse4 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (select .cse4 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 05:32:27,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32)))) (or (not (= (let ((.cse0 (let ((.cse1 (select |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|)))) (let ((.cse5 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse6 (store (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_586))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse6 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse4 .cse5) (select .cse4 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) (let ((.cse7 (let ((.cse8 (select .cse6 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse8 .cse2) (select .cse8 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-09 05:32:28,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (.cse7 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_583))) (or (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_586))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|))))))) is different from false [2024-11-09 05:32:28,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (.cse7 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_582) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_583))) (or (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_586))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|))))))) is different from false [2024-11-09 05:32:28,795 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:32:28,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968702254] [2024-11-09 05:32:28,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968702254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:32:28,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [696410925] [2024-11-09 05:32:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:28,796 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:32:28,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:32:28,797 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:32:28,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-09 05:32:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:30,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 05:32:30,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:32:38,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 05:32:41,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:45,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:48,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:51,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:52,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2024-11-09 05:32:52,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 100 [2024-11-09 05:32:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2024-11-09 05:32:56,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 81 [2024-11-09 05:32:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 05:32:56,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:32:57,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_616))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse4 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (select .cse4 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 05:32:57,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_89| (_ BitVec 64)) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32)))) (or (not (= (let ((.cse0 (let ((.cse1 (select |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_89|)))) (let ((.cse5 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse6 (store (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_89|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_89|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_616))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse6 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse4 .cse5) (select .cse4 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) (let ((.cse7 (let ((.cse8 (select .cse6 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse8 .cse2) (select .cse8 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-09 05:32:57,678 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_89| (_ BitVec 64)) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (.cse3 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_614))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_89|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_89|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_89|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_616))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 05:32:57,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_89| (_ BitVec 64)) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (.cse7 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_613) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_614))) (or (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_89|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_89|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_616))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_89|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_89|)) (let ((.cse8 (let ((.cse9 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))) is different from false [2024-11-09 05:32:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [696410925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:32:58,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792923230] [2024-11-09 05:32:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:58,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:32:58,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:32:58,236 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:32:58,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 05:33:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:00,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 05:33:00,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:33:08,717 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 19 treesize of output 8 [2024-11-09 05:33:30,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2024-11-09 05:33:33,298 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 105 treesize of output 76 [2024-11-09 05:33:45,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 76 [2024-11-09 05:33:54,884 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 105 treesize of output 76 [2024-11-09 05:33:59,948 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 105 treesize of output 76 [2024-11-09 05:34:03,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 96 [2024-11-09 05:34:03,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2024-11-09 05:34:07,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 81 [2024-11-09 05:34:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 05:34:07,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:34:07,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_647))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse4 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (select .cse4 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 05:34:07,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_94| (_ BitVec 64)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32)))) (or (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_94|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_94|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_647))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse8 .cse6) (select .cse8 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_94|))))))) is different from false [2024-11-09 05:34:08,252 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_94| (_ BitVec 64)) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (.cse7 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_645))) (or (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_94|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_94|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_647))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_94|)) (let ((.cse8 (let ((.cse9 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))) is different from false [2024-11-09 05:34:08,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_94| (_ BitVec 64)) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (.cse7 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_644) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_645))) (or (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_94|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_94|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_647))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_94|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_94|)) (let ((.cse8 (let ((.cse9 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))) is different from false [2024-11-09 05:34:08,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792923230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:08,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:34:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 26 [2024-11-09 05:34:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231139098] [2024-11-09 05:34:08,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:34:08,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 05:34:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:34:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 05:34:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=815, Unknown=30, NotChecked=828, Total=1806 [2024-11-09 05:34:08,852 INFO L87 Difference]: Start difference. First operand 188 states and 248 transitions. Second operand has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 26 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-09 05:34:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:41,060 INFO L93 Difference]: Finished difference Result 438 states and 565 transitions. [2024-11-09 05:34:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 05:34:41,061 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 26 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) Word has length 100 [2024-11-09 05:34:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:41,062 INFO L225 Difference]: With dead ends: 438 [2024-11-09 05:34:41,063 INFO L226 Difference]: Without dead ends: 436 [2024-11-09 05:34:41,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 337 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=323, Invalid=1587, Unknown=30, NotChecked=1140, Total=3080 [2024-11-09 05:34:41,064 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 667 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:41,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 667 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 22.5s Time] [2024-11-09 05:34:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-09 05:34:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 339. [2024-11-09 05:34:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 298 states have (on average 1.2483221476510067) internal successors, (372), 298 states have internal predecessors, (372), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 05:34:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 444 transitions. [2024-11-09 05:34:41,110 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 444 transitions. Word has length 100 [2024-11-09 05:34:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:41,110 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 444 transitions. [2024-11-09 05:34:41,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 26 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-09 05:34:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 444 transitions. [2024-11-09 05:34:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 05:34:41,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:41,112 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:41,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-09 05:34:41,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:34:41,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-09 05:34:41,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:34:41,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:41,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash 50663710, now seen corresponding path program 1 times [2024-11-09 05:34:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:34:41,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006062121] [2024-11-09 05:34:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:41,715 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 05:34:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:34:41,716 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:34:41,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:34:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:41,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:34:41,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 05:34:42,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:34:42,120 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:34:42,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006062121] [2024-11-09 05:34:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006062121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:34:42,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:34:42,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:34:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232713675] [2024-11-09 05:34:42,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:34:42,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:34:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:34:42,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:34:42,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:34:42,123 INFO L87 Difference]: Start difference. First operand 339 states and 444 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 05:34:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:42,374 INFO L93 Difference]: Finished difference Result 611 states and 801 transitions. [2024-11-09 05:34:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:34:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-09 05:34:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:42,376 INFO L225 Difference]: With dead ends: 611 [2024-11-09 05:34:42,376 INFO L226 Difference]: Without dead ends: 339 [2024-11-09 05:34:42,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:34:42,378 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:42,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:34:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-09 05:34:42,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2024-11-09 05:34:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 298 states have (on average 1.2416107382550337) internal successors, (370), 298 states have internal predecessors, (370), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 05:34:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2024-11-09 05:34:42,433 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 100 [2024-11-09 05:34:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:42,433 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2024-11-09 05:34:42,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 05:34:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2024-11-09 05:34:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 05:34:42,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:42,435 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:42,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Ended with exit code 0 [2024-11-09 05:34:42,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:34:42,639 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash 458835129, now seen corresponding path program 1 times [2024-11-09 05:34:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:34:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68002803] [2024-11-09 05:34:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:42,640 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 05:34:42,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:34:42,646 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:34:42,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Waiting until timeout for monitored process [2024-11-09 05:34:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:43,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 05:34:43,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:46,097 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 26 treesize of output 24 [2024-11-09 05:34:51,697 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 26 treesize of output 24 [2024-11-09 05:34:57,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 26 treesize of output 24 [2024-11-09 05:35:01,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 05:35:06,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-09 05:35:12,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2024-11-09 05:35:20,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2024-11-09 05:35:23,842 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 71 treesize of output 57 [2024-11-09 05:35:25,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 73 [2024-11-09 05:35:27,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 74 [2024-11-09 05:35:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 203 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 05:35:28,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:32,363 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem15#1|) |c_ULTIMATE.start_step_#t~mem16#1|) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_698))) (store .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))))))) (bvslt (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))))))) is different from false [2024-11-09 05:35:32,544 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd (select (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_698))) (store .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))))))) (bvslt (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))))))) is different from false [2024-11-09 05:35:32,828 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset (bvadd (bvneg (select (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))))))) (or (forall ((|ULTIMATE.start_step_#t~mem17#1| (_ BitVec 8))) (not (bvslt (bvadd (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)))) ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem17#1|)))) (forall ((v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (let ((.cse2 (store .cse0 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base v_ArrVal_698))) (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base (store (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.offset (bvadd (bvmul (_ bv2 32) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset))))) (select (select .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset))))))) (bvslt (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset) (bvmul c_~last_1_signed_long_int_Array_0_1__0_~0 (select (select .cse1 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset)))))))) is different from false [2024-11-09 05:35:37,557 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:35:37,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68002803] [2024-11-09 05:35:37,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68002803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:37,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354653544] [2024-11-09 05:35:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:37,558 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:35:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:35:37,559 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:35:37,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-09 05:35:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:38,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 05:35:38,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:42,101 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 24 treesize of output 22 [2024-11-09 05:35:47,536 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 24 treesize of output 22 [2024-11-09 05:35:53,082 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 24 treesize of output 22 [2024-11-09 05:35:57,480 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 31 treesize of output 22 [2024-11-09 05:36:02,165 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 31 treesize of output 22 [2024-11-09 05:36:10,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-09 05:36:18,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-11-09 05:36:22,835 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 84 treesize of output 66 [2024-11-09 05:36:24,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 85 [2024-11-09 05:36:27,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 52 [2024-11-09 05:36:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 195 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 05:36:28,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:36:42,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1354653544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:42,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175242276] [2024-11-09 05:36:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:42,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:42,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:36:42,712 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:36:42,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-09 05:36:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:43,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 05:36:43,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:02,562 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2024-11-09 05:37:02,562 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 39 treesize of output 48 [2024-11-09 05:37:04,995 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:37:04,995 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 67 treesize of output 59 [2024-11-09 05:37:05,143 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 18 treesize of output 16 [2024-11-09 05:37:07,045 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-09 05:37:07,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 93 [2024-11-09 05:37:14,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 125 [2024-11-09 05:37:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 05:37:15,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:37:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175242276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:37:15,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:37:15,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20, 19] total 46 [2024-11-09 05:37:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133177163] [2024-11-09 05:37:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:37:15,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:37:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:37:15,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:37:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2912, Unknown=16, NotChecked=342, Total=3660 [2024-11-09 05:37:15,199 INFO L87 Difference]: Start difference. First operand 339 states and 442 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:37:27,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:37:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:35,351 INFO L93 Difference]: Finished difference Result 850 states and 1091 transitions. [2024-11-09 05:37:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:37:35,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-11-09 05:37:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:35,355 INFO L225 Difference]: With dead ends: 850 [2024-11-09 05:37:35,355 INFO L226 Difference]: Without dead ends: 625 [2024-11-09 05:37:35,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1659 ImplicationChecksByTransitivity, 58.9s TimeCoverageRelationStatistics Valid=506, Invalid=3650, Unknown=16, NotChecked=384, Total=4556 [2024-11-09 05:37:35,357 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 209 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 13 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:35,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 653 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 754 Invalid, 14 Unknown, 0 Unchecked, 14.3s Time] [2024-11-09 05:37:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-09 05:37:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 353. [2024-11-09 05:37:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 312 states have (on average 1.2628205128205128) internal successors, (394), 312 states have internal predecessors, (394), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 05:37:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 466 transitions. [2024-11-09 05:37:35,418 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 466 transitions. Word has length 101 [2024-11-09 05:37:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:35,419 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 466 transitions. [2024-11-09 05:37:35,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 05:37:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 466 transitions. [2024-11-09 05:37:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 05:37:35,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:35,420 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:37:35,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-09 05:37:35,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:37:35,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2024-11-09 05:37:36,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:37:36,022 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:37:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1357718402, now seen corresponding path program 1 times [2024-11-09 05:37:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:37:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284375045] [2024-11-09 05:37:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:36,023 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 05:37:36,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:37:36,024 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:37:36,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/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 05:37:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:36,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 05:37:36,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:43,707 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 05:37:49,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 68 [2024-11-09 05:37:52,182 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 95 treesize of output 68 [2024-11-09 05:37:55,293 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 95 treesize of output 68 [2024-11-09 05:37:58,360 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 95 treesize of output 68 [2024-11-09 05:37:59,112 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 95 treesize of output 68 [2024-11-09 05:37:59,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 90 [2024-11-09 05:38:00,549 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 156 treesize of output 113 [2024-11-09 05:38:03,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 132 [2024-11-09 05:38:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 182 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 05:38:04,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:38:06,264 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_781))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse4 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (select .cse4 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 05:38:06,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_781 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32)))) (or (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_781))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse8 .cse6) (select .cse8 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|))))))) is different from false [2024-11-09 05:38:06,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (.cse3 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_779))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_781))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 05:38:06,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_110| (_ BitVec 64)) (v_ArrVal_781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset (_ bv4 32))) (.cse3 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base v_ArrVal_778) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base v_ArrVal_779))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_110|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_110|)))) (let ((.cse6 (bvadd c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base (store (store (select .cse3 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base) c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_110|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_110|))) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer~0.base v_ArrVal_781))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 05:38:07,361 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:38:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284375045] [2024-11-09 05:38:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284375045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:38:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [834751623] [2024-11-09 05:38:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:07,362 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:38:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:38:07,365 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:38:07,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f816e8b-0ac2-40be-a81a-da8b16e349cd/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-09 05:38:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:08,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 05:38:08,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:38:15,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 05:38:57,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-09 05:39:01,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-09 05:39:09,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-09 05:39:19,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80