./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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_5c7bd2e1-329c-4953-bd88-026ea38080d4/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 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:26:55,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:26:55,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:26:55,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:26:55,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:26:55,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:26:55,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:26:55,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:26:55,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:26:55,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:26:55,848 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:26:55,848 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:26:55,849 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:26:55,849 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:26:55,850 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:26:55,850 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:26:55,851 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:26:55,851 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:26:55,852 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:26:55,852 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:26:55,853 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:26:55,854 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:26:55,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:26:55,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:26:55,856 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:26:55,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:26:55,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:26:55,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:26:55,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:26:55,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:26:55,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:26:55,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:26:55,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:26:55,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:26:55,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:26:55,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:26:55,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:26:55,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:26:55,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:26:55,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:26:55,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:26:55,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:26:55,865 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:26:55,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:26:55,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:26:55,866 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:26:55,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:26:55,866 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_5c7bd2e1-329c-4953-bd88-026ea38080d4/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_5c7bd2e1-329c-4953-bd88-026ea38080d4/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 -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2024-11-09 05:26:56,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:26:56,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:26:56,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:26:56,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:26:56,283 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:26:56,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i Unable to find full path for "g++" [2024-11-09 05:26:58,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:26:59,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:26:59,167 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2024-11-09 05:26:59,179 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/data/23ad25847/671f4cfb850349019421771b40550917/FLAG79347d741 [2024-11-09 05:26:59,199 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/data/23ad25847/671f4cfb850349019421771b40550917 [2024-11-09 05:26:59,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:26:59,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:26:59,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:26:59,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:26:59,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:26:59,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:26:59,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e1edb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59, skipping insertion in model container [2024-11-09 05:26:59,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:26:59,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:26:59,589 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_5c7bd2e1-329c-4953-bd88-026ea38080d4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2024-11-09 05:26:59,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:26:59,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:26:59,734 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_5c7bd2e1-329c-4953-bd88-026ea38080d4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2024-11-09 05:26:59,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:26:59,834 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:26:59,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59 WrapperNode [2024-11-09 05:26:59,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:26:59,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:26:59,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:26:59,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:26:59,855 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:26:59" (1/1) ... [2024-11-09 05:26:59,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:26:59" (1/1) ... [2024-11-09 05:26:59,943 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 574 [2024-11-09 05:26:59,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:26:59,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:26:59,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:26:59,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:26:59,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:26:59,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:26:59,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:26:59,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:27:00,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:27:00,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:27:00,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:27:00,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:27:00,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:27:00,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:27:00,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:27:00,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:27:00,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (1/1) ... [2024-11-09 05:27:00,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:27:00,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:27:00,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:00,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:27:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 05:27:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:27:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 05:27:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:27:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 05:27:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 05:27:00,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 05:27:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:27:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:27:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:27:00,393 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:27:00,396 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:27:01,342 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-09 05:27:01,342 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:27:02,131 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:27:02,132 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:27:02,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:27:02 BoogieIcfgContainer [2024-11-09 05:27:02,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:27:02,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:27:02,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:27:02,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:27:02,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:26:59" (1/3) ... [2024-11-09 05:27:02,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a85f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:27:02, skipping insertion in model container [2024-11-09 05:27:02,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:26:59" (2/3) ... [2024-11-09 05:27:02,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a85f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:27:02, skipping insertion in model container [2024-11-09 05:27:02,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:27:02" (3/3) ... [2024-11-09 05:27:02,148 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2024-11-09 05:27:02,167 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:27:02,167 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:27:02,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:27:02,265 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;@218f12bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:27:02,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:27:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 05:27:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 05:27:02,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:27:02,286 INFO L215 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:27:02,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:27:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -835966278, now seen corresponding path program 1 times [2024-11-09 05:27:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:27:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458528278] [2024-11-09 05:27:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:27:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:27:10,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:27:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:27:14,741 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:27:14,744 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:27:14,746 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 05:27:14,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:27:14,756 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 05:27:14,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:27:14,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:27:14 BoogieIcfgContainer [2024-11-09 05:27:14,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:27:14,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:27:14,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:27:14,885 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:27:14,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:27:02" (3/4) ... [2024-11-09 05:27:14,890 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 05:27:14,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:27:14,893 INFO L158 Benchmark]: Toolchain (without parser) took 15689.26ms. Allocated memory was 123.7MB in the beginning and 364.9MB in the end (delta: 241.2MB). Free memory was 61.3MB in the beginning and 232.2MB in the end (delta: -171.0MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2024-11-09 05:27:14,894 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 123.7MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:27:14,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.18ms. Allocated memory was 123.7MB in the beginning and 174.1MB in the end (delta: 50.3MB). Free memory was 61.1MB in the beginning and 129.6MB in the end (delta: -68.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-09 05:27:14,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.61ms. Allocated memory is still 174.1MB. Free memory was 129.6MB in the beginning and 124.3MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 05:27:14,897 INFO L158 Benchmark]: Boogie Preprocessor took 132.19ms. Allocated memory is still 174.1MB. Free memory was 124.3MB in the beginning and 120.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 05:27:14,898 INFO L158 Benchmark]: RCFGBuilder took 2055.12ms. Allocated memory is still 174.1MB. Free memory was 120.1MB in the beginning and 100.6MB in the end (delta: 19.5MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2024-11-09 05:27:14,899 INFO L158 Benchmark]: TraceAbstraction took 12746.93ms. Allocated memory was 174.1MB in the beginning and 364.9MB in the end (delta: 190.8MB). Free memory was 99.5MB in the beginning and 232.2MB in the end (delta: -132.7MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2024-11-09 05:27:14,899 INFO L158 Benchmark]: Witness Printer took 7.35ms. Allocated memory is still 364.9MB. Free memory is still 232.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:27:14,905 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 123.7MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.18ms. Allocated memory was 123.7MB in the beginning and 174.1MB in the end (delta: 50.3MB). Free memory was 61.1MB in the beginning and 129.6MB in the end (delta: -68.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.61ms. Allocated memory is still 174.1MB. Free memory was 129.6MB in the beginning and 124.3MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.19ms. Allocated memory is still 174.1MB. Free memory was 124.3MB in the beginning and 120.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2055.12ms. Allocated memory is still 174.1MB. Free memory was 120.1MB in the beginning and 100.6MB in the end (delta: 19.5MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12746.93ms. Allocated memory was 174.1MB in the beginning and 364.9MB in the end (delta: 190.8MB). Free memory was 99.5MB in the beginning and 232.2MB in the end (delta: -132.7MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. * Witness Printer took 7.35ms. Allocated memory is still 364.9MB. Free memory is still 232.2MB. 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 104, overapproximation of shiftRight at line 38, overapproximation of shiftLeft at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L25-L27] double double_Array_0[2] = { 10.5, 99.25 }; [L28-L30] signed char signed_char_Array_0[1] = { 0 }; [L31-L33] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L34] unsigned char last_1_unsigned_char_Array_0_0__1_ = 64; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR unsigned_char_Array_0[0][1] [L101] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] double_Array_0[1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L83] 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 ) [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L83] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L97] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L112] RET updateVariables() [L113] CALL step() [L38] EXPR signed_char_Array_0[0] [L38] EXPR last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0] [L38] COND TRUE (last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_ [L39] EXPR signed_char_Array_0[0] [L39] EXPR unsigned_char_Array_0[0][2] [L39] EXPR unsigned_char_Array_0[1][1] [L39] EXPR unsigned_char_Array_0[1][0] [L39] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L39] EXPR unsigned_char_Array_0[1][1] [L39] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L39] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L39] EXPR signed_char_Array_0[0] [L39] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L39] unsigned_char_Array_0[1][2] = ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))) [L43] EXPR unsigned_char_Array_0[0][0] [L43] EXPR unsigned_char_Array_0[1][2] [L43] EXPR unsigned_char_Array_0[1][0] [L43] COND FALSE !((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) [L46] EXPR BOOL_unsigned_char_Array_0[0] [L46] BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] [L46] EXPR BOOL_unsigned_char_Array_0[1] [L46] BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] [L46] COND TRUE BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1] [L47] EXPR unsigned_char_Array_0[1][2] [L47] EXPR unsigned_char_Array_0[0][0] [L47] EXPR signed_char_Array_0[0] [L47] EXPR unsigned_char_Array_0[0][0] << signed_char_Array_0[0] [L47] COND FALSE !(unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) [L54] EXPR BOOL_unsigned_char_Array_0[4] [L54] BOOL_unsigned_char_Array_0[2] = BOOL_unsigned_char_Array_0[4] [L59] EXPR unsigned_char_Array_0[0][1] [L59] unsigned char stepLocal_1 = unsigned_char_Array_0[0][1]; [L60] EXPR BOOL_unsigned_char_Array_0[2] [L60] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L61] BOOL_unsigned_char_Array_0[2] [L61] COND TRUE BOOL_unsigned_char_Array_0[2] [L62] stepLocal_0 || BOOL_unsigned_char_Array_0[2] [L62] COND TRUE stepLocal_0 || BOOL_unsigned_char_Array_0[2] [L63] EXPR unsigned_char_Array_0[1][1] [L63] COND TRUE stepLocal_1 > unsigned_char_Array_0[1][1] [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR signed_char_Array_0[0] [L104] EXPR last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0] [L104] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0])))))) [L104] EXPR unsigned_char_Array_0[1][2] [L104] EXPR signed_char_Array_0[0] [L104] EXPR unsigned_char_Array_0[0][2] [L104] EXPR unsigned_char_Array_0[1][1] [L104] EXPR unsigned_char_Array_0[1][0] [L104] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L104] EXPR unsigned_char_Array_0[1][1] [L104] EXPR ((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]) [L104] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L104] EXPR signed_char_Array_0[0] [L104] EXPR ((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))) [L104] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0])))))) [L104] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1) [L104] EXPR BOOL_unsigned_char_Array_0[2] [L104] EXPR BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1 [L104] EXPR BOOL_unsigned_char_Array_0[2] [L104] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2] [L104] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1 [L104] EXPR unsigned_char_Array_0[0][1] [L104] EXPR unsigned_char_Array_0[1][1] [L104] EXPR (unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1 [L104] EXPR double_Array_0[0] [L104] EXPR double_Array_0[1] [L104] EXPR (unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1 [L104] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1 [L104] EXPR BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1 [L104] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1) [L104] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1) [L104] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1)) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? ((unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) ? ((unsigned_char_Array_0[1][1] > unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) 1))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[4]))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3]))) [L104-L105] return (((((last_1_unsigned_char_Array_0_0__1_ >> signed_char_Array_0[0]) >= last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[1][2] == ((unsigned char) ((((signed_char_Array_0[0]) < ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0])))))) ? (signed_char_Array_0[0]) : ((unsigned_char_Array_0[0][2] - ((((unsigned_char_Array_0[1][1]) > (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[1][1]) : (unsigned_char_Array_0[1][0]))))))))) : (unsigned_char_Array_0[1][2] == ((unsigned char) (((((unsigned_char_Array_0[1][1]) < (signed_char_Array_0[0])) ? (unsigned_char_Array_0[1][1]) : (signed_char_Array_0[0]))) + (((((unsigned_char_Array_0[0][0] + 1)) < (unsigned_char_Array_0[1][0])) ? ((unsigned_char_Array_0[0][0] + 1)) : (unsigned_char_Array_0[1][0]))))))) && (BOOL_unsigned_char_Array_0[2] ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[0][1] > unsigned_char_Array_0[1][1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : 1) : 1) : 1)) && (((unsigned_char_Array_0[0][0] + unsigned_char_Array_0[1][2]) >= unsigned_char_Array_0[1][0]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[1][1])) : 1)) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? ((unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0])) ? ((unsigned_char_Array_0[1][1] > unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) 1))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[4]))) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[3]))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 1, TraceHistogramMax: 19, 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=47occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 8.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 05:27:14,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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_5c7bd2e1-329c-4953-bd88-026ea38080d4/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 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:27:18,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:27:18,292 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 05:27:18,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:27:18,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:27:18,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:27:18,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:27:18,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:27:18,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:27:18,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:27:18,359 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:27:18,360 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:27:18,360 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:27:18,361 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:27:18,362 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:27:18,363 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:27:18,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:27:18,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:27:18,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:27:18,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:27:18,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:27:18,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:27:18,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:27:18,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:27:18,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:27:18,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 05:27:18,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:27:18,371 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 05:27:18,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:27:18,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:27:18,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:27:18,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:27:18,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 05:27:18,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:27:18,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:27:18,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:27:18,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:27:18,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:27:18,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:27:18,375 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 05:27:18,375 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 05:27:18,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:27:18,376 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:27:18,376 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_5c7bd2e1-329c-4953-bd88-026ea38080d4/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_5c7bd2e1-329c-4953-bd88-026ea38080d4/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 -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2024-11-09 05:27:18,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:27:18,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:27:18,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:27:18,961 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:27:18,962 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:27:18,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i Unable to find full path for "g++" [2024-11-09 05:27:21,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:27:22,045 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:27:22,046 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2024-11-09 05:27:22,065 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/data/b0acb61e5/951bbeab2ed54e2288967530353b251a/FLAG7dbd5322c [2024-11-09 05:27:22,093 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/data/b0acb61e5/951bbeab2ed54e2288967530353b251a [2024-11-09 05:27:22,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:27:22,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:27:22,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:27:22,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:27:22,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:27:22,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:22,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560ff7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22, skipping insertion in model container [2024-11-09 05:27:22,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:22,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:27:22,500 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_5c7bd2e1-329c-4953-bd88-026ea38080d4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2024-11-09 05:27:22,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:27:22,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:27:22,722 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_5c7bd2e1-329c-4953-bd88-026ea38080d4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2024-11-09 05:27:22,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:27:22,834 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:27:22,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22 WrapperNode [2024-11-09 05:27:22,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:27:22,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:27:22,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:27:22,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:27:22,848 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:27:22" (1/1) ... [2024-11-09 05:27:22,877 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:27:22" (1/1) ... [2024-11-09 05:27:22,929 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2024-11-09 05:27:22,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:27:22,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:27:22,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:27:22,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:27:22,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:22,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:22,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:22,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:22,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:23,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:23,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:23,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:23,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:27:23,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:27:23,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:27:23,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:27:23,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (1/1) ... [2024-11-09 05:27:23,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:27:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:27:23,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:23,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:23,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:27:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 05:27:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 05:27:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 05:27:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 05:27:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-09 05:27:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 05:27:23,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 05:27:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:27:23,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:27:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 05:27:23,355 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:27:23,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:27:24,438 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-09 05:27:24,438 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:27:24,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:27:24,470 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:27:24,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:27:24 BoogieIcfgContainer [2024-11-09 05:27:24,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:27:24,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:27:24,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:27:24,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:27:24,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:27:22" (1/3) ... [2024-11-09 05:27:24,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6f906e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:27:24, skipping insertion in model container [2024-11-09 05:27:24,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:27:22" (2/3) ... [2024-11-09 05:27:24,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6f906e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:27:24, skipping insertion in model container [2024-11-09 05:27:24,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:27:24" (3/3) ... [2024-11-09 05:27:24,487 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2024-11-09 05:27:24,516 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:27:24,518 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:27:24,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:27:24,596 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;@6227a4c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:27:24,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:27:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 05:27:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 05:27:24,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:27:24,619 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:27:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:27:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash -970718534, now seen corresponding path program 1 times [2024-11-09 05:27:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:27:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028582694] [2024-11-09 05:27:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:24,645 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:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:27:24,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:24,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:25,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:27:25,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 05:27:25,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:27:25,236 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:27:25,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028582694] [2024-11-09 05:27:25,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028582694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:27:25,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:27:25,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:27:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611609257] [2024-11-09 05:27:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:27:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:27:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:27:25,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:27:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:27:25,296 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:27:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:27:25,410 INFO L93 Difference]: Finished difference Result 230 states and 365 transitions. [2024-11-09 05:27:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:27:25,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-09 05:27:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:27:25,432 INFO L225 Difference]: With dead ends: 230 [2024-11-09 05:27:25,433 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 05:27:25,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 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:27:25,447 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:27:25,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:27:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 05:27:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 05:27:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 05:27:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-11-09 05:27:25,512 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 149 [2024-11-09 05:27:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:27:25,515 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-11-09 05:27:25,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:27:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-11-09 05:27:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 05:27:25,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:27:25,520 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:25,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:25,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:27:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:27:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1635305020, now seen corresponding path program 1 times [2024-11-09 05:27:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:27:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015259710] [2024-11-09 05:27:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:25,725 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:25,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:27:25,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:25,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:26,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:27:26,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:26,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:27:28,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 27 treesize of output 20 [2024-11-09 05:27:29,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:29,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:30,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:31,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2024-11-09 05:27:31,270 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 54 treesize of output 37 [2024-11-09 05:27:31,412 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 43 treesize of output 39 [2024-11-09 05:27:31,760 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:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-09 05:27:32,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:27:32,391 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_63))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) is different from false [2024-11-09 05:27:32,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_61 (_ BitVec 32)) (v_ArrVal_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_61)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_63))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) is different from false [2024-11-09 05:27:32,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_61 (_ BitVec 32)) (v_ArrVal_63 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse1 ((_ sign_extend 24) ((_ extract 7 0) |c_ULTIMATE.start_step_#t~ite19#1|))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_61)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_63))) (= ((_ zero_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse1))))))) is different from false [2024-11-09 05:27:33,246 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:27:33,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015259710] [2024-11-09 05:27:33,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015259710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:27:33,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1446396640] [2024-11-09 05:27:33,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:33,247 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:27:33,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:27:33,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:27:33,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 05:27:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:34,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 05:27:34,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:34,425 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:27:37,221 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-09 05:27:37,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2024-11-09 05:27:37,549 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-09 05:27:37,550 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 44 treesize of output 39 [2024-11-09 05:27:38,069 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:27:38,070 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 66 treesize of output 64 [2024-11-09 05:27:38,168 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 25 treesize of output 21 [2024-11-09 05:27:39,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:39,117 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 50 treesize of output 42 [2024-11-09 05:27:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 05:27:39,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:27:39,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1446396640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:27:39,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:27:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 30 [2024-11-09 05:27:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867675174] [2024-11-09 05:27:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:27:39,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 05:27:39,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:27:39,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 05:27:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1235, Unknown=22, NotChecked=222, Total=1640 [2024-11-09 05:27:39,247 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:27:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:27:43,572 INFO L93 Difference]: Finished difference Result 436 states and 641 transitions. [2024-11-09 05:27:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:27:43,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-09 05:27:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:27:43,578 INFO L225 Difference]: With dead ends: 436 [2024-11-09 05:27:43,579 INFO L226 Difference]: Without dead ends: 324 [2024-11-09 05:27:43,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=229, Invalid=1831, Unknown=22, NotChecked=270, Total=2352 [2024-11-09 05:27:43,583 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 358 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:27:43,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1068 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 05:27:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-09 05:27:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 193. [2024-11-09 05:27:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 151 states have internal predecessors, (206), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 05:27:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 282 transitions. [2024-11-09 05:27:43,644 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 282 transitions. Word has length 149 [2024-11-09 05:27:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:27:43,646 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 282 transitions. [2024-11-09 05:27:43,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:27:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2024-11-09 05:27:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 05:27:43,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:27:43,650 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 05:27:43,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:27:44,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:44,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:27:44,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:27:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash -581412079, now seen corresponding path program 1 times [2024-11-09 05:27:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:27:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017104943] [2024-11-09 05:27:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:44,056 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:44,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:27:44,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:44,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 05:27:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:44,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 05:27:44,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:44,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:27:45,559 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:45,775 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:45,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 8 treesize of output 1 [2024-11-09 05:27:46,184 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:46,381 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:46,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 05:27:46,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 05:27:46,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 05:27:47,014 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 23 treesize of output 15 [2024-11-09 05:27:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 05:27:47,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:27:47,076 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:27:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017104943] [2024-11-09 05:27:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017104943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:27:47,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:27:47,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:27:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269594436] [2024-11-09 05:27:47,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:27:47,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:27:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:27:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:27:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:27:47,080 INFO L87 Difference]: Start difference. First operand 193 states and 282 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:27:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:27:52,717 INFO L93 Difference]: Finished difference Result 413 states and 610 transitions. [2024-11-09 05:27:52,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:27:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-09 05:27:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:27:52,722 INFO L225 Difference]: With dead ends: 413 [2024-11-09 05:27:52,722 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 05:27:52,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:27:52,725 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 290 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:27:52,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 515 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-09 05:27:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 05:27:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 212. [2024-11-09 05:27:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 05:27:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 312 transitions. [2024-11-09 05:27:52,769 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 312 transitions. Word has length 150 [2024-11-09 05:27:52,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:27:52,769 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 312 transitions. [2024-11-09 05:27:52,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:27:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 312 transitions. [2024-11-09 05:27:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 05:27:52,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:27:52,777 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 05:27:52,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:27:52,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:27:52,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:27:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1561668227, now seen corresponding path program 1 times [2024-11-09 05:27:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:27:52,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580175793] [2024-11-09 05:27:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:52,984 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:52,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:27:52,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:52,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 05:27:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:53,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 05:27:53,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:53,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:27:54,302 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:54,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:55,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-09 05:27:55,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:55,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:56,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 05:27:56,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 05:27:56,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17 [2024-11-09 05:27:56,386 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 22 treesize of output 14 [2024-11-09 05:27:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-09 05:27:56,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:27:56,990 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:27:56,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580175793] [2024-11-09 05:27:56,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580175793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:27:56,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1697215650] [2024-11-09 05:27:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:27:56,991 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:27:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:27:56,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:27:56,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-09 05:27:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:27:57,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 05:27:57,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:27:57,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:27:58,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 05:27:58,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:58,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:59,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:59,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:27:59,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-09 05:28:00,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-09 05:28:00,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-09 05:28:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-09 05:28:00,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:28:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1697215650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:28:00,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:28:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 22 [2024-11-09 05:28:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603970107] [2024-11-09 05:28:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:28:00,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:28:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:28:00,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:28:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=662, Unknown=17, NotChecked=0, Total=812 [2024-11-09 05:28:00,373 INFO L87 Difference]: Start difference. First operand 212 states and 312 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 05:28:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:28:02,935 INFO L93 Difference]: Finished difference Result 453 states and 664 transitions. [2024-11-09 05:28:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:28:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2024-11-09 05:28:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:28:02,939 INFO L225 Difference]: With dead ends: 453 [2024-11-09 05:28:02,940 INFO L226 Difference]: Without dead ends: 341 [2024-11-09 05:28:02,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=742, Unknown=17, NotChecked=0, Total=930 [2024-11-09 05:28:02,942 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 267 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:28:02,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 577 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 05:28:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-09 05:28:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 234. [2024-11-09 05:28:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 191 states have internal predecessors, (266), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 05:28:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 342 transitions. [2024-11-09 05:28:02,991 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 342 transitions. Word has length 150 [2024-11-09 05:28:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:28:02,992 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 342 transitions. [2024-11-09 05:28:02,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 05:28:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2024-11-09 05:28:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:28:02,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:28:02,996 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-09 05:28:03,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:28:03,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:03,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:28:03,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:28:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1560421560, now seen corresponding path program 1 times [2024-11-09 05:28:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:28:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498369889] [2024-11-09 05:28:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:03,399 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:03,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:28:03,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:03,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:28:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:03,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 05:28:03,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:28:04,273 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:04,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-09 05:28:04,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:04,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-11-09 05:28:05,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:05,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2024-11-09 05:28:05,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:05,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 61 [2024-11-09 05:28:06,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:06,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 64 [2024-11-09 05:28:06,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2024-11-09 05:28:06,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:06,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 38 [2024-11-09 05:28:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 372 proven. 27 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-09 05:28:06,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:28:06,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_236) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|))) (_ bv1 32)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) is different from false [2024-11-09 05:28:19,739 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:28:19,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498369889] [2024-11-09 05:28:19,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498369889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:28:19,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [978753503] [2024-11-09 05:28:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:28:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:28:19,741 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:28:19,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 05:28:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:20,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 05:28:20,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:28:21,551 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:22,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21 [2024-11-09 05:28:23,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-09 05:28:23,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-09 05:28:24,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2024-11-09 05:28:25,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2024-11-09 05:28:25,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2024-11-09 05:28:26,113 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 79 treesize of output 43 [2024-11-09 05:28:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-09 05:28:26,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:28:26,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_273) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) is different from false [2024-11-09 05:28:34,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_235 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_235)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_236) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|))) (_ bv1 32)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) is different from false [2024-11-09 05:28:34,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [978753503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:28:34,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741244617] [2024-11-09 05:28:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:28:34,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:28:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:28:34,617 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:28:34,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:28:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:28:34,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 05:28:34,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:28:35,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 05:28:36,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:36,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-11-09 05:28:37,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:37,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-09 05:28:38,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:38,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 62 [2024-11-09 05:28:38,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:38,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 65 [2024-11-09 05:28:38,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56 [2024-11-09 05:28:39,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:28:39,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 39 [2024-11-09 05:28:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-09 05:28:39,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:28:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741244617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:28:46,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:28:46,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 41 [2024-11-09 05:28:46,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714461853] [2024-11-09 05:28:46,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:28:46,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 05:28:46,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:28:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 05:28:46,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1868, Unknown=49, NotChecked=282, Total=2550 [2024-11-09 05:28:46,092 INFO L87 Difference]: Start difference. First operand 234 states and 342 transitions. Second operand has 42 states, 37 states have (on average 4.486486486486487) internal successors, (166), 38 states have internal predecessors, (166), 14 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (44), 12 states have call predecessors, (44), 14 states have call successors, (44) [2024-11-09 05:29:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:03,734 INFO L93 Difference]: Finished difference Result 536 states and 761 transitions. [2024-11-09 05:29:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 05:29:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 4.486486486486487) internal successors, (166), 38 states have internal predecessors, (166), 14 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (44), 12 states have call predecessors, (44), 14 states have call successors, (44) Word has length 151 [2024-11-09 05:29:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:03,740 INFO L225 Difference]: With dead ends: 536 [2024-11-09 05:29:03,740 INFO L226 Difference]: Without dead ends: 424 [2024-11-09 05:29:03,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 486 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=795, Invalid=3441, Unknown=66, NotChecked=390, Total=4692 [2024-11-09 05:29:03,744 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1184 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:29:03,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1312 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 3262 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2024-11-09 05:29:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-09 05:29:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 400. [2024-11-09 05:29:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 334 states have (on average 1.3892215568862276) internal successors, (464), 336 states have internal predecessors, (464), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:29:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 572 transitions. [2024-11-09 05:29:03,813 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 572 transitions. Word has length 151 [2024-11-09 05:29:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:03,814 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 572 transitions. [2024-11-09 05:29:03,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 4.486486486486487) internal successors, (166), 38 states have internal predecessors, (166), 14 states have call successors, (44), 9 states have call predecessors, (44), 14 states have return successors, (44), 12 states have call predecessors, (44), 14 states have call successors, (44) [2024-11-09 05:29:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 572 transitions. [2024-11-09 05:29:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:29:03,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:03,818 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 05:29:04,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-09 05:29:04,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:29:04,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:04,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:29:04,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1818586998, now seen corresponding path program 1 times [2024-11-09 05:29:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:29:04,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121191530] [2024-11-09 05:29:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:04,421 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:04,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:29:04,424 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:04,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:29:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:04,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 05:29:04,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:05,523 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:29:05,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:29:05,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:29:05,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 05:29:06,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:06,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2024-11-09 05:29:06,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:06,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2024-11-09 05:29:06,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2024-11-09 05:29:06,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:06,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 33 [2024-11-09 05:29:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-09 05:29:07,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:29:07,177 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:29:07,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121191530] [2024-11-09 05:29:07,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121191530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:29:07,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:29:07,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 05:29:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141478542] [2024-11-09 05:29:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:29:07,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:29:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:29:07,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:29:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:29:07,180 INFO L87 Difference]: Start difference. First operand 400 states and 572 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 05:29:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:12,841 INFO L93 Difference]: Finished difference Result 755 states and 1083 transitions. [2024-11-09 05:29:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:29:12,843 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-09 05:29:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:12,848 INFO L225 Difference]: With dead ends: 755 [2024-11-09 05:29:12,848 INFO L226 Difference]: Without dead ends: 505 [2024-11-09 05:29:12,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-09 05:29:12,851 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 385 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:29:12,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 728 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-09 05:29:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-09 05:29:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 442. [2024-11-09 05:29:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 376 states have (on average 1.4042553191489362) internal successors, (528), 378 states have internal predecessors, (528), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:29:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2024-11-09 05:29:12,933 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 151 [2024-11-09 05:29:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:12,934 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2024-11-09 05:29:12,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 05:29:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2024-11-09 05:29:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:29:12,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:12,937 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:29:13,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:13,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:29:13,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1465263048, now seen corresponding path program 1 times [2024-11-09 05:29:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:29:13,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700404168] [2024-11-09 05:29:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:13,140 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:13,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:29:13,141 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:13,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 05:29:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:13,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 05:29:13,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:13,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:29:15,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:29:16,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:29:16,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-09 05:29:17,343 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 44 treesize of output 42 [2024-11-09 05:29:18,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:18,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2024-11-09 05:29:19,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:19,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 58 [2024-11-09 05:29:19,397 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 58 treesize of output 50 [2024-11-09 05:29:19,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:19,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 32 [2024-11-09 05:29:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 434 proven. 48 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-09 05:29:20,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:29:20,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_382))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-09 05:29:20,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (_ BitVec 32)) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_380)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_382))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-09 05:29:20,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32)) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_380)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_382))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-09 05:29:20,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|)) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))) (or (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 ((_ sign_extend 24) |c_ULTIMATE.start_step_#t~mem4#1|)) .cse0)) (forall ((v_ArrVal_380 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32)) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_380)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_382))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#unsigned_char_Array_0~0.base|) .cse2))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) (not (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse2))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:29:21,225 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:29:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700404168] [2024-11-09 05:29:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700404168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:29:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1721394243] [2024-11-09 05:29:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:21,226 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:29:21,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:29:21,229 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:29:21,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-09 05:29:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:22,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 05:29:22,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:22,247 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:29:23,532 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:29:24,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 18 treesize of output 13 [2024-11-09 05:29:24,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:29:25,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-09 05:29:26,751 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 39 treesize of output 37 [2024-11-09 05:29:28,840 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 56 treesize of output 53 [2024-11-09 05:29:29,226 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 67 treesize of output 56 [2024-11-09 05:29:29,602 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 60 treesize of output 50 [2024-11-09 05:29:30,032 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 68 treesize of output 36 [2024-11-09 05:29:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 438 proven. 27 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-09 05:29:30,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:29:30,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_419))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-09 05:29:30,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (_ BitVec 32)) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_417)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_419))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-09 05:29:30,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_417)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_419))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-09 05:29:30,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))) (.cse1 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (or (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 ((_ sign_extend 24) |c_ULTIMATE.start_step_#t~mem4#1|)) .cse0)) (not (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (forall ((v_ArrVal_417 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (let ((.cse3 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_417)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_419))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#unsigned_char_Array_0~0.base|) .cse2))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) is different from false [2024-11-09 05:29:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1721394243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:29:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269438358] [2024-11-09 05:29:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:31,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:29:31,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:29:31,011 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:29:31,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 05:29:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:31,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 05:29:31,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:31,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:29:32,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 05:29:34,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:29:35,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:29:35,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:29:36,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:29:37,646 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 52 treesize of output 46 [2024-11-09 05:29:38,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:38,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 45 [2024-11-09 05:29:38,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-09 05:29:38,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:29:38,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 42 [2024-11-09 05:29:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 380 proven. 48 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 05:29:39,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:29:48,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269438358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:29:48,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:29:48,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 53 [2024-11-09 05:29:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775247565] [2024-11-09 05:29:48,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:29:48,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-09 05:29:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:29:48,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-09 05:29:48,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=3805, Unknown=41, NotChecked=1080, Total=5402 [2024-11-09 05:29:48,292 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand has 54 states, 47 states have (on average 3.595744680851064) internal successors, (169), 48 states have internal predecessors, (169), 15 states have call successors, (48), 11 states have call predecessors, (48), 15 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) [2024-11-09 05:30:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:13,013 INFO L93 Difference]: Finished difference Result 962 states and 1377 transitions. [2024-11-09 05:30:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 05:30:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 47 states have (on average 3.595744680851064) internal successors, (169), 48 states have internal predecessors, (169), 15 states have call successors, (48), 11 states have call predecessors, (48), 15 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) Word has length 151 [2024-11-09 05:30:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:13,019 INFO L225 Difference]: With dead ends: 962 [2024-11-09 05:30:13,019 INFO L226 Difference]: Without dead ends: 688 [2024-11-09 05:30:13,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 467 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3055 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=1302, Invalid=8391, Unknown=41, NotChecked=1608, Total=11342 [2024-11-09 05:30:13,025 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 834 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 4421 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 4645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 4421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:13,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 2024 Invalid, 4645 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [224 Valid, 4421 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2024-11-09 05:30:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-09 05:30:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 470. [2024-11-09 05:30:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 402 states have (on average 1.4029850746268657) internal successors, (564), 404 states have internal predecessors, (564), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:30:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 672 transitions. [2024-11-09 05:30:13,105 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 672 transitions. Word has length 151 [2024-11-09 05:30:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 672 transitions. [2024-11-09 05:30:13,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 47 states have (on average 3.595744680851064) internal successors, (169), 48 states have internal predecessors, (169), 15 states have call successors, (48), 11 states have call predecessors, (48), 15 states have return successors, (48), 12 states have call predecessors, (48), 15 states have call successors, (48) [2024-11-09 05:30:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 672 transitions. [2024-11-09 05:30:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:30:13,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:13,109 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:13,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 05:30:13,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:13,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:13,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:30:13,711 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:30:13,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1419872950, now seen corresponding path program 1 times [2024-11-09 05:30:13,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:13,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058935017] [2024-11-09 05:30:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:13,712 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:30:13,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:13,714 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:30:13,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 05:30:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:14,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 05:30:14,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:14,945 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:30:15,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:30:15,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 05:30:15,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:15,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2024-11-09 05:30:15,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:15,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 52 [2024-11-09 05:30:15,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2024-11-09 05:30:16,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:16,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 30 [2024-11-09 05:30:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-09 05:30:16,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:16,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:16,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058935017] [2024-11-09 05:30:16,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058935017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:16,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:16,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 05:30:16,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078444671] [2024-11-09 05:30:16,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:16,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:30:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:16,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:30:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:30:16,271 INFO L87 Difference]: Start difference. First operand 470 states and 672 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 05:30:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:22,429 INFO L93 Difference]: Finished difference Result 879 states and 1261 transitions. [2024-11-09 05:30:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:30:22,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-09 05:30:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:22,434 INFO L225 Difference]: With dead ends: 879 [2024-11-09 05:30:22,434 INFO L226 Difference]: Without dead ends: 605 [2024-11-09 05:30:22,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-09 05:30:22,436 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 305 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:22,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 805 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-09 05:30:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-09 05:30:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 489. [2024-11-09 05:30:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 421 states have (on average 1.4133016627078385) internal successors, (595), 423 states have internal predecessors, (595), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:30:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 703 transitions. [2024-11-09 05:30:22,525 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 703 transitions. Word has length 151 [2024-11-09 05:30:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:22,525 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 703 transitions. [2024-11-09 05:30:22,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 05:30:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 703 transitions. [2024-11-09 05:30:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:30:22,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:22,529 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:22,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 05:30:22,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:30:22,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:30:22,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1678038388, now seen corresponding path program 1 times [2024-11-09 05:30:22,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:22,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679954103] [2024-11-09 05:30:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:22,732 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:30:22,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:22,736 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:30:22,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:30:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:23,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 05:30:23,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:23,853 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:30:24,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 05:30:24,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:24,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-11-09 05:30:25,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:25,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-09 05:30:25,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:25,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 58 [2024-11-09 05:30:26,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:26,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 61 [2024-11-09 05:30:26,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2024-11-09 05:30:26,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:26,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 35 [2024-11-09 05:30:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-09 05:30:26,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:26,767 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_527) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) is different from false [2024-11-09 05:30:27,259 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679954103] [2024-11-09 05:30:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679954103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:30:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455080477] [2024-11-09 05:30:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:30:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:30:27,261 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:30:27,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-09 05:30:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:28,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 05:30:28,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:29,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 05:30:29,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 05:30:30,943 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 41 treesize of output 28 [2024-11-09 05:30:31,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-09 05:30:32,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2024-11-09 05:30:33,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2024-11-09 05:30:33,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2024-11-09 05:30:34,280 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 67 treesize of output 39 [2024-11-09 05:30:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 427 proven. 27 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-11-09 05:30:34,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:34,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_563) |c_~#unsigned_char_Array_0~0.base|))) (bvslt (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) is different from false [2024-11-09 05:30:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1455080477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:30:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858720678] [2024-11-09 05:30:34,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:34,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:30:34,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:30:34,835 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:30:34,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 05:30:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:35,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 05:30:35,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:35,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-09 05:30:37,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:37,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2024-11-09 05:30:37,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:37,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2024-11-09 05:30:39,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:39,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 75 [2024-11-09 05:30:40,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:40,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 78 [2024-11-09 05:30:40,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 64 [2024-11-09 05:30:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 372 proven. 27 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-09 05:30:41,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858720678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:30:41,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:30:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 44 [2024-11-09 05:30:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123109972] [2024-11-09 05:30:41,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:30:41,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 05:30:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 05:30:41,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=2155, Unknown=16, NotChecked=198, Total=2756 [2024-11-09 05:30:41,702 INFO L87 Difference]: Start difference. First operand 489 states and 703 transitions. Second operand has 45 states, 40 states have (on average 4.325) internal successors, (173), 41 states have internal predecessors, (173), 16 states have call successors, (44), 11 states have call predecessors, (44), 16 states have return successors, (44), 14 states have call predecessors, (44), 16 states have call successors, (44) [2024-11-09 05:31:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:31:04,251 INFO L93 Difference]: Finished difference Result 945 states and 1351 transitions. [2024-11-09 05:31:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 05:31:04,253 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 4.325) internal successors, (173), 41 states have internal predecessors, (173), 16 states have call successors, (44), 11 states have call predecessors, (44), 16 states have return successors, (44), 14 states have call predecessors, (44), 16 states have call successors, (44) Word has length 151 [2024-11-09 05:31:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:31:04,261 INFO L225 Difference]: With dead ends: 945 [2024-11-09 05:31:04,261 INFO L226 Difference]: Without dead ends: 650 [2024-11-09 05:31:04,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 485 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=936, Invalid=4308, Unknown=20, NotChecked=286, Total=5550 [2024-11-09 05:31:04,266 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1057 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 3889 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 4229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 3889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:31:04,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1894 Invalid, 4229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [340 Valid, 3889 Invalid, 0 Unknown, 0 Unchecked, 18.7s Time] [2024-11-09 05:31:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-09 05:31:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 509. [2024-11-09 05:31:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 440 states have (on average 1.415909090909091) internal successors, (623), 442 states have internal predecessors, (623), 54 states have call successors, (54), 14 states have call predecessors, (54), 14 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:31:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 731 transitions. [2024-11-09 05:31:04,357 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 731 transitions. Word has length 151 [2024-11-09 05:31:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:31:04,358 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 731 transitions. [2024-11-09 05:31:04,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 4.325) internal successors, (173), 41 states have internal predecessors, (173), 16 states have call successors, (44), 11 states have call predecessors, (44), 16 states have return successors, (44), 14 states have call predecessors, (44), 16 states have call successors, (44) [2024-11-09 05:31:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 731 transitions. [2024-11-09 05:31:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:31:04,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:31:04,361 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:31:04,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-09 05:31:04,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-09 05:31:04,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:31:04,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:31:04,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:31:04,963 INFO L85 PathProgramCache]: Analyzing trace with hash 104641036, now seen corresponding path program 1 times [2024-11-09 05:31:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:31:04,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870254524] [2024-11-09 05:31:04,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:04,964 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:04,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:31:04,966 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:04,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:31:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:05,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 05:31:05,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:05,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:31:07,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:08,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:08,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-09 05:31:09,672 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 54 treesize of output 46 [2024-11-09 05:31:11,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:11,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 84 [2024-11-09 05:31:12,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:12,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 87 [2024-11-09 05:31:12,561 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 107 treesize of output 91 [2024-11-09 05:31:13,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:13,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 61 [2024-11-09 05:31:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 454 proven. 48 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-09 05:31:13,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:13,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_632))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:13,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_630 (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_630)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_632))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:13,725 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_630 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_630)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_632))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:14,402 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:31:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870254524] [2024-11-09 05:31:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870254524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:31:14,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320403684] [2024-11-09 05:31:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:14,403 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:31:14,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:31:14,404 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:31:14,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-09 05:31:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:15,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 05:31:15,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:16,611 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:31:17,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:17,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:18,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 05:31:19,178 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 33 [2024-11-09 05:31:20,756 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 58 treesize of output 55 [2024-11-09 05:31:21,139 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 69 treesize of output 58 [2024-11-09 05:31:21,317 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 62 treesize of output 52 [2024-11-09 05:31:21,787 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 70 treesize of output 38 [2024-11-09 05:31:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 418 proven. 27 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-09 05:31:22,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:22,902 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_670))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:22,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (_ BitVec 32)) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_668)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_670))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:22,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (_ BitVec 32)) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_668)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_670))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1320403684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:31:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854026653] [2024-11-09 05:31:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:31:29,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:31:29,573 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:31:29,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 05:31:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:29,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 05:31:29,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:30,823 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:31:32,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:32,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:33,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:31:34,338 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 44 treesize of output 42 [2024-11-09 05:31:36,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:36,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2024-11-09 05:31:36,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:36,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 69 [2024-11-09 05:31:36,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2024-11-09 05:31:37,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:37,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 43 [2024-11-09 05:31:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 434 proven. 48 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-09 05:31:38,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:38,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_707))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:38,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (_ BitVec 32)) (v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_706)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_707))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:38,656 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (_ BitVec 32)) (v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |ULTIMATE.start_step_#t~ite29#1| |ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_706)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_707))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))) is different from false [2024-11-09 05:31:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854026653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:31:41,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:31:41,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 20] total 57 [2024-11-09 05:31:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289563368] [2024-11-09 05:31:41,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:31:41,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-09 05:31:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:31:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-09 05:31:41,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=3702, Unknown=13, NotChecked=1224, Total=5550 [2024-11-09 05:31:41,470 INFO L87 Difference]: Start difference. First operand 509 states and 731 transitions. Second operand has 58 states, 50 states have (on average 3.92) internal successors, (196), 52 states have internal predecessors, (196), 18 states have call successors, (57), 12 states have call predecessors, (57), 18 states have return successors, (57), 15 states have call predecessors, (57), 18 states have call successors, (57) [2024-11-09 05:32:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:32:18,346 INFO L93 Difference]: Finished difference Result 1102 states and 1561 transitions. [2024-11-09 05:32:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-09 05:32:18,348 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 50 states have (on average 3.92) internal successors, (196), 52 states have internal predecessors, (196), 18 states have call successors, (57), 12 states have call predecessors, (57), 18 states have return successors, (57), 15 states have call predecessors, (57), 18 states have call successors, (57) Word has length 151 [2024-11-09 05:32:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:32:18,352 INFO L225 Difference]: With dead ends: 1102 [2024-11-09 05:32:18,353 INFO L226 Difference]: Without dead ends: 787 [2024-11-09 05:32:18,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 468 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 5457 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=2451, Invalid=14084, Unknown=13, NotChecked=2358, Total=18906 [2024-11-09 05:32:18,360 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2553 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 4742 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2553 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 5517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 4742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:32:18,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2553 Valid, 1894 Invalid, 5517 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [775 Valid, 4742 Invalid, 0 Unknown, 0 Unchecked, 25.3s Time] [2024-11-09 05:32:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-09 05:32:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 511. [2024-11-09 05:32:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 441 states have (on average 1.4104308390022675) internal successors, (622), 443 states have internal predecessors, (622), 54 states have call successors, (54), 15 states have call predecessors, (54), 15 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:32:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 730 transitions. [2024-11-09 05:32:18,488 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 730 transitions. Word has length 151 [2024-11-09 05:32:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:32:18,488 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 730 transitions. [2024-11-09 05:32:18,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 50 states have (on average 3.92) internal successors, (196), 52 states have internal predecessors, (196), 18 states have call successors, (57), 12 states have call predecessors, (57), 18 states have return successors, (57), 15 states have call predecessors, (57), 18 states have call successors, (57) [2024-11-09 05:32:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 730 transitions. [2024-11-09 05:32:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:32:18,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:32:18,491 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:18,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:32:18,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-09 05:32:18,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 05:32:19,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:32:19,096 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:32:19,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:32:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash -906476214, now seen corresponding path program 1 times [2024-11-09 05:32:19,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:32:19,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982514958] [2024-11-09 05:32:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:19,098 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:32:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:32:19,099 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:32:19,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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)] Waiting until timeout for monitored process [2024-11-09 05:32:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:19,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 05:32:19,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:32:20,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:32:20,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 05:32:21,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 05:32:21,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-09 05:32:21,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:32:21,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 59 [2024-11-09 05:32:22,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:32:22,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 62 [2024-11-09 05:32:22,305 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 55 treesize of output 47 [2024-11-09 05:32:22,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:32:22,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 37 [2024-11-09 05:32:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-09 05:32:23,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:32:23,200 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:32:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982514958] [2024-11-09 05:32:23,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982514958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:32:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:32:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 05:32:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141035243] [2024-11-09 05:32:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:32:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:32:23,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:32:23,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:32:23,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:32:23,203 INFO L87 Difference]: Start difference. First operand 511 states and 730 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 05:32:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:32:30,956 INFO L93 Difference]: Finished difference Result 893 states and 1276 transitions. [2024-11-09 05:32:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:32:30,957 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2024-11-09 05:32:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:32:30,961 INFO L225 Difference]: With dead ends: 893 [2024-11-09 05:32:30,962 INFO L226 Difference]: Without dead ends: 574 [2024-11-09 05:32:30,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:32:30,964 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 526 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:32:30,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 904 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-09 05:32:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-09 05:32:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 511. [2024-11-09 05:32:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 441 states have (on average 1.4104308390022675) internal successors, (622), 443 states have internal predecessors, (622), 54 states have call successors, (54), 15 states have call predecessors, (54), 15 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:32:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 730 transitions. [2024-11-09 05:32:31,102 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 730 transitions. Word has length 151 [2024-11-09 05:32:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:32:31,103 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 730 transitions. [2024-11-09 05:32:31,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 05:32:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 730 transitions. [2024-11-09 05:32:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:32:31,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:32:31,105 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:31,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:32:31,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:32:31,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:32:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:32:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash -507762166, now seen corresponding path program 1 times [2024-11-09 05:32:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:32:31,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674497419] [2024-11-09 05:32:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:31,307 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:32:31,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:32:31,309 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:32:31,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:32:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:31,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 05:32:31,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:32:33,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-09 05:32:33,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:32:34,561 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 49 treesize of output 32 [2024-11-09 05:32:35,013 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 49 treesize of output 32 [2024-11-09 05:32:35,990 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 61 treesize of output 49 [2024-11-09 05:32:36,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:32:36,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 52 [2024-11-09 05:32:36,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2024-11-09 05:32:37,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:32:37,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 41 [2024-11-09 05:32:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 438 proven. 54 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-09 05:32:37,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:32:38,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))))) is different from false [2024-11-09 05:32:38,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (_ BitVec 32)) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_778)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))))))) is different from false [2024-11-09 05:32:38,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (_ BitVec 32)) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |c_ULTIMATE.start_step_#t~ite29#1| |c_ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_778)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))))))) is different from false [2024-11-09 05:32:38,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (_ BitVec 32)) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse3))) |c_ULTIMATE.start_step_#t~ite24#1|))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_778)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse0 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse3))))))))))) is different from false [2024-11-09 05:32:38,246 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (_ BitVec 32)) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse1))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_778)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_780))) (let ((.cse0 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse3)))))))) is different from false [2024-11-09 05:32:38,339 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:32:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674497419] [2024-11-09 05:32:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674497419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:32:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [619485093] [2024-11-09 05:32:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:38,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:32:38,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:32:38,343 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:32:38,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-09 05:32:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:39,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 05:32:39,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:32:40,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 05:32:42,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:32:43,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 39 treesize of output 30 [2024-11-09 05:32:45,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-09 05:32:46,036 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 38 treesize of output 36 [2024-11-09 05:32:48,047 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 52 treesize of output 49 [2024-11-09 05:32:48,552 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 60 treesize of output 53 [2024-11-09 05:32:48,758 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 53 treesize of output 45 [2024-11-09 05:32:50,067 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 71 treesize of output 39 [2024-11-09 05:32:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 473 proven. 54 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-09 05:32:50,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:32:50,900 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))))))) is different from false [2024-11-09 05:32:50,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_815)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))))))) is different from false [2024-11-09 05:32:50,977 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |c_ULTIMATE.start_step_#t~ite29#1| |c_ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_815)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse2)))))))) is different from false [2024-11-09 05:32:51,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2))) |c_ULTIMATE.start_step_#t~ite24#1|))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_815)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse3)))))))) is different from false [2024-11-09 05:32:51,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse3))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_815)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_817))) (let ((.cse0 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse3))))))))))) is different from false [2024-11-09 05:32:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [619485093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:32:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318552869] [2024-11-09 05:32:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:32:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:32:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:32:51,171 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:32:51,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 05:32:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:32:51,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 05:32:51,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:32:51,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:32:53,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 05:32:56,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:32:56,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:32:58,826 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 52 treesize of output 46 [2024-11-09 05:32:59,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:32:59,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2024-11-09 05:33:02,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:02,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 70 [2024-11-09 05:33:03,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:03,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 73 [2024-11-09 05:33:03,988 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 83 treesize of output 71 [2024-11-09 05:33:05,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:33:05,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 53 [2024-11-09 05:33:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 426 proven. 99 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-09 05:33:06,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:33:06,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))))) is different from false [2024-11-09 05:33:06,430 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse0 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))))) is different from false [2024-11-09 05:33:06,480 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |c_ULTIMATE.start_step_#t~ite29#1| |c_ULTIMATE.start_step_#t~ite24#1|)))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse0 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))))))))) is different from false [2024-11-09 05:33:06,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2))) |c_ULTIMATE.start_step_#t~ite24#1|))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse3)))))))) is different from false [2024-11-09 05:33:06,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse4 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse3)))))))) is different from false [2024-11-09 05:33:06,920 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0)) (forall ((v_ArrVal_852 (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (let ((.cse6 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (store .cse6 .cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse6 .cse4))) .cse1))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_852)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_854))) (let ((.cse3 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse4)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse5)))))))))) is different from false [2024-11-09 05:33:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318552869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:06,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:33:06,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 30] total 73 [2024-11-09 05:33:06,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656569865] [2024-11-09 05:33:06,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:33:06,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-09 05:33:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:33:06,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-09 05:33:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=5749, Unknown=17, NotChecked=2736, Total=9120 [2024-11-09 05:33:06,989 INFO L87 Difference]: Start difference. First operand 511 states and 730 transitions. Second operand has 74 states, 65 states have (on average 3.230769230769231) internal successors, (210), 67 states have internal predecessors, (210), 20 states have call successors, (57), 16 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 20 states have call successors, (57) [2024-11-09 05:34:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:01,875 INFO L93 Difference]: Finished difference Result 1109 states and 1561 transitions. [2024-11-09 05:34:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-09 05:34:01,877 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 65 states have (on average 3.230769230769231) internal successors, (210), 67 states have internal predecessors, (210), 20 states have call successors, (57), 16 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 20 states have call successors, (57) Word has length 151 [2024-11-09 05:34:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:01,881 INFO L225 Difference]: With dead ends: 1109 [2024-11-09 05:34:01,882 INFO L226 Difference]: Without dead ends: 790 [2024-11-09 05:34:01,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 446 SyntacticMatches, 3 SemanticMatches, 170 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 8129 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=2853, Invalid=21373, Unknown=18, NotChecked=5168, Total=29412 [2024-11-09 05:34:01,889 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 904 mSDsluCounter, 4209 mSDsCounter, 0 mSdLazyCounter, 9465 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 4359 SdHoareTripleChecker+Invalid, 9738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 9465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:01,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 4359 Invalid, 9738 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [273 Valid, 9465 Invalid, 0 Unknown, 0 Unchecked, 35.4s Time] [2024-11-09 05:34:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-09 05:34:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 515. [2024-11-09 05:34:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 444 states have (on average 1.4076576576576576) internal successors, (625), 446 states have internal predecessors, (625), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:34:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 733 transitions. [2024-11-09 05:34:02,056 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 733 transitions. Word has length 151 [2024-11-09 05:34:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:02,057 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 733 transitions. [2024-11-09 05:34:02,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 65 states have (on average 3.230769230769231) internal successors, (210), 67 states have internal predecessors, (210), 20 states have call successors, (57), 16 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 20 states have call successors, (57) [2024-11-09 05:34:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 733 transitions. [2024-11-09 05:34:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:34:02,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:02,060 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-09 05:34:02,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:34:02,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2024-11-09 05:34:02,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:34:02,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 458532737, now seen corresponding path program 1 times [2024-11-09 05:34:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:34:02,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954880388] [2024-11-09 05:34:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:02,664 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:02,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:34:02,670 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:02,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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 (26)] Waiting until timeout for monitored process [2024-11-09 05:34:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:02,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:34:02,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 05:34:03,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:34:03,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:34:03,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954880388] [2024-11-09 05:34:03,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954880388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:34:03,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:34:03,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:34:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131823093] [2024-11-09 05:34:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:34:03,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:34:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:34:03,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:34:03,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:34:03,033 INFO L87 Difference]: Start difference. First operand 515 states and 733 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:34:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:03,184 INFO L93 Difference]: Finished difference Result 847 states and 1209 transitions. [2024-11-09 05:34:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:34:03,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-09 05:34:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:03,187 INFO L225 Difference]: With dead ends: 847 [2024-11-09 05:34:03,187 INFO L226 Difference]: Without dead ends: 524 [2024-11-09 05:34:03,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:34:03,189 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:03,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:34:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-09 05:34:03,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2024-11-09 05:34:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 455 states have internal predecessors, (634), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:34:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 742 transitions. [2024-11-09 05:34:03,353 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 742 transitions. Word has length 151 [2024-11-09 05:34:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:03,354 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 742 transitions. [2024-11-09 05:34:03,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:34:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 742 transitions. [2024-11-09 05:34:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:34:03,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:03,357 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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 (26)] Ended with exit code 0 [2024-11-09 05:34:03,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:03,558 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:03,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash -405078762, now seen corresponding path program 1 times [2024-11-09 05:34:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:34:03,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808923489] [2024-11-09 05:34:03,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:03,560 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:03,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:34:03,564 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:03,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:04,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 05:34:04,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:04,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:34:06,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:34:06,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:34:07,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-09 05:34:08,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 05:34:11,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:34:11,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 69 [2024-11-09 05:34:11,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:34:11,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 69 [2024-11-09 05:34:12,182 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 96 treesize of output 82 [2024-11-09 05:34:13,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:34:13,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 63 [2024-11-09 05:34:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 464 proven. 42 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-09 05:34:13,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:34:14,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_917 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_917))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse2))) (not (bvsgt .cse2 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-09 05:34:14,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_916 (_ BitVec 32))) (let ((.cse1 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_916)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_917))) (let ((.cse2 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))))))) is different from false [2024-11-09 05:34:14,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_913 (_ BitVec 32)) (v_ArrVal_917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_916 (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_913) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_916)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_917))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse2))) (not (bvsgt .cse2 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-09 05:34:15,860 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:34:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808923489] [2024-11-09 05:34:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808923489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [78075745] [2024-11-09 05:34:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:15,861 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:34:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:34:15,862 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:34:15,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 05:34:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:16,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 05:34:16,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:17,152 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:34:19,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 05:34:20,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 33 treesize of output 17 [2024-11-09 05:34:23,826 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-09 05:34:23,826 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 79 treesize of output 65 [2024-11-09 05:34:24,664 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-09 05:34:24,664 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 117 treesize of output 95 [2024-11-09 05:34:25,884 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:34:25,885 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 146 treesize of output 130 [2024-11-09 05:34:26,033 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 34 treesize of output 30 [2024-11-09 05:34:29,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:34:29,078 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 5 case distinctions, treesize of input 282 treesize of output 250 [2024-11-09 05:34:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 257 proven. 6 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-09 05:34:30,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:34:31,217 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_952))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (bvslt .cse2 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))))))) is different from false [2024-11-09 05:34:31,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_950 (_ BitVec 32)) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_950)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_952))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (bvslt .cse2 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))))))) is different from false [2024-11-09 05:34:31,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_950 (_ BitVec 32)) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_949 (_ BitVec 32))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_949) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_950)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_952))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (bvslt .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse3))) (not (bvsgt .cse3 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-09 05:34:35,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [78075745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:35,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055810425] [2024-11-09 05:34:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:35,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:35,247 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:34:35,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 05:34:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:35,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 05:34:35,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:36,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:34:38,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-09 05:34:49,975 WARN L286 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 36 DAG size of output: 15 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:34:49,976 INFO L349 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2024-11-09 05:34:49,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 71 [2024-11-09 05:35:00,500 WARN L286 SmtUtils]: Spent 9.62s on a formula simplification. DAG size of input: 36 DAG size of output: 15 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:35:00,501 INFO L349 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2024-11-09 05:35:00,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 138 treesize of output 116 [2024-11-09 05:35:02,052 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:35:02,052 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 180 treesize of output 168 [2024-11-09 05:35:02,336 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 33 treesize of output 29 [2024-11-09 05:35:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-09 05:35:07,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:09,312 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_985))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (bvslt .cse2 (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))))))) is different from false [2024-11-09 05:35:09,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_983 (_ BitVec 32)) (v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_983)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_985))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (bvslt .cse2 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))))))) is different from false [2024-11-09 05:35:09,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_983 (_ BitVec 32)) (v_ArrVal_981 (_ BitVec 32)) (v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_981) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_983)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_985))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))))) (.cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (bvslt .cse0 (bvadd (bvneg .cse1) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))))) (not (bvsgt .cse1 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse3 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse3 .cse0) .cse3)))))))) is different from false [2024-11-09 05:35:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055810425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:10,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:35:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 69 [2024-11-09 05:35:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985736682] [2024-11-09 05:35:10,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:35:10,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-09 05:35:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:35:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-09 05:35:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6667, Unknown=16, NotChecked=1584, Total=8930 [2024-11-09 05:35:10,570 INFO L87 Difference]: Start difference. First operand 524 states and 742 transitions. Second operand has 70 states, 62 states have (on average 3.096774193548387) internal successors, (192), 63 states have internal predecessors, (192), 17 states have call successors, (57), 13 states have call predecessors, (57), 17 states have return successors, (57), 13 states have call predecessors, (57), 17 states have call successors, (57) [2024-11-09 05:35:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:43,648 INFO L93 Difference]: Finished difference Result 1036 states and 1460 transitions. [2024-11-09 05:35:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 05:35:43,649 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 62 states have (on average 3.096774193548387) internal successors, (192), 63 states have internal predecessors, (192), 17 states have call successors, (57), 13 states have call predecessors, (57), 17 states have return successors, (57), 13 states have call predecessors, (57), 17 states have call successors, (57) Word has length 151 [2024-11-09 05:35:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:43,653 INFO L225 Difference]: With dead ends: 1036 [2024-11-09 05:35:43,654 INFO L226 Difference]: Without dead ends: 704 [2024-11-09 05:35:43,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 445 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 5147 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=1869, Invalid=13901, Unknown=16, NotChecked=2304, Total=18090 [2024-11-09 05:35:43,658 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1447 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 5262 mSolverCounterSat, 374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 5637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 5262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:43,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 2389 Invalid, 5637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [374 Valid, 5262 Invalid, 1 Unknown, 0 Unchecked, 21.5s Time] [2024-11-09 05:35:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-09 05:35:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 547. [2024-11-09 05:35:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 477 states have internal predecessors, (667), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:35:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 775 transitions. [2024-11-09 05:35:43,794 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 775 transitions. Word has length 151 [2024-11-09 05:35:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:43,795 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 775 transitions. [2024-11-09 05:35:43,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 62 states have (on average 3.096774193548387) internal successors, (192), 63 states have internal predecessors, (192), 17 states have call successors, (57), 13 states have call predecessors, (57), 17 states have return successors, (57), 13 states have call predecessors, (57), 17 states have call successors, (57) [2024-11-09 05:35:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 775 transitions. [2024-11-09 05:35:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:35:43,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:43,798 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:43,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:35:44,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:44,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:44,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:44,399 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:44,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1684942440, now seen corresponding path program 1 times [2024-11-09 05:35:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:35:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397119636] [2024-11-09 05:35:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:44,400 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:35:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:35:44,401 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:35:44,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-09 05:35:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:44,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:35:44,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:44,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:35:44,768 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 41 treesize of output 17 [2024-11-09 05:35:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 05:35:44,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:35:44,815 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:35:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397119636] [2024-11-09 05:35:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397119636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:44,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:35:44,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:35:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628810299] [2024-11-09 05:35:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:44,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:35:44,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:35:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:35:44,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:35:44,817 INFO L87 Difference]: Start difference. First operand 547 states and 775 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:35:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:45,946 INFO L93 Difference]: Finished difference Result 990 states and 1404 transitions. [2024-11-09 05:35:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:35:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-09 05:35:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:45,950 INFO L225 Difference]: With dead ends: 990 [2024-11-09 05:35:45,950 INFO L226 Difference]: Without dead ends: 658 [2024-11-09 05:35:45,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:35:45,952 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 46 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:45,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 512 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 05:35:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-09 05:35:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 554. [2024-11-09 05:35:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 482 states have (on average 1.4066390041493777) internal successors, (678), 484 states have internal predecessors, (678), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:35:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 786 transitions. [2024-11-09 05:35:46,099 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 786 transitions. Word has length 151 [2024-11-09 05:35:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 786 transitions. [2024-11-09 05:35:46,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 05:35:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 786 transitions. [2024-11-09 05:35:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:35:46,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:46,103 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:46,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-09 05:35:46,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:35:46,304 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:46,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2023218842, now seen corresponding path program 1 times [2024-11-09 05:35:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:35:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792267851] [2024-11-09 05:35:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:46,306 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:35:46,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:35:46,310 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:35:46,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:35:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:46,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 05:35:46,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:47,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:35:48,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:35:49,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 27 treesize of output 20 [2024-11-09 05:35:50,127 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 44 treesize of output 42 [2024-11-09 05:35:51,089 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 59 treesize of output 45 [2024-11-09 05:35:53,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:35:53,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 75 [2024-11-09 05:35:53,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:35:53,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 78 [2024-11-09 05:35:53,896 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 75 treesize of output 65 [2024-11-09 05:35:55,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:35:55,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 61 [2024-11-09 05:35:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 462 proven. 48 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-09 05:35:57,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:58,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1049))) (let ((.cse2 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) (or (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) .cse1) (= ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))))))))) is different from false [2024-11-09 05:35:58,780 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1047 (_ BitVec 32)) (v_ArrVal_1049 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1047)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1049))) (let ((.cse1 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) .cse0)))))) is different from false [2024-11-09 05:36:01,823 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:36:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792267851] [2024-11-09 05:36:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792267851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1054727717] [2024-11-09 05:36:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:01,824 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:36:01,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:36:01,825 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:36:01,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-09 05:36:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:02,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 05:36:02,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:03,242 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:36:04,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 05:36:06,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-09 05:36:08,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-09 05:36:10,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-09 05:36:15,171 INFO L349 Elim1Store]: treesize reduction 69, result has 17.9 percent of original size [2024-11-09 05:36:15,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 90 [2024-11-09 05:36:16,659 INFO L349 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2024-11-09 05:36:16,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 99 [2024-11-09 05:36:17,798 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:36:17,799 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 127 treesize of output 111 [2024-11-09 05:36:17,935 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 25 treesize of output 21 [2024-11-09 05:36:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 440 proven. 21 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-09 05:36:20,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:36:22,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1088 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1088))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (bvslt .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse3))) (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) .cse3)))))) is different from false [2024-11-09 05:36:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1054727717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59126521] [2024-11-09 05:36:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:39,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:39,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:36:39,210 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:36:39,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-09 05:36:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:39,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 05:36:39,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:40,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:36:43,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-09 05:36:46,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:46,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-11-09 05:36:49,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:49,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55 [2024-11-09 05:36:58,803 INFO L349 Elim1Store]: treesize reduction 77, result has 18.1 percent of original size [2024-11-09 05:36:58,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 98 treesize of output 103 [2024-11-09 05:37:00,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:37:00,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 88 [2024-11-09 05:37:01,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 82 [2024-11-09 05:37:02,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:37:02,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 57 [2024-11-09 05:37:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 375 proven. 27 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-09 05:37:03,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:37:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59126521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:37:13,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:37:13,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 26] total 86 [2024-11-09 05:37:13,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181608008] [2024-11-09 05:37:13,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:37:13,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-11-09 05:37:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:37:13,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-11-09 05:37:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1059, Invalid=12769, Unknown=226, NotChecked=708, Total=14762 [2024-11-09 05:37:13,737 INFO L87 Difference]: Start difference. First operand 554 states and 786 transitions. Second operand has 87 states, 76 states have (on average 2.8684210526315788) internal successors, (218), 81 states have internal predecessors, (218), 24 states have call successors, (57), 15 states have call predecessors, (57), 24 states have return successors, (57), 18 states have call predecessors, (57), 24 states have call successors, (57) [2024-11-09 05:38:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:44,163 INFO L93 Difference]: Finished difference Result 1311 states and 1841 transitions. [2024-11-09 05:38:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-09 05:38:44,164 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 76 states have (on average 2.8684210526315788) internal successors, (218), 81 states have internal predecessors, (218), 24 states have call successors, (57), 15 states have call predecessors, (57), 24 states have return successors, (57), 18 states have call predecessors, (57), 24 states have call successors, (57) Word has length 151 [2024-11-09 05:38:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:44,168 INFO L225 Difference]: With dead ends: 1311 [2024-11-09 05:38:44,168 INFO L226 Difference]: Without dead ends: 971 [2024-11-09 05:38:44,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 421 SyntacticMatches, 2 SemanticMatches, 191 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 10709 ImplicationChecksByTransitivity, 100.3s TimeCoverageRelationStatistics Valid=4030, Invalid=31605, Unknown=287, NotChecked=1134, Total=37056 [2024-11-09 05:38:44,174 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 3554 mSDsluCounter, 4209 mSDsCounter, 0 mSdLazyCounter, 9071 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3554 SdHoareTripleChecker+Valid, 4340 SdHoareTripleChecker+Invalid, 9743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 9071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:44,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3554 Valid, 4340 Invalid, 9743 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [672 Valid, 9071 Invalid, 0 Unknown, 0 Unchecked, 53.0s Time] [2024-11-09 05:38:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-09 05:38:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 570. [2024-11-09 05:38:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 498 states have (on average 1.4096385542168675) internal successors, (702), 500 states have internal predecessors, (702), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 05:38:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 810 transitions. [2024-11-09 05:38:44,342 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 810 transitions. Word has length 151 [2024-11-09 05:38:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:44,343 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 810 transitions. [2024-11-09 05:38:44,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 76 states have (on average 2.8684210526315788) internal successors, (218), 81 states have internal predecessors, (218), 24 states have call successors, (57), 15 states have call predecessors, (57), 24 states have return successors, (57), 18 states have call predecessors, (57), 24 states have call successors, (57) [2024-11-09 05:38:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 810 transitions. [2024-11-09 05:38:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 05:38:44,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:44,346 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:44,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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)] Ended with exit code 0 [2024-11-09 05:38:44,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-09 05:38:44,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-09 05:38:44,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:38:44,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:38:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:44,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1025318998, now seen corresponding path program 1 times [2024-11-09 05:38:44,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:38:44,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891184575] [2024-11-09 05:38:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:44,952 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:38:44,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:38:44,953 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/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:38:44,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-09 05:38:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:45,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 05:38:45,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:38:45,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:38:46,944 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:38:47,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:48,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:48,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-09 05:38:49,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 32 [2024-11-09 05:38:52,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:52,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 68 [2024-11-09 05:38:52,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:52,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 68 [2024-11-09 05:38:52,856 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 89 treesize of output 77 [2024-11-09 05:38:53,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:53,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 56 [2024-11-09 05:38:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 444 proven. 42 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-09 05:38:54,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:38:55,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1161 (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1161)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1163))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))))))))))) is different from false [2024-11-09 05:38:55,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1159 (_ BitVec 32)) (v_ArrVal_1161 (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_1159) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1161)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1163))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse1 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))))))))) is different from false [2024-11-09 05:38:56,942 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:38:56,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891184575] [2024-11-09 05:38:56,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891184575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:38:56,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778572323] [2024-11-09 05:38:56,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:56,942 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:38:56,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:38:56,944 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:38:56,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-09 05:38:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:57,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 05:38:57,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:38:58,218 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:39:00,301 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:39:01,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 21 [2024-11-09 05:39:05,668 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-09 05:39:05,668 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 90 treesize of output 72 [2024-11-09 05:39:06,601 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-09 05:39:06,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 103 [2024-11-09 05:39:08,268 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:39:08,269 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 175 treesize of output 161 [2024-11-09 05:39:08,439 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 32 treesize of output 28 [2024-11-09 05:39:14,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:39:14,200 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 5 case distinctions, treesize of input 323 treesize of output 295 [2024-11-09 05:39:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-09 05:39:44,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:39:45,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1198))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (not (bvslt .cse1 (bvadd (bvneg .cse2) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))) (not (bvsgt .cse2 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-09 05:39:46,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1197 (_ BitVec 32))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1197)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1198))) (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (let ((.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse1 .cse2) .cse1))) (not (bvslt .cse2 (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))))))))))) is different from false [2024-11-09 05:39:46,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1195 (_ BitVec 32)) (v_ArrVal_1197 (_ BitVec 32))) (let ((.cse4 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_1195) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1197)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1198))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (not (bvslt .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse3)))) (not (bvsgt .cse3 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2024-11-09 05:39:49,228 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|)) (.cse8 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse8))))) (or (forall ((|ULTIMATE.start_step_#t~mem6#1| (_ BitVec 8))) (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem6#1|)))) (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (|~#signed_char_Array_0~0.offset| (_ BitVec 32)) (|~#signed_char_Array_0~0.base| (_ BitVec 32)) (v_ArrVal_1198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1195 (_ BitVec 32)) (v_ArrVal_1197 (_ BitVec 32))) (let ((.cse9 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (store .cse7 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_1195) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1197)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1198))) (let ((.cse4 (select .cse9 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|)))) (.cse5 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))) (.cse3 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse9 |~#signed_char_Array_0~0.base|) |~#signed_char_Array_0~0.offset|)))) (.cse1 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0)) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse8))))) (or (not (bvsge (bvashr .cse1 .cse2) .cse1)) (not (bvslt .cse3 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse5))) (bvneg .cse6)))) (bvslt .cse2 (bvadd (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse5))))) (not (bvsge (bvashr .cse1 .cse3) .cse1)) (not (bvsgt .cse6 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))))))))))) is different from false [2024-11-09 05:39:49,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [778572323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:39:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608810974] [2024-11-09 05:39:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:49,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:39:49,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:39:49,530 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:39:49,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7bd2e1-329c-4953-bd88-026ea38080d4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-09 05:39:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:49,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 05:39:49,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:39:50,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:39:53,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-09 05:40:07,454 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 42 DAG size of output: 15 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:40:07,455 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2024-11-09 05:40:07,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 90 [2024-11-09 05:40:54,641 WARN L286 SmtUtils]: Spent 46.32s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:40:54,642 INFO L349 Elim1Store]: treesize reduction 17, result has 79.8 percent of original size [2024-11-09 05:40:54,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 139 [2024-11-09 05:41:03,794 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:41:03,794 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 179 treesize of output 163 [2024-11-09 05:41:04,078 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 34 treesize of output 30