./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 0e0057cc 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_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/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_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:18:08,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:18:08,762 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 14:18:08,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:18:08,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:18:08,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:18:08,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:18:08,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:18:08,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:18:08,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:18:08,791 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:18:08,792 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:18:08,792 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:18:08,793 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:18:08,793 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:18:08,794 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:18:08,795 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:18:08,795 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:18:08,795 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:18:08,796 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:18:08,796 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:18:08,797 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:18:08,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:18:08,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 14:18:08,799 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:18:08,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:18:08,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:18:08,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:18:08,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 14:18:08,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:18:08,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 14:18:08,801 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:18:08,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 14:18:08,802 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:18:08,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:18:08,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:18:08,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:18:08,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:18:08,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:18:08,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:18:08,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 14:18:08,803 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:18:08,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:18:08,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:18:08,804 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 14:18:08,804 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:18:08,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:18:08,804 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_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2023-12-02 14:18:09,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:18:09,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:18:09,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:18:09,040 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:18:09,041 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:18:09,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2023-12-02 14:18:11,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:18:11,949 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:18:11,950 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2023-12-02 14:18:11,959 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/data/613184c5b/c7eb7d1a8c424799bf7060ab6ae09881/FLAG2eead771d [2023-12-02 14:18:11,971 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/data/613184c5b/c7eb7d1a8c424799bf7060ab6ae09881 [2023-12-02 14:18:11,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:18:11,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:18:11,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:18:11,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:18:11,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:18:11,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:18:11" (1/1) ... [2023-12-02 14:18:11,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d21bef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:11, skipping insertion in model container [2023-12-02 14:18:11,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:18:11" (1/1) ... [2023-12-02 14:18:12,009 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:18:12,130 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2023-12-02 14:18:12,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:18:12,217 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:18:12,229 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2023-12-02 14:18:12,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:18:12,294 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:18:12,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12 WrapperNode [2023-12-02 14:18:12,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:18:12,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:18:12,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:18:12,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:18:12,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,369 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2023-12-02 14:18:12,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:18:12,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:18:12,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:18:12,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:18:12,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:18:12,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:18:12,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:18:12,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:18:12,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (1/1) ... [2023-12-02 14:18:12,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:18:12,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:18:12,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:18:12,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:18:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:18:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 14:18:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 14:18:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-12-02 14:18:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 14:18:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-12-02 14:18:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 14:18:12,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 14:18:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:18:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:18:12,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:18:12,611 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:18:12,613 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:18:13,142 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:18:13,716 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:18:13,716 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 14:18:13,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:13 BoogieIcfgContainer [2023-12-02 14:18:13,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:18:13,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:18:13,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:18:13,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:18:13,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:18:11" (1/3) ... [2023-12-02 14:18:13,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bca179b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:18:13, skipping insertion in model container [2023-12-02 14:18:13,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:12" (2/3) ... [2023-12-02 14:18:13,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bca179b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:18:13, skipping insertion in model container [2023-12-02 14:18:13,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:13" (3/3) ... [2023-12-02 14:18:13,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2023-12-02 14:18:13,740 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:18:13,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 14:18:13,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:18:13,783 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c394752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:18:13,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 14:18:13,787 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) [2023-12-02 14:18:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 14:18:13,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:18:13,796 INFO L195 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] [2023-12-02 14:18:13,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:18:13,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:18:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2080586557, now seen corresponding path program 1 times [2023-12-02 14:18:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:18:13,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300174692] [2023-12-02 14:18:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:18:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 14:18:21,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 14:18:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 14:18:24,351 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 14:18:24,353 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 14:18:24,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 14:18:24,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:18:24,361 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 14:18:24,365 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 14:18:24,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-12-02 14:18:24,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-12-02 14:18:24,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-12-02 14:18:24,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-12-02 14:18:24,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-12-02 14:18:24,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-12-02 14:18:24,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-12-02 14:18:24,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-12-02 14:18:24,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-12-02 14:18:24,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-12-02 14:18:24,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-12-02 14:18:24,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-12-02 14:18:24,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-12-02 14:18:24,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-12-02 14:18:24,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-12-02 14:18:24,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-12-02 14:18:24,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated [2023-12-02 14:18:24,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short72 could not be translated [2023-12-02 14:18:24,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-12-02 14:18:24,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated [2023-12-02 14:18:24,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-12-02 14:18:24,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-12-02 14:18:24,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-12-02 14:18:24,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short72 could not be translated [2023-12-02 14:18:24,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated [2023-12-02 14:18:24,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated [2023-12-02 14:18:24,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-12-02 14:18:24,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-12-02 14:18:24,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-12-02 14:18:24,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-12-02 14:18:24,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-12-02 14:18:24,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-12-02 14:18:24,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-12-02 14:18:24,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-12-02 14:18:24,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated [2023-12-02 14:18:24,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated [2023-12-02 14:18:24,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated [2023-12-02 14:18:24,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated [2023-12-02 14:18:24,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated [2023-12-02 14:18:24,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated [2023-12-02 14:18:24,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated [2023-12-02 14:18:24,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated [2023-12-02 14:18:24,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-12-02 14:18:24,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-12-02 14:18:24,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-12-02 14:18:24,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-12-02 14:18:24,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-12-02 14:18:24,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-12-02 14:18:24,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-12-02 14:18:24,429 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-12-02 14:18:24,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:18:24 BoogieIcfgContainer [2023-12-02 14:18:24,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 14:18:24,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 14:18:24,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 14:18:24,452 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 14:18:24,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:13" (3/4) ... [2023-12-02 14:18:24,455 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 14:18:24,456 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 14:18:24,457 INFO L158 Benchmark]: Toolchain (without parser) took 12482.39ms. Allocated memory was 136.3MB in the beginning and 478.2MB in the end (delta: 341.8MB). Free memory was 90.6MB in the beginning and 210.4MB in the end (delta: -119.8MB). Peak memory consumption was 223.6MB. Max. memory is 16.1GB. [2023-12-02 14:18:24,458 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:18:24,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.36ms. Allocated memory is still 136.3MB. Free memory was 90.6MB in the beginning and 74.4MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 14:18:24,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.56ms. Allocated memory is still 136.3MB. Free memory was 74.4MB in the beginning and 69.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 14:18:24,460 INFO L158 Benchmark]: Boogie Preprocessor took 63.13ms. Allocated memory is still 136.3MB. Free memory was 69.1MB in the beginning and 65.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 14:18:24,461 INFO L158 Benchmark]: RCFGBuilder took 1284.72ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 65.4MB in the beginning and 65.5MB in the end (delta: -15.9kB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2023-12-02 14:18:24,461 INFO L158 Benchmark]: TraceAbstraction took 10730.67ms. Allocated memory was 172.0MB in the beginning and 478.2MB in the end (delta: 306.2MB). Free memory was 64.4MB in the beginning and 210.4MB in the end (delta: -146.0MB). Peak memory consumption was 225.0MB. Max. memory is 16.1GB. [2023-12-02 14:18:24,462 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 478.2MB. Free memory is still 210.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:18:24,465 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.36ms. Allocated memory is still 136.3MB. Free memory was 90.6MB in the beginning and 74.4MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.56ms. Allocated memory is still 136.3MB. Free memory was 74.4MB in the beginning and 69.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.13ms. Allocated memory is still 136.3MB. Free memory was 69.1MB in the beginning and 65.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1284.72ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 65.4MB in the beginning and 65.5MB in the end (delta: -15.9kB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10730.67ms. Allocated memory was 172.0MB in the beginning and 478.2MB in the end (delta: 306.2MB). Free memory was 64.4MB in the beginning and 210.4MB in the end (delta: -146.0MB). Peak memory consumption was 225.0MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 478.2MB. Free memory is still 210.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 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][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 ((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 TRUE unsigned_char_Array_0[1][2] >= (unsigned_char_Array_0[0][0] << signed_char_Array_0[0]) [L48] EXPR unsigned_char_Array_0[1][1] [L48] EXPR unsigned_char_Array_0[1][0] [L48] COND FALSE !(unsigned_char_Array_0[1][1] > unsigned_char_Array_0[1][0]) [L51] BOOL_unsigned_char_Array_0[2] = 1 [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][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 ((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}, \old(cond)=0, cond=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}, \old(cond)=0, cond=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: 10.6s, 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, 7.6s 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 [2023-12-02 14:18:24,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/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_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:18:26,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:18:26,517 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 14:18:26,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:18:26,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:18:26,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:18:26,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:18:26,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:18:26,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:18:26,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:18:26,554 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:18:26,554 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:18:26,555 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:18:26,555 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:18:26,556 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:18:26,556 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:18:26,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:18:26,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 14:18:26,558 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:18:26,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:18:26,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:18:26,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 14:18:26,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:18:26,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 14:18:26,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:18:26,562 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 14:18:26,562 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 14:18:26,562 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:18:26,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 14:18:26,563 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:18:26,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:18:26,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 14:18:26,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:18:26,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:18:26,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:18:26,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:18:26,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:18:26,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 14:18:26,566 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 14:18:26,566 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 14:18:26,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:18:26,567 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 14:18:26,567 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:18:26,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:18:26,567 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d9fefadeb2433964027133b2762439d0736284a9020eef9186f2d2400ba62b5 [2023-12-02 14:18:26,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:18:26,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:18:26,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:18:26,892 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:18:26,892 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:18:26,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2023-12-02 14:18:29,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:18:29,863 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:18:29,864 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i [2023-12-02 14:18:29,874 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/data/87c10df73/d243c4df9506438591894acf0a7cc1f1/FLAG68e05ea4e [2023-12-02 14:18:29,886 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/data/87c10df73/d243c4df9506438591894acf0a7cc1f1 [2023-12-02 14:18:29,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:18:29,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:18:29,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:18:29,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:18:29,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:18:29,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:18:29" (1/1) ... [2023-12-02 14:18:29,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b438b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:29, skipping insertion in model container [2023-12-02 14:18:29,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:18:29" (1/1) ... [2023-12-02 14:18:29,922 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:18:30,047 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2023-12-02 14:18:30,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:18:30,139 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:18:30,152 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-56.i[916,929] [2023-12-02 14:18:30,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:18:30,229 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:18:30,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30 WrapperNode [2023-12-02 14:18:30,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:18:30,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:18:30,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:18:30,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:18:30,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,300 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2023-12-02 14:18:30,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:18:30,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:18:30,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:18:30,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:18:30,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:18:30,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:18:30,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:18:30,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:18:30,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (1/1) ... [2023-12-02 14:18:30,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:18:30,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:18:30,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:18:30,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:18:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:18:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-12-02 14:18:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-12-02 14:18:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 14:18:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 14:18:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-12-02 14:18:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 14:18:30,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 14:18:30,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:18:30,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:18:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-12-02 14:18:30,606 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:18:30,608 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:18:31,230 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:18:31,282 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:18:31,282 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 14:18:31,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:31 BoogieIcfgContainer [2023-12-02 14:18:31,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:18:31,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:18:31,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:18:31,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:18:31,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:18:29" (1/3) ... [2023-12-02 14:18:31,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311455bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:18:31, skipping insertion in model container [2023-12-02 14:18:31,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:30" (2/3) ... [2023-12-02 14:18:31,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311455bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:18:31, skipping insertion in model container [2023-12-02 14:18:31,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:31" (3/3) ... [2023-12-02 14:18:31,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-56.i [2023-12-02 14:18:31,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:18:31,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 14:18:31,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:18:31,368 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c026f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:18:31,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 14:18:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 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) [2023-12-02 14:18:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 14:18:31,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:18:31,390 INFO L195 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] [2023-12-02 14:18:31,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:18:31,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:18:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1798826168, now seen corresponding path program 1 times [2023-12-02 14:18:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:18:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571274467] [2023-12-02 14:18:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:18:31,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:18:31,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:18:31,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 14:18:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:31,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 14:18:31,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2023-12-02 14:18:31,784 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:18:31,785 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:18:31,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571274467] [2023-12-02 14:18:31,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571274467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:18:31,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:18:31,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:18:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143375858] [2023-12-02 14:18:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:18:31,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 14:18:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:18:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 14:18:31,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 14:18:31,825 INFO L87 Difference]: Start difference. First operand has 111 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 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 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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) [2023-12-02 14:18:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:18:31,876 INFO L93 Difference]: Finished difference Result 219 states and 353 transitions. [2023-12-02 14:18:31,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 14:18:31,879 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 144 [2023-12-02 14:18:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:18:31,887 INFO L225 Difference]: With dead ends: 219 [2023-12-02 14:18:31,888 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 14:18:31,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 14:18:31,895 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:18:31,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:18:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 14:18:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-02 14:18:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 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) [2023-12-02 14:18:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2023-12-02 14:18:31,945 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 144 [2023-12-02 14:18:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:18:31,946 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2023-12-02 14:18:31,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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) [2023-12-02 14:18:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2023-12-02 14:18:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 14:18:31,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:18:31,950 INFO L195 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] [2023-12-02 14:18:31,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:18:32,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:18:32,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:18:32,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:18:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash -486990898, now seen corresponding path program 1 times [2023-12-02 14:18:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:18:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726710875] [2023-12-02 14:18:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:32,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:18:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:18:32,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:18:32,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 14:18:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:32,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 14:18:32,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:32,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:18:33,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:34,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:18:34,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:18:34,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:18:35,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:18:35,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:35,614 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 [2023-12-02 14:18:35,694 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 [2023-12-02 14:18:35,920 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 [2023-12-02 14:18:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-02 14:18:36,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:18:36,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_64 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_64))) (= ((_ 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 [2023-12-02 14:18:36,316 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_62 (_ BitVec 32)) (v_ArrVal_64 (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_62)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_64))) (= ((_ 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 [2023-12-02 14:18:36,347 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_62 (_ BitVec 32)) (v_ArrVal_64 (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_62)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_64))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse1))) ((_ 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 [2023-12-02 14:18:36,367 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_62 (_ BitVec 32)) (v_ArrVal_64 (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) ((_ 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_62)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_64))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 |c_~#unsigned_char_Array_0~0.base|) .cse1))) ((_ 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 [2023-12-02 14:18:36,587 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:18:36,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726710875] [2023-12-02 14:18:36,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726710875] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:18:36,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1812050591] [2023-12-02 14:18:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:18:36,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:18:36,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:18:36,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-02 14:18:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:37,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 14:18:37,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:37,299 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 [2023-12-02 14:18:38,801 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2023-12-02 14:18:38,802 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 [2023-12-02 14:18:38,992 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2023-12-02 14:18:38,992 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 [2023-12-02 14:18:39,309 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 14:18:39,310 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 [2023-12-02 14:18:39,369 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 [2023-12-02 14:18:40,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:40,000 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 [2023-12-02 14:18:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-02 14:18:40,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:18:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1812050591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:18:40,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:18:40,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 30 [2023-12-02 14:18:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291476966] [2023-12-02 14:18:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:18:40,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 14:18:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:18:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 14:18:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1199, Unknown=4, NotChecked=292, Total=1640 [2023-12-02 14:18:40,086 INFO L87 Difference]: Start difference. First operand 109 states and 163 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 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) [2023-12-02 14:18:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:18:43,804 INFO L93 Difference]: Finished difference Result 439 states and 655 transitions. [2023-12-02 14:18:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 14:18:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 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 144 [2023-12-02 14:18:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:18:43,808 INFO L225 Difference]: With dead ends: 439 [2023-12-02 14:18:43,808 INFO L226 Difference]: Without dead ends: 331 [2023-12-02 14:18:43,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=269, Invalid=1999, Unknown=4, NotChecked=380, Total=2652 [2023-12-02 14:18:43,812 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 496 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 14:18:43,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1096 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 14:18:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-12-02 14:18:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 184. [2023-12-02 14:18:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 142 states have (on average 1.3873239436619718) internal successors, (197), 142 states have internal predecessors, (197), 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) [2023-12-02 14:18:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 273 transitions. [2023-12-02 14:18:43,844 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 273 transitions. Word has length 144 [2023-12-02 14:18:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:18:43,845 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 273 transitions. [2023-12-02 14:18:43,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 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) [2023-12-02 14:18:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 273 transitions. [2023-12-02 14:18:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-02 14:18:43,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:18:43,849 INFO L195 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] [2023-12-02 14:18:43,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-12-02 14:18:44,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 14:18:44,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:18:44,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:18:44,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:18:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1946825738, now seen corresponding path program 1 times [2023-12-02 14:18:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:18:44,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395260430] [2023-12-02 14:18:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:44,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:18:44,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:18:44,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:18:44,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 14:18:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:44,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 14:18:44,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:44,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:18:45,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:45,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:45,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:45,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:45,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:45,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:45,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:45,839 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 [2023-12-02 14:18:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-02 14:18:45,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:18:45,967 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:18:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395260430] [2023-12-02 14:18:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395260430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:18:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:18:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 14:18:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142539236] [2023-12-02 14:18:45,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:18:45,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 14:18:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:18:45,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 14:18:45,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:18:45,970 INFO L87 Difference]: Start difference. First operand 184 states and 273 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 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) [2023-12-02 14:18:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:18:48,360 INFO L93 Difference]: Finished difference Result 419 states and 628 transitions. [2023-12-02 14:18:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:18:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 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 145 [2023-12-02 14:18:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:18:48,364 INFO L225 Difference]: With dead ends: 419 [2023-12-02 14:18:48,364 INFO L226 Difference]: Without dead ends: 311 [2023-12-02 14:18:48,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-02 14:18:48,366 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 345 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:18:48,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 502 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 14:18:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-02 14:18:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 202. [2023-12-02 14:18:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 160 states have (on average 1.4125) internal successors, (226), 160 states have internal predecessors, (226), 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) [2023-12-02 14:18:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2023-12-02 14:18:48,394 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 145 [2023-12-02 14:18:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:18:48,395 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2023-12-02 14:18:48,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 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) [2023-12-02 14:18:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2023-12-02 14:18:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-02 14:18:48,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:18:48,398 INFO L195 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] [2023-12-02 14:18:48,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 14:18:48,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:18:48,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:18:48,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:18:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash 941368346, now seen corresponding path program 1 times [2023-12-02 14:18:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:18:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002404416] [2023-12-02 14:18:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:48,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:18:48,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:18:48,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:18:48,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 14:18:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:48,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 14:18:48,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:48,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:18:49,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:49,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:18:50,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:18:50,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:18:50,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:18:50,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:50,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:50,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 14:18:50,969 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 [2023-12-02 14:18:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-02 14:18:51,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:18:51,321 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:18:51,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002404416] [2023-12-02 14:18:51,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002404416] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:18:51,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345896218] [2023-12-02 14:18:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:51,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:18:51,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:18:51,322 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:18:51,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-02 14:18:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:51,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 14:18:51,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:51,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:18:52,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:18:52,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:52,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:52,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:52,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:52,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:52,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:52,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:18:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-02 14:18:52,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:18:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1345896218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:18:52,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:18:52,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 18 [2023-12-02 14:18:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897096173] [2023-12-02 14:18:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:18:52,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 14:18:52,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:18:52,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 14:18:52,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=493, Unknown=6, NotChecked=0, Total=600 [2023-12-02 14:18:52,935 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 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) [2023-12-02 14:18:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:18:54,129 INFO L93 Difference]: Finished difference Result 399 states and 597 transitions. [2023-12-02 14:18:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:18:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 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 145 [2023-12-02 14:18:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:18:54,133 INFO L225 Difference]: With dead ends: 399 [2023-12-02 14:18:54,133 INFO L226 Difference]: Without dead ends: 291 [2023-12-02 14:18:54,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=565, Unknown=6, NotChecked=0, Total=702 [2023-12-02 14:18:54,134 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 335 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:18:54,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 445 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 14:18:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-12-02 14:18:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 219. [2023-12-02 14:18:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.423728813559322) internal successors, (252), 177 states have internal predecessors, (252), 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) [2023-12-02 14:18:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 328 transitions. [2023-12-02 14:18:54,157 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 328 transitions. Word has length 145 [2023-12-02 14:18:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:18:54,158 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 328 transitions. [2023-12-02 14:18:54,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 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) [2023-12-02 14:18:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 328 transitions. [2023-12-02 14:18:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:18:54,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:18:54,161 INFO L195 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] [2023-12-02 14:18:54,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 14:18:54,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-02 14:18:54,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:18:54,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:18:54,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:18:54,562 INFO L85 PathProgramCache]: Analyzing trace with hash -919727266, now seen corresponding path program 1 times [2023-12-02 14:18:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:18:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576342671] [2023-12-02 14:18:54,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:54,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:18:54,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:18:54,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:18:54,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 14:18:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:54,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 14:18:54,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:55,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:18:55,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 14:18:55,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:55,409 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 40 treesize of output 27 [2023-12-02 14:18:55,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:55,559 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 40 treesize of output 27 [2023-12-02 14:18:55,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:55,842 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 47 treesize of output 45 [2023-12-02 14:18:55,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:55,946 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 62 treesize of output 48 [2023-12-02 14:18:56,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2023-12-02 14:18:56,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:56,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 61 treesize of output 31 [2023-12-02 14:18:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-12-02 14:18:56,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:18:56,316 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_239) |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 [2023-12-02 14:18:56,584 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:18:56,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576342671] [2023-12-02 14:18:56,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576342671] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:18:56,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1059435447] [2023-12-02 14:18:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:56,584 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:18:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:18:56,585 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:18:56,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-02 14:18:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:57,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 14:18:57,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:57,544 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 [2023-12-02 14:18:57,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-12-02 14:18:58,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-12-02 14:18:58,714 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 38 treesize of output 43 [2023-12-02 14:18:59,432 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 58 treesize of output 62 [2023-12-02 14:18:59,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2023-12-02 14:18:59,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:19:00,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 39 [2023-12-02 14:19:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 427 proven. 27 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-12-02 14:19:00,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:19:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1059435447] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:19:00,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396809618] [2023-12-02 14:19:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:00,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:19:00,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:19:00,430 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:19:00,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 14:19:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:00,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 14:19:00,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:00,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 14:19:01,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:01,042 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 [2023-12-02 14:19:01,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:01,357 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 [2023-12-02 14:19:01,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:01,893 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 [2023-12-02 14:19:02,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:02,083 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 [2023-12-02 14:19:02,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2023-12-02 14:19:02,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:02,392 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 [2023-12-02 14:19:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-12-02 14:19:02,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:19:02,495 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_311) |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 [2023-12-02 14:19:02,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396809618] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:19:02,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:19:02,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 16] total 36 [2023-12-02 14:19:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818148692] [2023-12-02 14:19:02,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:19:02,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 14:19:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:02,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 14:19:02,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1483, Unknown=22, NotChecked=166, Total=1980 [2023-12-02 14:19:02,683 INFO L87 Difference]: Start difference. First operand 219 states and 328 transitions. Second operand has 37 states, 33 states have (on average 4.575757575757576) internal successors, (151), 35 states have internal predecessors, (151), 13 states have call successors, (42), 9 states have call predecessors, (42), 13 states have return successors, (42), 10 states have call predecessors, (42), 13 states have call successors, (42) [2023-12-02 14:19:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:09,262 INFO L93 Difference]: Finished difference Result 544 states and 780 transitions. [2023-12-02 14:19:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 14:19:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 4.575757575757576) internal successors, (151), 35 states have internal predecessors, (151), 13 states have call successors, (42), 9 states have call predecessors, (42), 13 states have return successors, (42), 10 states have call predecessors, (42), 13 states have call successors, (42) Word has length 146 [2023-12-02 14:19:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:09,266 INFO L225 Difference]: With dead ends: 544 [2023-12-02 14:19:09,266 INFO L226 Difference]: Without dead ends: 436 [2023-12-02 14:19:09,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 472 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=683, Invalid=2957, Unknown=28, NotChecked=238, Total=3906 [2023-12-02 14:19:09,269 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 853 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:19:09,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 989 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-12-02 14:19:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-12-02 14:19:09,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 387. [2023-12-02 14:19:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 320 states have (on average 1.40625) internal successors, (450), 322 states have internal predecessors, (450), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 14:19:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 558 transitions. [2023-12-02 14:19:09,312 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 558 transitions. Word has length 146 [2023-12-02 14:19:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:09,313 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 558 transitions. [2023-12-02 14:19:09,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 4.575757575757576) internal successors, (151), 35 states have internal predecessors, (151), 13 states have call successors, (42), 9 states have call predecessors, (42), 13 states have return successors, (42), 10 states have call predecessors, (42), 13 states have call successors, (42) [2023-12-02 14:19:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 558 transitions. [2023-12-02 14:19:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:19:09,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:09,316 INFO L195 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] [2023-12-02 14:19:09,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 14:19:09,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-12-02 14:19:09,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-02 14:19:09,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:19:09,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:19:09,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash -218662688, now seen corresponding path program 1 times [2023-12-02 14:19:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043632876] [2023-12-02 14:19:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:09,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:19:09,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:09,919 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:19:09,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 14:19:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:10,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 14:19:10,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:10,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:19:10,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:19:10,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 14:19:10,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:10,848 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 [2023-12-02 14:19:10,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:10,929 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 [2023-12-02 14:19:10,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:19:11,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:11,221 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 [2023-12-02 14:19:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2023-12-02 14:19:11,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:19:11,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043632876] [2023-12-02 14:19:11,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043632876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:19:11,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:19:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 14:19:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021189732] [2023-12-02 14:19:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:19:11,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 14:19:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:11,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 14:19:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-02 14:19:11,309 INFO L87 Difference]: Start difference. First operand 387 states and 558 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 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) [2023-12-02 14:19:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:15,333 INFO L93 Difference]: Finished difference Result 777 states and 1126 transitions. [2023-12-02 14:19:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 14:19:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 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 146 [2023-12-02 14:19:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:15,339 INFO L225 Difference]: With dead ends: 777 [2023-12-02 14:19:15,339 INFO L226 Difference]: Without dead ends: 532 [2023-12-02 14:19:15,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2023-12-02 14:19:15,341 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 607 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:19:15,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 778 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-02 14:19:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2023-12-02 14:19:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 427. [2023-12-02 14:19:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 360 states have (on average 1.4222222222222223) internal successors, (512), 362 states have internal predecessors, (512), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-02 14:19:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 620 transitions. [2023-12-02 14:19:15,379 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 620 transitions. Word has length 146 [2023-12-02 14:19:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:15,380 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 620 transitions. [2023-12-02 14:19:15,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 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) [2023-12-02 14:19:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 620 transitions. [2023-12-02 14:19:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:19:15,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:15,383 INFO L195 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] [2023-12-02 14:19:15,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 14:19:15,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:19:15,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:19:15,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -805468702, now seen corresponding path program 1 times [2023-12-02 14:19:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785111783] [2023-12-02 14:19:15,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:15,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:19:15,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:15,585 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:19:15,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 14:19:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:15,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 14:19:15,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:15,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:19:16,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:19:16,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:19:17,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-12-02 14:19:17,783 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 [2023-12-02 14:19:18,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:18,714 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 64 treesize of output 59 [2023-12-02 14:19:18,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:18,903 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 74 treesize of output 63 [2023-12-02 14:19:18,991 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 63 treesize of output 55 [2023-12-02 14:19:19,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:19,214 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 73 treesize of output 37 [2023-12-02 14:19:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 454 proven. 48 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-12-02 14:19:19,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:19:19,425 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_381))) (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 [2023-12-02 14:19:19,446 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (_ BitVec 32)) (v_ArrVal_381 (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_379)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_381))) (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 [2023-12-02 14:19:19,477 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_379 (_ BitVec 32)) (v_ArrVal_381 (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_379)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_381))) (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 [2023-12-02 14:19:19,922 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:19,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785111783] [2023-12-02 14:19:19,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785111783] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:19:19,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1940358106] [2023-12-02 14:19:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:19,922 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:19:19,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:19:19,923 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:19:19,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-02 14:19:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:20,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 14:19:20,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:20,579 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 27 treesize of output 13 [2023-12-02 14:19:21,279 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 [2023-12-02 14:19:21,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 19 [2023-12-02 14:19:22,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 26 treesize of output 19 [2023-12-02 14:19:22,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:19:23,224 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 [2023-12-02 14:19:24,248 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 [2023-12-02 14:19:24,495 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 [2023-12-02 14:19:24,743 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 [2023-12-02 14:19:24,989 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 [2023-12-02 14:19:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 463 proven. 27 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-12-02 14:19:25,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:19:25,396 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_416 (_ BitVec 32)) (v_ArrVal_418 (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_416)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_418))) (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 [2023-12-02 14:19:25,424 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_416 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_418 (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_416)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_418))) (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 [2023-12-02 14:19:36,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1940358106] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:19:36,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304736196] [2023-12-02 14:19:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:36,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:19:36,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:19:36,226 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:19:36,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 14:19:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:36,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 14:19:36,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:36,414 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 10 treesize of output 4 [2023-12-02 14:19:36,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:19:37,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:19:37,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:19:38,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:19:38,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:19:38,779 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 [2023-12-02 14:19:39,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:39,034 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 59 treesize of output 45 [2023-12-02 14:19:39,114 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 48 treesize of output 42 [2023-12-02 14:19:39,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:39,381 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 58 treesize of output 28 [2023-12-02 14:19:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-02 14:19:39,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:19:39,518 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_455))) (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 [2023-12-02 14:19:39,546 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_454 (_ 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_454)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_455))) (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 [2023-12-02 14:19:39,578 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_454 (_ 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_454)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_455))) (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 [2023-12-02 14:19:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304736196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:19:41,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:19:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 16] total 53 [2023-12-02 14:19:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783578710] [2023-12-02 14:19:41,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:19:41,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-02 14:19:41,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:41,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-02 14:19:41,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=3357, Unknown=63, NotChecked=1048, Total=5112 [2023-12-02 14:19:41,980 INFO L87 Difference]: Start difference. First operand 427 states and 620 transitions. Second operand has 54 states, 47 states have (on average 3.765957446808511) internal successors, (177), 49 states have internal predecessors, (177), 17 states have call successors, (57), 12 states have call predecessors, (57), 17 states have return successors, (57), 14 states have call predecessors, (57), 17 states have call successors, (57) [2023-12-02 14:19:44,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:19:47,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:19:49,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:19:52,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:20:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:07,365 INFO L93 Difference]: Finished difference Result 1126 states and 1617 transitions. [2023-12-02 14:20:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-12-02 14:20:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 47 states have (on average 3.765957446808511) internal successors, (177), 49 states have internal predecessors, (177), 17 states have call successors, (57), 12 states have call predecessors, (57), 17 states have return successors, (57), 14 states have call predecessors, (57), 17 states have call successors, (57) Word has length 146 [2023-12-02 14:20:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:07,371 INFO L225 Difference]: With dead ends: 1126 [2023-12-02 14:20:07,371 INFO L226 Difference]: Without dead ends: 858 [2023-12-02 14:20:07,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 447 SyntacticMatches, 5 SemanticMatches, 119 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4226 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=1908, Invalid=10683, Unknown=97, NotChecked=1832, Total=14520 [2023-12-02 14:20:07,378 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1455 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 4697 mSolverCounterSat, 292 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 4993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 4697 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:07,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 2021 Invalid, 4993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 4697 Invalid, 4 Unknown, 0 Unchecked, 20.2s Time] [2023-12-02 14:20:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2023-12-02 14:20:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 472. [2023-12-02 14:20:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 402 states have (on average 1.4253731343283582) internal successors, (573), 404 states have internal predecessors, (573), 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) [2023-12-02 14:20:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 681 transitions. [2023-12-02 14:20:07,432 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 681 transitions. Word has length 146 [2023-12-02 14:20:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:07,433 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 681 transitions. [2023-12-02 14:20:07,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 47 states have (on average 3.765957446808511) internal successors, (177), 49 states have internal predecessors, (177), 17 states have call successors, (57), 12 states have call predecessors, (57), 17 states have return successors, (57), 14 states have call predecessors, (57), 17 states have call successors, (57) [2023-12-02 14:20:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 681 transitions. [2023-12-02 14:20:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:20:07,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:07,435 INFO L195 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] [2023-12-02 14:20:07,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 14:20:07,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-02 14:20:07,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2023-12-02 14:20:08,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:20:08,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:20:08,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash -785713760, now seen corresponding path program 1 times [2023-12-02 14:20:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363876990] [2023-12-02 14:20:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:08,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:20:08,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:08,038 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:20:08,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 14:20:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:08,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 14:20:08,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:08,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:20:08,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:20:08,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 14:20:08,885 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 [2023-12-02 14:20:09,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:09,100 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 43 treesize of output 39 [2023-12-02 14:20:09,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:09,165 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 53 treesize of output 43 [2023-12-02 14:20:09,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2023-12-02 14:20:09,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:09,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34 [2023-12-02 14:20:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2023-12-02 14:20:09,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:20:09,512 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:09,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363876990] [2023-12-02 14:20:09,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363876990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:20:09,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:20:09,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 14:20:09,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429446746] [2023-12-02 14:20:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:20:09,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 14:20:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:09,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 14:20:09,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-02 14:20:09,514 INFO L87 Difference]: Start difference. First operand 472 states and 681 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 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) [2023-12-02 14:20:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:12,635 INFO L93 Difference]: Finished difference Result 866 states and 1252 transitions. [2023-12-02 14:20:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 14:20:12,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 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 146 [2023-12-02 14:20:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:12,639 INFO L225 Difference]: With dead ends: 866 [2023-12-02 14:20:12,639 INFO L226 Difference]: Without dead ends: 576 [2023-12-02 14:20:12,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2023-12-02 14:20:12,641 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 639 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:12,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 655 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 14:20:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2023-12-02 14:20:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 472. [2023-12-02 14:20:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 402 states have (on average 1.4253731343283582) internal successors, (573), 404 states have internal predecessors, (573), 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) [2023-12-02 14:20:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 681 transitions. [2023-12-02 14:20:12,691 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 681 transitions. Word has length 146 [2023-12-02 14:20:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:12,691 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 681 transitions. [2023-12-02 14:20:12,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 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) [2023-12-02 14:20:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 681 transitions. [2023-12-02 14:20:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:20:12,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:12,693 INFO L195 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] [2023-12-02 14:20:12,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-02 14:20:12,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:20:12,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:20:12,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash -84649182, now seen corresponding path program 1 times [2023-12-02 14:20:12,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:12,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023903227] [2023-12-02 14:20:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:12,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:20:12,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:12,896 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:20:12,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 14:20:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:13,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 14:20:13,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:13,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:20:13,639 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 [2023-12-02 14:20:13,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:13,991 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 [2023-12-02 14:20:14,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:14,255 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 [2023-12-02 14:20:14,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:14,765 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 67 treesize of output 53 [2023-12-02 14:20:14,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:14,936 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 82 treesize of output 56 [2023-12-02 14:20:15,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:20:15,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:15,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 81 treesize of output 39 [2023-12-02 14:20:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 27 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-12-02 14:20:15,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:15,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_529) |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 [2023-12-02 14:20:15,672 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:15,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023903227] [2023-12-02 14:20:15,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023903227] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:20:15,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1964446818] [2023-12-02 14:20:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:20:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:20:15,673 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:20:15,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 14:20:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:16,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 14:20:16,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:16,710 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 [2023-12-02 14:20:17,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-02 14:20:17,895 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 [2023-12-02 14:20:18,161 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 [2023-12-02 14:20:18,775 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 48 [2023-12-02 14:20:19,001 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 57 treesize of output 47 [2023-12-02 14:20:19,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-12-02 14:20:19,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-12-02 14:20:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 411 proven. 27 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-12-02 14:20:19,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1964446818] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:20:20,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173199404] [2023-12-02 14:20:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:20,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:20:20,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:20:20,016 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:20:20,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 14:20:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:20,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 14:20:20,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:20,522 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 [2023-12-02 14:20:20,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:20,712 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 [2023-12-02 14:20:21,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:21,065 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 [2023-12-02 14:20:22,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:22,079 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 76 treesize of output 74 [2023-12-02 14:20:22,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:22,393 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 86 treesize of output 78 [2023-12-02 14:20:22,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2023-12-02 14:20:22,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:22,860 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 85 treesize of output 43 [2023-12-02 14:20:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 372 proven. 27 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2023-12-02 14:20:22,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:22,944 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_600) |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 [2023-12-02 14:20:23,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173199404] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:20:23,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:20:23,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 37 [2023-12-02 14:20:23,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469283771] [2023-12-02 14:20:23,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:20:23,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 14:20:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:23,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 14:20:23,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1556, Unknown=22, NotChecked=170, Total=2070 [2023-12-02 14:20:23,147 INFO L87 Difference]: Start difference. First operand 472 states and 681 transitions. Second operand has 38 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 35 states have internal predecessors, (151), 13 states have call successors, (42), 9 states have call predecessors, (42), 13 states have return successors, (42), 11 states have call predecessors, (42), 13 states have call successors, (42) [2023-12-02 14:20:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:31,815 INFO L93 Difference]: Finished difference Result 957 states and 1377 transitions. [2023-12-02 14:20:31,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 14:20:31,816 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 35 states have internal predecessors, (151), 13 states have call successors, (42), 9 states have call predecessors, (42), 13 states have return successors, (42), 11 states have call predecessors, (42), 13 states have call successors, (42) Word has length 146 [2023-12-02 14:20:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:31,820 INFO L225 Difference]: With dead ends: 957 [2023-12-02 14:20:31,820 INFO L226 Difference]: Without dead ends: 667 [2023-12-02 14:20:31,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 467 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=812, Invalid=3458, Unknown=28, NotChecked=258, Total=4556 [2023-12-02 14:20:31,824 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 1074 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:31,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 949 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-02 14:20:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2023-12-02 14:20:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 489. [2023-12-02 14:20:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 419 states have (on average 1.431980906921241) internal successors, (600), 421 states have internal predecessors, (600), 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) [2023-12-02 14:20:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 708 transitions. [2023-12-02 14:20:31,906 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 708 transitions. Word has length 146 [2023-12-02 14:20:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:31,907 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 708 transitions. [2023-12-02 14:20:31,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 35 states have internal predecessors, (151), 13 states have call successors, (42), 9 states have call predecessors, (42), 13 states have return successors, (42), 11 states have call predecessors, (42), 13 states have call successors, (42) [2023-12-02 14:20:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 708 transitions. [2023-12-02 14:20:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:20:31,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:31,909 INFO L195 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] [2023-12-02 14:20:31,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 14:20:32,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-02 14:20:32,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 14:20:32,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:20:32,511 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:20:32,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash -156623074, now seen corresponding path program 1 times [2023-12-02 14:20:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:20:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866412149] [2023-12-02 14:20:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:32,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:20:32,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:20:32,513 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:20:32,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 14:20:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:32,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 14:20:32,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:32,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:20:33,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:20:34,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:20:34,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:20:34,931 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 59 treesize of output 36 [2023-12-02 14:20:35,833 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 93 treesize of output 71 [2023-12-02 14:20:36,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:36,068 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 92 treesize of output 70 [2023-12-02 14:20:36,201 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 81 treesize of output 71 [2023-12-02 14:20:36,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:36,470 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 91 treesize of output 53 [2023-12-02 14:20:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 454 proven. 48 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-12-02 14:20:36,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:36,736 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_636))) (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 [2023-12-02 14:20:36,761 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (_ BitVec 32)) (v_ArrVal_636 (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_634)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_636))) (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 [2023-12-02 14:20:36,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_634 (_ BitVec 32)) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32)) (v_ArrVal_636 (Array (_ BitVec 32) (_ 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_634)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_636))) (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 [2023-12-02 14:20:37,286 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:20:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866412149] [2023-12-02 14:20:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866412149] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:20:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1098538209] [2023-12-02 14:20:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:37,287 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:20:37,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:20:37,287 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:20:37,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 14:20:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:37,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 14:20:37,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:37,988 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 27 treesize of output 13 [2023-12-02 14:20:38,803 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 [2023-12-02 14:20:39,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 19 [2023-12-02 14:20:39,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-12-02 14:20:40,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:20:41,176 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 47 treesize of output 41 [2023-12-02 14:20:42,522 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 74 treesize of output 67 [2023-12-02 14:20:42,853 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 85 treesize of output 70 [2023-12-02 14:20:43,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2023-12-02 14:20:43,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 50 [2023-12-02 14:20:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 483 proven. 27 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-12-02 14:20:43,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:43,780 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_672))) (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 [2023-12-02 14:20:43,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (_ 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_671)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_672))) (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 [2023-12-02 14:20:43,833 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32)) (v_ArrVal_671 (_ 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_671)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_672))) (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 [2023-12-02 14:20:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1098538209] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:20:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767107517] [2023-12-02 14:20:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:20:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:20:45,885 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:20:45,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 14:20:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:46,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 14:20:46,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:46,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:20:47,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:20:47,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:20:47,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:20:48,274 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 [2023-12-02 14:20:49,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:49,342 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 [2023-12-02 14:20:49,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:49,649 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 [2023-12-02 14:20:49,770 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 [2023-12-02 14:20:50,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:50,096 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 [2023-12-02 14:20:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 434 proven. 48 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2023-12-02 14:20:50,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:50,449 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_709))) (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 [2023-12-02 14:20:50,476 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_708 (_ 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_708)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_709))) (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 [2023-12-02 14:20:50,513 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~ite24#1| (_ BitVec 32)) (v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite29#1| (_ BitVec 32)) (v_ArrVal_708 (_ 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_708)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_709))) (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 [2023-12-02 14:20:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767107517] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:20:55,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:20:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 60 [2023-12-02 14:20:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225623372] [2023-12-02 14:20:55,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:20:55,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-12-02 14:20:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-12-02 14:20:55,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=3997, Unknown=11, NotChecked=1260, Total=5852 [2023-12-02 14:20:55,023 INFO L87 Difference]: Start difference. First operand 489 states and 708 transitions. Second operand has 61 states, 53 states have (on average 3.5660377358490565) internal successors, (189), 56 states have internal predecessors, (189), 20 states have call successors, (57), 14 states have call predecessors, (57), 20 states have return successors, (57), 16 states have call predecessors, (57), 20 states have call successors, (57) [2023-12-02 14:20:57,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:21:00,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:21:03,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:21:05,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:21:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:21:29,250 INFO L93 Difference]: Finished difference Result 1082 states and 1548 transitions. [2023-12-02 14:21:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-02 14:21:29,252 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 53 states have (on average 3.5660377358490565) internal successors, (189), 56 states have internal predecessors, (189), 20 states have call successors, (57), 14 states have call predecessors, (57), 20 states have return successors, (57), 16 states have call predecessors, (57), 20 states have call successors, (57) Word has length 146 [2023-12-02 14:21:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:21:29,255 INFO L225 Difference]: With dead ends: 1082 [2023-12-02 14:21:29,255 INFO L226 Difference]: Without dead ends: 775 [2023-12-02 14:21:29,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 444 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 4863 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=1955, Invalid=12590, Unknown=11, NotChecked=2214, Total=16770 [2023-12-02 14:21:29,264 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 2002 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 6572 mSolverCounterSat, 498 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 7074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 6572 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:21:29,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 2683 Invalid, 7074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [498 Valid, 6572 Invalid, 4 Unknown, 0 Unchecked, 27.1s Time] [2023-12-02 14:21:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-12-02 14:21:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 487. [2023-12-02 14:21:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 417 states have (on average 1.4292565947242206) internal successors, (596), 419 states have internal predecessors, (596), 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) [2023-12-02 14:21:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 704 transitions. [2023-12-02 14:21:29,341 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 704 transitions. Word has length 146 [2023-12-02 14:21:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:21:29,342 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 704 transitions. [2023-12-02 14:21:29,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 53 states have (on average 3.5660377358490565) internal successors, (189), 56 states have internal predecessors, (189), 20 states have call successors, (57), 14 states have call predecessors, (57), 20 states have return successors, (57), 16 states have call predecessors, (57), 20 states have call successors, (57) [2023-12-02 14:21:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 704 transitions. [2023-12-02 14:21:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:21:29,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:21:29,344 INFO L195 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] [2023-12-02 14:21:29,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 14:21:29,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-02 14:21:29,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 14:21:29,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:21:29,945 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:21:29,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:21:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash -743429088, now seen corresponding path program 1 times [2023-12-02 14:21:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:21:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885147131] [2023-12-02 14:21:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:21:29,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:21:29,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:21:29,947 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:21:29,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 14:21:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:21:30,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 14:21:30,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:31,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:21:31,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:21:31,570 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 [2023-12-02 14:21:32,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:21:32,019 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 [2023-12-02 14:21:32,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:21:32,933 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 81 treesize of output 75 [2023-12-02 14:21:33,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:21:33,176 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 96 treesize of output 78 [2023-12-02 14:21:33,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2023-12-02 14:21:34,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:21:34,000 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 107 treesize of output 49 [2023-12-02 14:21:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 454 proven. 54 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2023-12-02 14:21:34,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:34,671 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_744))) (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 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))))))) is different from false [2023-12-02 14:21:34,701 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (_ BitVec 32)) (v_ArrVal_744 (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_742)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_744))) (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 [2023-12-02 14:21:34,735 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (_ BitVec 32)) (v_ArrVal_744 (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_742)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_744))) (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 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))))))) is different from false [2023-12-02 14:21:34,758 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (_ BitVec 32)) (v_ArrVal_744 (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 |c_ULTIMATE.start_step_#t~ite24#1| ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2)))))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_742)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_744))) (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 [2023-12-02 14:21:34,933 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:21:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885147131] [2023-12-02 14:21:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885147131] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:21:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1414917849] [2023-12-02 14:21:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:21:34,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:21:34,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:21:34,934 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:21:34,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 14:21:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:21:35,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 14:21:35,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:36,238 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 [2023-12-02 14:21:37,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 14:21:37,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:21:38,906 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 [2023-12-02 14:21:39,501 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 46 treesize of output 47 [2023-12-02 14:21:40,931 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 65 [2023-12-02 14:21:41,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2023-12-02 14:21:41,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2023-12-02 14:21:42,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 48 [2023-12-02 14:21:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 473 proven. 54 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2023-12-02 14:21:43,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:43,577 WARN L854 $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) (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 [2023-12-02 14:21:43,611 WARN L854 $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 ((.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_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) (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 [2023-12-02 14:21:43,648 WARN L854 $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 |c_ULTIMATE.start_step_#t~ite24#1| ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse3)))))))) (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 [2023-12-02 14:21:43,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1414917849] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:21:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709178899] [2023-12-02 14:21:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:21:43,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:21:43,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:21:43,907 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:21:43,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 14:21:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:21:44,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 14:21:44,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:21:44,521 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 [2023-12-02 14:21:46,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:21:46,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 14:21:47,335 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 [2023-12-02 14:21:47,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:21:47,958 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 67 treesize of output 49 [2023-12-02 14:21:49,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:21:49,048 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 66 [2023-12-02 14:21:49,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:21:49,440 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 73 treesize of output 60 [2023-12-02 14:21:49,555 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 54 [2023-12-02 14:21:50,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:21:50,579 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 84 treesize of output 40 [2023-12-02 14:21:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 426 proven. 99 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-02 14:21:50,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:21:50,790 WARN L854 $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 [2023-12-02 14:21:50,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (_ BitVec 32)) (v_ArrVal_817 (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_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 (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| (_ bv5 32))))))))) is different from false [2023-12-02 14:21:50,863 WARN L854 $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 [2023-12-02 14:21:50,889 WARN L854 $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))) (.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))) (let ((.cse3 (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 |c_ULTIMATE.start_step_#t~ite24#1| ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2)))))))) (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 .cse3 |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 .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 [2023-12-02 14:21:51,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709178899] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:21:51,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:21:51,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28, 27] total 69 [2023-12-02 14:21:51,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112626416] [2023-12-02 14:21:51,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:21:51,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-12-02 14:21:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:21:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-12-02 14:21:51,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=5341, Unknown=64, NotChecked=1804, Total=8010 [2023-12-02 14:21:51,182 INFO L87 Difference]: Start difference. First operand 487 states and 704 transitions. Second operand has 70 states, 61 states have (on average 2.9508196721311477) internal successors, (180), 61 states have internal predecessors, (180), 20 states have call successors, (48), 16 states have call predecessors, (48), 20 states have return successors, (49), 17 states have call predecessors, (49), 20 states have call successors, (49) [2023-12-02 14:21:53,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:22:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:22:11,878 INFO L93 Difference]: Finished difference Result 900 states and 1289 transitions. [2023-12-02 14:22:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 14:22:11,879 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 61 states have (on average 2.9508196721311477) internal successors, (180), 61 states have internal predecessors, (180), 20 states have call successors, (48), 16 states have call predecessors, (48), 20 states have return successors, (49), 17 states have call predecessors, (49), 20 states have call successors, (49) Word has length 146 [2023-12-02 14:22:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:22:11,881 INFO L225 Difference]: With dead ends: 900 [2023-12-02 14:22:11,881 INFO L226 Difference]: Without dead ends: 593 [2023-12-02 14:22:11,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 431 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=1781, Invalid=9955, Unknown=80, NotChecked=2464, Total=14280 [2023-12-02 14:22:11,884 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1323 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 5283 mSolverCounterSat, 228 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 5512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 5283 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:22:11,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 2157 Invalid, 5512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 5283 Invalid, 1 Unknown, 0 Unchecked, 17.2s Time] [2023-12-02 14:22:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-12-02 14:22:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 489. [2023-12-02 14:22:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 418 states have (on average 1.4282296650717703) internal successors, (597), 420 states have internal predecessors, (597), 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) [2023-12-02 14:22:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 705 transitions. [2023-12-02 14:22:11,981 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 705 transitions. Word has length 146 [2023-12-02 14:22:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:22:11,981 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 705 transitions. [2023-12-02 14:22:11,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 61 states have (on average 2.9508196721311477) internal successors, (180), 61 states have internal predecessors, (180), 20 states have call successors, (48), 16 states have call predecessors, (48), 20 states have return successors, (49), 17 states have call predecessors, (49), 20 states have call successors, (49) [2023-12-02 14:22:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 705 transitions. [2023-12-02 14:22:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:22:11,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:22:11,983 INFO L195 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] [2023-12-02 14:22:11,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-02 14:22:12,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-02 14:22:12,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 14:22:12,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:22:12,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:22:12,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:22:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1310480160, now seen corresponding path program 1 times [2023-12-02 14:22:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:22:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045721837] [2023-12-02 14:22:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:12,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:22:12,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:22:12,586 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:22:12,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-02 14:22:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:12,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 14:22:12,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:13,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:22:13,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:22:13,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 14:22:13,726 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 [2023-12-02 14:22:14,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:22:14,166 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 [2023-12-02 14:22:14,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:22:14,279 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 [2023-12-02 14:22:14,359 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 [2023-12-02 14:22:14,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:22:14,682 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 [2023-12-02 14:22:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2023-12-02 14:22:14,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:22:14,810 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:22:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045721837] [2023-12-02 14:22:14,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045721837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:22:14,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:22:14,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-02 14:22:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748024842] [2023-12-02 14:22:14,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:22:14,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 14:22:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:22:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 14:22:14,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-02 14:22:14,812 INFO L87 Difference]: Start difference. First operand 489 states and 705 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 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) [2023-12-02 14:22:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:22:20,059 INFO L93 Difference]: Finished difference Result 877 states and 1265 transitions. [2023-12-02 14:22:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 14:22:20,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 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 146 [2023-12-02 14:22:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:22:20,062 INFO L225 Difference]: With dead ends: 877 [2023-12-02 14:22:20,062 INFO L226 Difference]: Without dead ends: 568 [2023-12-02 14:22:20,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2023-12-02 14:22:20,064 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 641 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:22:20,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 809 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1291 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2023-12-02 14:22:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2023-12-02 14:22:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 486. [2023-12-02 14:22:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 415 states have (on average 1.4313253012048193) internal successors, (594), 417 states have internal predecessors, (594), 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) [2023-12-02 14:22:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 702 transitions. [2023-12-02 14:22:20,163 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 702 transitions. Word has length 146 [2023-12-02 14:22:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:22:20,163 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 702 transitions. [2023-12-02 14:22:20,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 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) [2023-12-02 14:22:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 702 transitions. [2023-12-02 14:22:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:22:20,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:22:20,165 INFO L195 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] [2023-12-02 14:22:20,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-02 14:22:20,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:22:20,366 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:22:20,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:22:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1088857033, now seen corresponding path program 1 times [2023-12-02 14:22:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:22:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509382558] [2023-12-02 14:22:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:20,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:22:20,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:22:20,367 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:22:20,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-02 14:22:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:20,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:22:20,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-02 14:22:20,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:22:20,596 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:22:20,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509382558] [2023-12-02 14:22:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509382558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:22:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:22:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:22:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134354212] [2023-12-02 14:22:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:22:20,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:22:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:22:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:22:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:22:20,597 INFO L87 Difference]: Start difference. First operand 486 states and 702 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:22:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:22:20,721 INFO L93 Difference]: Finished difference Result 837 states and 1213 transitions. [2023-12-02 14:22:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:22:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 146 [2023-12-02 14:22:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:22:20,724 INFO L225 Difference]: With dead ends: 837 [2023-12-02 14:22:20,724 INFO L226 Difference]: Without dead ends: 531 [2023-12-02 14:22:20,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:22:20,725 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 54 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:22:20,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 631 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:22:20,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-12-02 14:22:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 495. [2023-12-02 14:22:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 424 states have (on average 1.4221698113207548) internal successors, (603), 426 states have internal predecessors, (603), 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) [2023-12-02 14:22:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 711 transitions. [2023-12-02 14:22:20,786 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 711 transitions. Word has length 146 [2023-12-02 14:22:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:22:20,786 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 711 transitions. [2023-12-02 14:22:20,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:22:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 711 transitions. [2023-12-02 14:22:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:22:20,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:22:20,788 INFO L195 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] [2023-12-02 14:22:20,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-02 14:22:20,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:22:20,988 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:22:20,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:22:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash -343403950, now seen corresponding path program 1 times [2023-12-02 14:22:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:22:20,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854474762] [2023-12-02 14:22:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:20,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:22:20,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:22:20,990 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:22:20,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-02 14:22:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:21,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:22:21,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:21,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:22:21,257 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 40 treesize of output 16 [2023-12-02 14:22:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-02 14:22:21,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:22:21,289 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:22:21,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854474762] [2023-12-02 14:22:21,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854474762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:22:21,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:22:21,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:22:21,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774584658] [2023-12-02 14:22:21,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:22:21,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:22:21,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:22:21,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:22:21,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:22:21,291 INFO L87 Difference]: Start difference. First operand 495 states and 711 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:22:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:22:22,182 INFO L93 Difference]: Finished difference Result 1158 states and 1665 transitions. [2023-12-02 14:22:22,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:22:22,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 146 [2023-12-02 14:22:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:22:22,186 INFO L225 Difference]: With dead ends: 1158 [2023-12-02 14:22:22,186 INFO L226 Difference]: Without dead ends: 843 [2023-12-02 14:22:22,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:22:22,187 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 215 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:22:22,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 474 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 14:22:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2023-12-02 14:22:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 502. [2023-12-02 14:22:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 431 states have (on average 1.4245939675174013) internal successors, (614), 433 states have internal predecessors, (614), 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) [2023-12-02 14:22:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 722 transitions. [2023-12-02 14:22:22,256 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 722 transitions. Word has length 146 [2023-12-02 14:22:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:22:22,256 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 722 transitions. [2023-12-02 14:22:22,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:22:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 722 transitions. [2023-12-02 14:22:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:22:22,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:22:22,258 INFO L195 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] [2023-12-02 14:22:22,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-02 14:22:22,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:22:22,458 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:22:22,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:22:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -601569388, now seen corresponding path program 1 times [2023-12-02 14:22:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:22:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290831885] [2023-12-02 14:22:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:22,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:22:22,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:22:22,460 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:22:22,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-02 14:22:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:22,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 14:22:22,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:22,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:22:23,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:22:24,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:22:24,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:22:24,828 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 [2023-12-02 14:22:26,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:22:26,234 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 87 treesize of output 61 [2023-12-02 14:22:26,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:22:26,316 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 87 treesize of output 61 [2023-12-02 14:22:26,436 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 76 treesize of output 66 [2023-12-02 14:22:26,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:22:26,811 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 109 treesize of output 55 [2023-12-02 14:22:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 444 proven. 42 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-12-02 14:22:27,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:22:27,434 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_945))) (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 (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))))))) is different from false [2023-12-02 14:22:27,492 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_943 (_ BitVec 32)) (v_ArrVal_945 (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_943)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_945))) (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 (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))))))) is different from false [2023-12-02 14:22:27,578 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_943 (_ BitVec 32)) (v_ArrVal_942 (_ BitVec 32)) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 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|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)) v_ArrVal_942) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_943)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_945))) (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 (bvneg .cse0) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))))))) is different from false [2023-12-02 14:22:28,590 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:22:28,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290831885] [2023-12-02 14:22:28,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290831885] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:22:28,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [366699145] [2023-12-02 14:22:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:28,590 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:22:28,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:22:28,591 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:22:28,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 14:22:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:29,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 14:22:29,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:29,389 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 27 treesize of output 13 [2023-12-02 14:22:30,328 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 [2023-12-02 14:22:31,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:22:33,426 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2023-12-02 14:22:33,427 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 87 treesize of output 69 [2023-12-02 14:22:34,068 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2023-12-02 14:22:34,068 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 132 treesize of output 118 [2023-12-02 14:22:34,989 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 14:22:34,989 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 177 treesize of output 165 [2023-12-02 14:22:35,092 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 31 treesize of output 27 [2023-12-02 14:22:37,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:22:37,646 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 329 treesize of output 305 [2023-12-02 14:22:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 257 proven. 6 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-12-02 14:22:59,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:22:59,668 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_980))) (let ((.cse1 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 ((_ 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 .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (bvslt .cse0 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse2))) (not (let ((.cse3 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse3 .cse0) .cse3))) (not (bvsgt .cse2 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2023-12-02 14:22:59,755 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_979 (_ BitVec 32)) (v_ArrVal_980 (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_979)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_980))) (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 [2023-12-02 14:22:59,838 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_979 (_ BitVec 32)) (v_ArrVal_976 (_ BitVec 32)) (v_ArrVal_980 (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_976) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_979)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_980))) (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 [2023-12-02 14:23:02,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [366699145] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:23:02,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682454083] [2023-12-02 14:23:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:23:02,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:23:02,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:23:02,148 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:23:02,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 14:23:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:23:02,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 14:23:02,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:23:02,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:23:04,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-02 14:23:15,642 WARN L293 SmtUtils]: Spent 8.35s 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) [2023-12-02 14:23:15,642 INFO L349 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2023-12-02 14:23:15,642 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 [2023-12-02 14:23:18,638 INFO L349 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2023-12-02 14:23:18,638 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 137 treesize of output 103 [2023-12-02 14:23:19,679 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 14:23:19,680 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 168 treesize of output 152 [2023-12-02 14:23:19,833 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 38 treesize of output 34 [2023-12-02 14:23:22,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:23:22,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 306 treesize of output 252 [2023-12-02 14:23:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-02 14:23:23,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:23:24,982 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1013))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (bvslt .cse1 (let ((.cse2 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))))))) is different from false [2023-12-02 14:23:25,050 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1011 (_ 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_1011)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1013))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (bvslt .cse0 (let ((.cse1 (select .cse2 |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))))))))) (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 [2023-12-02 14:23:25,110 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1011 (_ BitVec 32)) (v_ArrVal_1010 (_ BitVec 32))) (let ((.cse3 (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_1010) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1011)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1013))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (bvslt .cse1 (let ((.cse2 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (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| (_ bv4 32))))))))))))) is different from false [2023-12-02 14:23:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682454083] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:23:37,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:23:37,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 67 [2023-12-02 14:23:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531313513] [2023-12-02 14:23:37,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:23:37,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-02 14:23:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:23:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-02 14:23:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=6908, Unknown=43, NotChecked=1620, Total=9312 [2023-12-02 14:23:37,191 INFO L87 Difference]: Start difference. First operand 502 states and 722 transitions. Second operand has 68 states, 60 states have (on average 2.933333333333333) internal successors, (176), 62 states have internal predecessors, (176), 16 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (57), 12 states have call predecessors, (57), 16 states have call successors, (57) [2023-12-02 14:23:39,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:23:44,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:23:47,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:23:50,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:24:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:24:23,458 INFO L93 Difference]: Finished difference Result 1034 states and 1475 transitions. [2023-12-02 14:24:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 14:24:23,459 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 60 states have (on average 2.933333333333333) internal successors, (176), 62 states have internal predecessors, (176), 16 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (57), 12 states have call predecessors, (57), 16 states have call successors, (57) Word has length 146 [2023-12-02 14:24:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:24:23,462 INFO L225 Difference]: With dead ends: 1034 [2023-12-02 14:24:23,462 INFO L226 Difference]: Without dead ends: 713 [2023-12-02 14:24:23,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 425 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 5179 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=2115, Invalid=14390, Unknown=43, NotChecked=2358, Total=18906 [2023-12-02 14:24:23,466 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 1731 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 5172 mSolverCounterSat, 274 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 5450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 5172 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:24:23,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 2301 Invalid, 5450 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [274 Valid, 5172 Invalid, 4 Unknown, 0 Unchecked, 32.7s Time] [2023-12-02 14:24:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2023-12-02 14:24:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 524. [2023-12-02 14:24:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 452 states have (on average 1.4292035398230087) internal successors, (646), 454 states have internal predecessors, (646), 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) [2023-12-02 14:24:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 754 transitions. [2023-12-02 14:24:23,538 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 754 transitions. Word has length 146 [2023-12-02 14:24:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:24:23,539 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 754 transitions. [2023-12-02 14:24:23,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 60 states have (on average 2.933333333333333) internal successors, (176), 62 states have internal predecessors, (176), 16 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (57), 12 states have call predecessors, (57), 16 states have call successors, (57) [2023-12-02 14:24:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 754 transitions. [2023-12-02 14:24:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:24:23,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:24:23,540 INFO L195 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] [2023-12-02 14:24:23,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 14:24:23,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-02 14:24:23,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 14:24:24,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:24:24,141 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:24:24,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:24:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1354521200, now seen corresponding path program 1 times [2023-12-02 14:24:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:24:24,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875264705] [2023-12-02 14:24:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:24:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:24:24,143 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:24:24,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-02 14:24:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:24,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 14:24:24,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:24,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:24:26,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:24:27,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:24:28,403 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 [2023-12-02 14:24:29,083 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 44 treesize of output 42 [2023-12-02 14:24:31,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:24:31,685 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 71 treesize of output 66 [2023-12-02 14:24:32,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:24:32,056 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 75 treesize of output 64 [2023-12-02 14:24:32,268 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 64 treesize of output 56 [2023-12-02 14:24:33,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:24:33,692 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 116 treesize of output 56 [2023-12-02 14:24:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 464 proven. 48 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-12-02 14:24:34,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:24:36,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1050))) (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 [2023-12-02 14:24:36,506 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (_ BitVec 32)) (v_ArrVal_1050 (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_1048)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1050))) (let ((.cse2 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 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) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))))) ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))))) is different from false [2023-12-02 14:24:36,588 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (_ BitVec 32)) (v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse3 (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_1048)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1050))) (let ((.cse0 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) .cse2))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) .cse2))))))) is different from false [2023-12-02 14:24:36,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (_ BitVec 32)) (v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))) (let ((.cse3 (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) ((_ 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_1048)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1050))) (let ((.cse0 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) .cse2))) (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))) .cse2))))))) is different from false [2023-12-02 14:24:37,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:24:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875264705] [2023-12-02 14:24:37,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875264705] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:24:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [319727081] [2023-12-02 14:24:37,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:24:37,651 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:24:37,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:24:37,652 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:24:37,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 14:24:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:24:38,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 14:24:38,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:24:38,613 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 27 treesize of output 13 [2023-12-02 14:24:40,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:24:41,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 14:24:43,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-12-02 14:24:45,647 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 48 treesize of output 49 [2023-12-02 14:24:50,997 INFO L349 Elim1Store]: treesize reduction 69, result has 17.9 percent of original size [2023-12-02 14:24:50,998 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 91 treesize of output 94 [2023-12-02 14:24:52,511 INFO L349 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2023-12-02 14:24:52,511 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 125 treesize of output 108 [2023-12-02 14:24:53,675 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 14:24:53,675 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 135 treesize of output 117 [2023-12-02 14:24:53,797 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 [2023-12-02 14:24:56,735 INFO L349 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2023-12-02 14:24:56,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 245 treesize of output 157 [2023-12-02 14:24:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 385 proven. 21 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2023-12-02 14:24:56,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:24:58,742 WARN L854 $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 ((.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| (_ 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 (bvneg .cse2) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))))) (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) .cse2)))))) is different from false [2023-12-02 14:25:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [319727081] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:25:05,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752038069] [2023-12-02 14:25:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:25:05,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:25:05,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:25:05,699 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:25:05,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 14:25:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:25:05,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 14:25:05,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:25:06,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:25:09,553 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 [2023-12-02 14:25:12,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:25:12,884 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 [2023-12-02 14:25:16,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:25:16,416 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 61 treesize of output 45 [2023-12-02 14:25:20,962 INFO L349 Elim1Store]: treesize reduction 63, result has 21.3 percent of original size [2023-12-02 14:25:20,962 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 88 treesize of output 90 [2023-12-02 14:25:22,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:25:22,502 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 104 treesize of output 75 [2023-12-02 14:25:23,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 71 [2023-12-02 14:25:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 375 proven. 27 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2023-12-02 14:25:25,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:25:26,998 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1125) |c_~#unsigned_char_Array_0~0.base|))) (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32)))))))) is different from false [2023-12-02 14:25:34,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752038069] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:25:34,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:25:34,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 25] total 86 [2023-12-02 14:25:34,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757539394] [2023-12-02 14:25:34,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:25:34,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2023-12-02 14:25:34,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:25:34,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2023-12-02 14:25:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1071, Invalid=12496, Unknown=29, NotChecked=1410, Total=15006 [2023-12-02 14:25:34,228 INFO L87 Difference]: Start difference. First operand 524 states and 754 transitions. Second operand has 87 states, 76 states have (on average 2.6578947368421053) internal successors, (202), 80 states have internal predecessors, (202), 23 states have call successors, (57), 15 states have call predecessors, (57), 23 states have return successors, (57), 16 states have call predecessors, (57), 23 states have call successors, (57) [2023-12-02 14:25:37,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:25:42,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:25:45,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:25:49,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:27:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:27:26,926 INFO L93 Difference]: Finished difference Result 1382 states and 1964 transitions. [2023-12-02 14:27:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-12-02 14:27:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 76 states have (on average 2.6578947368421053) internal successors, (202), 80 states have internal predecessors, (202), 23 states have call successors, (57), 15 states have call predecessors, (57), 23 states have return successors, (57), 16 states have call predecessors, (57), 23 states have call successors, (57) Word has length 146 [2023-12-02 14:27:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:27:26,931 INFO L225 Difference]: With dead ends: 1382 [2023-12-02 14:27:26,931 INFO L226 Difference]: Without dead ends: 1059 [2023-12-02 14:27:26,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 208 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 12223 ImplicationChecksByTransitivity, 97.9s TimeCoverageRelationStatistics Valid=5040, Invalid=36367, Unknown=29, NotChecked=2454, Total=43890 [2023-12-02 14:27:26,936 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 4299 mSDsluCounter, 5750 mSDsCounter, 0 mSdLazyCounter, 10945 mSolverCounterSat, 663 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4299 SdHoareTripleChecker+Valid, 5916 SdHoareTripleChecker+Invalid, 11612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 10945 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:27:26,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4299 Valid, 5916 Invalid, 11612 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [663 Valid, 10945 Invalid, 4 Unknown, 0 Unchecked, 63.6s Time] [2023-12-02 14:27:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2023-12-02 14:27:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 539. [2023-12-02 14:27:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 467 states have (on average 1.4346895074946466) internal successors, (670), 469 states have internal predecessors, (670), 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) [2023-12-02 14:27:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 778 transitions. [2023-12-02 14:27:27,013 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 778 transitions. Word has length 146 [2023-12-02 14:27:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:27:27,013 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 778 transitions. [2023-12-02 14:27:27,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 76 states have (on average 2.6578947368421053) internal successors, (202), 80 states have internal predecessors, (202), 23 states have call successors, (57), 15 states have call predecessors, (57), 23 states have return successors, (57), 16 states have call predecessors, (57), 23 states have call successors, (57) [2023-12-02 14:27:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 778 transitions. [2023-12-02 14:27:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:27:27,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:27:27,015 INFO L195 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] [2023-12-02 14:27:27,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-12-02 14:27:27,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-02 14:27:27,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 14:27:27,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:27:27,616 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:27:27,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:27:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 275856468, now seen corresponding path program 1 times [2023-12-02 14:27:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:27:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985296139] [2023-12-02 14:27:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:27:27,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:27:27,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:27:27,618 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:27:27,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-02 14:27:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:27:28,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 14:27:28,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:27:28,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:27:30,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:27:30,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 14:27:31,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:27:32,741 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 [2023-12-02 14:27:36,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:27:36,348 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 109 treesize of output 71 [2023-12-02 14:27:36,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:27:36,703 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 109 treesize of output 71 [2023-12-02 14:27:37,005 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 98 treesize of output 84 [2023-12-02 14:27:37,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:27:37,971 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 119 treesize of output 59 [2023-12-02 14:27:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 464 proven. 42 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-12-02 14:27:38,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:27:38,977 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1161))) (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 [2023-12-02 14:27:39,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (_ BitVec 32)) (v_ArrVal_1161 (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_1159)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1161))) (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 [2023-12-02 14:27:39,081 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1157 (_ BitVec 32)) (v_ArrVal_1159 (_ BitVec 32)) (v_ArrVal_1161 (Array (_ BitVec 32) (_ 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_1157) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1159)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1161))) (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 [2023-12-02 14:27:40,548 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:27:40,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985296139] [2023-12-02 14:27:40,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985296139] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:27:40,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1051260591] [2023-12-02 14:27:40,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:27:40,549 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:27:40,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:27:40,550 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:27:40,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 14:27:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:27:41,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 14:27:41,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:27:41,472 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 27 treesize of output 13 [2023-12-02 14:27:43,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:27:45,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2023-12-02 14:27:50,154 INFO L349 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2023-12-02 14:27:50,155 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 93 treesize of output 82 [2023-12-02 14:27:50,908 INFO L349 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2023-12-02 14:27:50,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 82 [2023-12-02 14:27:52,184 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 14:27:52,184 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 159 treesize of output 143 [2023-12-02 14:27:52,423 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 [2023-12-02 14:27:56,678 INFO L349 Elim1Store]: treesize reduction 6, result has 83.8 percent of original size [2023-12-02 14:27:56,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 256 treesize of output 214 [2023-12-02 14:27:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-02 14:27:58,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:28:01,486 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1196))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (or (not (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ 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))) (= ((_ zero_extend 24) ((_ extract 7 0) .cse2)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))))))))) is different from false [2023-12-02 14:28:01,612 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1195 (_ BitVec 32))) (let ((.cse3 (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_1195)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1196))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse0 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (or (not (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ 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))) (= ((_ zero_extend 24) ((_ extract 7 0) .cse2)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32)))))))))) is different from false [2023-12-02 14:28:01,734 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1195 (_ BitVec 32))) (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 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|) .cse2 ((_ 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_1195)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1196))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse1 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))) (not (let ((.cse3 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse3 .cse0) .cse3))) (not (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2023-12-02 14:28:01,806 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1195 (_ BitVec 32))) (let ((.cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 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|) .cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvadd (bvneg |c_ULTIMATE.start_step_#t~ite17#1|) ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem18#1|))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1195)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1196))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse1 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))) (not (let ((.cse3 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse3 .cse0) .cse3))) (not (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2023-12-02 14:28:01,879 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1195 (_ BitVec 32))) (let ((.cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv5 32))) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32)))) (let ((.cse5 (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 .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse6 .cse3)))) ((_ zero_extend 24) |c_ULTIMATE.start_step_#t~mem18#1|)))))) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1195)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1196))) (let ((.cse2 (select .cse5 |c_~#unsigned_char_Array_0~0.base|)) (.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse5 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (not (let ((.cse0 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse0 .cse1) .cse0))) (not (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse3))) ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))))) is different from false [2023-12-02 14:28:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1051260591] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:28:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891077780] [2023-12-02 14:28:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:09,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:28:09,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:28:09,309 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:28:09,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 14:28:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:09,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 14:28:09,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:28:09,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:28:13,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 14:28:18,567 INFO L349 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2023-12-02 14:28:18,567 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 84 treesize of output 68 [2023-12-02 14:28:25,962 WARN L293 SmtUtils]: Spent 6.35s 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) [2023-12-02 14:28:25,962 INFO L349 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2023-12-02 14:28:25,962 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 129 treesize of output 101 [2023-12-02 14:28:27,523 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 14:28:27,524 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 161 treesize of output 147 [2023-12-02 14:28:27,762 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 39 treesize of output 35 [2023-12-02 14:28:31,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:28:31,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 312 treesize of output 258 [2023-12-02 14:28:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-02 14:28:33,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:28:35,011 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1230))) (let ((.cse2 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvslt .cse0 (bvadd (bvneg .cse1) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)))))))) (not (let ((.cse3 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse3 .cse0) .cse3))) (not (bvsgt .cse1 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|)))))))) is different from false [2023-12-02 14:28:35,138 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1229 (_ 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_1229)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1230))) (let ((.cse2 (select .cse4 |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)))))) (.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (or (not (bvsgt .cse0 ((_ zero_extend 24) |ULTIMATE.start_property_#t~mem90#1|))) (not (bvslt .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse0)))) (not (let ((.cse3 ((_ zero_extend 24) c_~last_1_unsigned_char_Array_0_0__1_~0))) (bvsge (bvashr .cse3 .cse1) .cse3)))))))) is different from false [2023-12-02 14:28:35,242 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem90#1| (_ BitVec 8)) (v_ArrVal_1226 (_ BitVec 32)) (v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1229 (_ 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_1226) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1229)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1230))) (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 [2023-12-02 14:28:42,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891077780] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:28:42,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:28:42,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 21] total 73 [2023-12-02 14:28:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50496836] [2023-12-02 14:28:42,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:28:42,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-12-02 14:28:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:28:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-12-02 14:28:42,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=8697, Unknown=50, NotChecked=2222, Total=11772 [2023-12-02 14:28:42,999 INFO L87 Difference]: Start difference. First operand 539 states and 778 transitions. Second operand has 74 states, 66 states have (on average 2.772727272727273) internal successors, (183), 67 states have internal predecessors, (183), 16 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (57), 12 states have call predecessors, (57), 16 states have call successors, (57) [2023-12-02 14:28:45,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:50,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:53,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:55,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:30:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:30:01,141 INFO L93 Difference]: Finished difference Result 1173 states and 1683 transitions. [2023-12-02 14:30:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 14:30:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 66 states have (on average 2.772727272727273) internal successors, (183), 67 states have internal predecessors, (183), 16 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (57), 12 states have call predecessors, (57), 16 states have call successors, (57) Word has length 146 [2023-12-02 14:30:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:30:01,146 INFO L225 Difference]: With dead ends: 1173 [2023-12-02 14:30:01,146 INFO L226 Difference]: Without dead ends: 852 [2023-12-02 14:30:01,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 413 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 6664 ImplicationChecksByTransitivity, 78.7s TimeCoverageRelationStatistics Valid=2860, Invalid=20696, Unknown=50, NotChecked=3454, Total=27060 [2023-12-02 14:30:01,150 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 1847 mSDsluCounter, 3750 mSDsCounter, 0 mSdLazyCounter, 7732 mSolverCounterSat, 206 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 7942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 7732 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:30:01,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 3881 Invalid, 7942 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 7732 Invalid, 4 Unknown, 0 Unchecked, 45.6s Time] [2023-12-02 14:30:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2023-12-02 14:30:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 576. [2023-12-02 14:30:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 504 states have (on average 1.4464285714285714) internal successors, (729), 506 states have internal predecessors, (729), 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) [2023-12-02 14:30:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 837 transitions. [2023-12-02 14:30:01,226 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 837 transitions. Word has length 146 [2023-12-02 14:30:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:30:01,227 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 837 transitions. [2023-12-02 14:30:01,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 66 states have (on average 2.772727272727273) internal successors, (183), 67 states have internal predecessors, (183), 16 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (57), 12 states have call predecessors, (57), 16 states have call successors, (57) [2023-12-02 14:30:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 837 transitions. [2023-12-02 14:30:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:30:01,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:30:01,228 INFO L195 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] [2023-12-02 14:30:01,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 14:30:01,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-12-02 14:30:01,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 14:30:01,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:30:01,829 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:30:01,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:30:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash 400008400, now seen corresponding path program 1 times [2023-12-02 14:30:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:30:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948044364] [2023-12-02 14:30:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:01,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:30:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:30:01,831 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:30:01,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-02 14:30:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:02,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:30:02,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:02,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:30:02,150 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 40 treesize of output 16 [2023-12-02 14:30:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-02 14:30:02,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:30:02,214 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:30:02,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948044364] [2023-12-02 14:30:02,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948044364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:30:02,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:30:02,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:30:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560665400] [2023-12-02 14:30:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:30:02,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:30:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:30:02,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:30:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:30:02,215 INFO L87 Difference]: Start difference. First operand 576 states and 837 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:30:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:30:03,517 INFO L93 Difference]: Finished difference Result 914 states and 1324 transitions. [2023-12-02 14:30:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:30:03,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 146 [2023-12-02 14:30:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:30:03,522 INFO L225 Difference]: With dead ends: 914 [2023-12-02 14:30:03,522 INFO L226 Difference]: Without dead ends: 575 [2023-12-02 14:30:03,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:30:03,523 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 26 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:30:03,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 442 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 14:30:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2023-12-02 14:30:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 561. [2023-12-02 14:30:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 489 states have (on average 1.4396728016359919) internal successors, (704), 491 states have internal predecessors, (704), 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) [2023-12-02 14:30:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 812 transitions. [2023-12-02 14:30:03,614 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 812 transitions. Word has length 146 [2023-12-02 14:30:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:30:03,615 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 812 transitions. [2023-12-02 14:30:03,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:30:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 812 transitions. [2023-12-02 14:30:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:30:03,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:30:03,616 INFO L195 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] [2023-12-02 14:30:03,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2023-12-02 14:30:03,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:30:03,817 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:30:03,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:30:03,817 INFO L85 PathProgramCache]: Analyzing trace with hash -539529774, now seen corresponding path program 1 times [2023-12-02 14:30:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:30:03,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846575795] [2023-12-02 14:30:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:03,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:30:03,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:30:03,818 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:30:03,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-02 14:30:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:04,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 14:30:04,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:05,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:30:05,621 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 26 treesize of output 25 [2023-12-02 14:30:06,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:30:06,569 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 47 treesize of output 43 [2023-12-02 14:30:07,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:30:07,819 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 71 treesize of output 49 [2023-12-02 14:30:08,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:30:08,017 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 71 treesize of output 49 [2023-12-02 14:30:08,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2023-12-02 14:30:08,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:30:08,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 72 treesize of output 30 [2023-12-02 14:30:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 286 proven. 15 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2023-12-02 14:30:08,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:09,169 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1291 (_ BitVec 32)) (v_ArrVal_1288 (_ BitVec 32))) (not (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)) v_ArrVal_1288) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_1291)) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1292) |c_~#unsigned_char_Array_0~0.base|))) (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) is different from false [2023-12-02 14:30:09,438 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:30:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846575795] [2023-12-02 14:30:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846575795] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:30:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [81789047] [2023-12-02 14:30:09,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:09,439 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:30:09,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:30:09,440 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:30:09,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-12-02 14:30:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:10,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 14:30:10,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:10,257 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 27 treesize of output 13 [2023-12-02 14:30:12,170 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 [2023-12-02 14:30:13,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-12-02 14:30:15,004 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 [2023-12-02 14:30:16,681 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 48 treesize of output 49 [2023-12-02 14:30:21,046 INFO L349 Elim1Store]: treesize reduction 69, result has 17.9 percent of original size [2023-12-02 14:30:21,046 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 [2023-12-02 14:30:22,411 INFO L349 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2023-12-02 14:30:22,411 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 117 treesize of output 104 [2023-12-02 14:30:23,656 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 14:30:23,657 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 157 treesize of output 135 [2023-12-02 14:30:23,783 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 50 treesize of output 44 [2023-12-02 14:30:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 440 proven. 21 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2023-12-02 14:30:26,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:28,248 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1330))) (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 (bvsgt .cse2 ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))) (bvslt .cse1 (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg .cse2)))))))) is different from false [2023-12-02 14:30:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [81789047] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:30:34,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639511969] [2023-12-02 14:30:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:30:34,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:30:34,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:30:34,123 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:30:34,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-12-02 14:30:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:30:34,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 14:30:34,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:30:34,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:30:37,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 14:30:39,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:30:39,299 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 40 treesize of output 27 [2023-12-02 14:30:41,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:30:41,395 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 51 treesize of output 41 [2023-12-02 14:30:47,979 INFO L349 Elim1Store]: treesize reduction 63, result has 21.3 percent of original size [2023-12-02 14:30:47,980 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 79 treesize of output 87 [2023-12-02 14:30:49,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:30:49,129 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 100 treesize of output 71 [2023-12-02 14:30:49,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2023-12-02 14:30:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 375 proven. 27 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2023-12-02 14:30:51,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:30:52,234 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_1368) |c_~#unsigned_char_Array_0~0.base|))) (bvsgt ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv4 32))))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv3 32))))))))) is different from false [2023-12-02 14:30:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639511969] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:30:58,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:30:58,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 31, 24] total 69 [2023-12-02 14:30:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627399959] [2023-12-02 14:30:58,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:30:58,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-12-02 14:30:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:30:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-12-02 14:30:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=7890, Unknown=58, NotChecked=570, Total=9702 [2023-12-02 14:30:58,734 INFO L87 Difference]: Start difference. First operand 561 states and 812 transitions. Second operand has 70 states, 61 states have (on average 3.1147540983606556) internal successors, (190), 65 states have internal predecessors, (190), 21 states have call successors, (57), 13 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 21 states have call successors, (57) [2023-12-02 14:31:01,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:31:06,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:31:09,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:31:12,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:32:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:32:07,023 INFO L93 Difference]: Finished difference Result 1291 states and 1833 transitions. [2023-12-02 14:32:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-12-02 14:32:07,025 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 61 states have (on average 3.1147540983606556) internal successors, (190), 65 states have internal predecessors, (190), 21 states have call successors, (57), 13 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 21 states have call successors, (57) Word has length 146 [2023-12-02 14:32:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:32:07,030 INFO L225 Difference]: With dead ends: 1291 [2023-12-02 14:32:07,030 INFO L226 Difference]: Without dead ends: 966 [2023-12-02 14:32:07,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 422 SyntacticMatches, 3 SemanticMatches, 157 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8558 ImplicationChecksByTransitivity, 53.5s TimeCoverageRelationStatistics Valid=3309, Invalid=20824, Unknown=59, NotChecked=930, Total=25122 [2023-12-02 14:32:07,034 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2236 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 6911 mSolverCounterSat, 454 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2256 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 7369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 6911 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:32:07,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2256 Valid, 2632 Invalid, 7369 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [454 Valid, 6911 Invalid, 4 Unknown, 0 Unchecked, 48.0s Time] [2023-12-02 14:32:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-12-02 14:32:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 581. [2023-12-02 14:32:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 509 states have (on average 1.4420432220039292) internal successors, (734), 511 states have internal predecessors, (734), 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) [2023-12-02 14:32:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 842 transitions. [2023-12-02 14:32:07,130 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 842 transitions. Word has length 146 [2023-12-02 14:32:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:32:07,131 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 842 transitions. [2023-12-02 14:32:07,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 61 states have (on average 3.1147540983606556) internal successors, (190), 65 states have internal predecessors, (190), 21 states have call successors, (57), 13 states have call predecessors, (57), 21 states have return successors, (57), 15 states have call predecessors, (57), 21 states have call successors, (57) [2023-12-02 14:32:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 842 transitions. [2023-12-02 14:32:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:32:07,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:32:07,132 INFO L195 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] [2023-12-02 14:32:07,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-12-02 14:32:07,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2023-12-02 14:32:07,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-12-02 14:32:07,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:32:07,733 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:32:07,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:32:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1550647024, now seen corresponding path program 1 times [2023-12-02 14:32:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:32:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102137248] [2023-12-02 14:32:07,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:07,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:32:07,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:32:07,735 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:32:07,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-12-02 14:32:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:07,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:32:07,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:08,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:32:08,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2023-12-02 14:32:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-02 14:32:08,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:32:08,297 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:32:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102137248] [2023-12-02 14:32:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102137248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:32:08,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:32:08,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:32:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245724644] [2023-12-02 14:32:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:32:08,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:32:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:32:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:32:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:32:08,299 INFO L87 Difference]: Start difference. First operand 581 states and 842 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:32:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:32:10,513 INFO L93 Difference]: Finished difference Result 1188 states and 1714 transitions. [2023-12-02 14:32:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:32:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 146 [2023-12-02 14:32:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:32:10,518 INFO L225 Difference]: With dead ends: 1188 [2023-12-02 14:32:10,518 INFO L226 Difference]: Without dead ends: 844 [2023-12-02 14:32:10,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:32:10,520 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 141 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:32:10,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 477 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-02 14:32:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2023-12-02 14:32:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 581. [2023-12-02 14:32:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 509 states have (on average 1.4341846758349706) internal successors, (730), 511 states have internal predecessors, (730), 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) [2023-12-02 14:32:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 838 transitions. [2023-12-02 14:32:10,610 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 838 transitions. Word has length 146 [2023-12-02 14:32:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:32:10,610 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 838 transitions. [2023-12-02 14:32:10,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:32:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 838 transitions. [2023-12-02 14:32:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:32:10,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:32:10,612 INFO L195 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] [2023-12-02 14:32:10,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Ended with exit code 0 [2023-12-02 14:32:10,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:32:10,813 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:32:10,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:32:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash 596061520, now seen corresponding path program 1 times [2023-12-02 14:32:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:32:10,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705373355] [2023-12-02 14:32:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:32:10,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:32:10,814 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:32:10,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-02 14:32:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:11,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:32:11,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:11,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:32:11,128 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 [2023-12-02 14:32:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-02 14:32:11,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:32:11,220 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:32:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705373355] [2023-12-02 14:32:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705373355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:32:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:32:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:32:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744348545] [2023-12-02 14:32:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:32:11,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:32:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:32:11,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:32:11,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:32:11,222 INFO L87 Difference]: Start difference. First operand 581 states and 838 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:32:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:32:13,020 INFO L93 Difference]: Finished difference Result 942 states and 1360 transitions. [2023-12-02 14:32:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:32:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 146 [2023-12-02 14:32:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:32:13,024 INFO L225 Difference]: With dead ends: 942 [2023-12-02 14:32:13,025 INFO L226 Difference]: Without dead ends: 582 [2023-12-02 14:32:13,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:32:13,026 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 20 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:32:13,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 469 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 14:32:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2023-12-02 14:32:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 581. [2023-12-02 14:32:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 509 states have (on average 1.4302554027504912) internal successors, (728), 511 states have internal predecessors, (728), 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) [2023-12-02 14:32:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 836 transitions. [2023-12-02 14:32:13,113 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 836 transitions. Word has length 146 [2023-12-02 14:32:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:32:13,113 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 836 transitions. [2023-12-02 14:32:13,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2023-12-02 14:32:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 836 transitions. [2023-12-02 14:32:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 14:32:13,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:32:13,115 INFO L195 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] [2023-12-02 14:32:13,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2023-12-02 14:32:13,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:32:13,315 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:32:13,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:32:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash 462048014, now seen corresponding path program 1 times [2023-12-02 14:32:13,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:32:13,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570832733] [2023-12-02 14:32:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:32:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:32:13,317 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:32:13,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-02 14:32:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:13,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-02 14:32:13,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:13,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:32:14,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:32:15,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-12-02 14:32:16,600 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 47 treesize of output 30 [2023-12-02 14:32:17,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:32:17,769 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 53 treesize of output 54 [2023-12-02 14:32:18,866 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 63 treesize of output 67 [2023-12-02 14:32:23,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:32:23,869 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 132 treesize of output 109 [2023-12-02 14:32:24,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:32:24,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 156 treesize of output 74 [2023-12-02 14:32:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 471 proven. 54 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-02 14:32:24,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:32:29,957 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:32:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570832733] [2023-12-02 14:32:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570832733] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:32:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1379673331] [2023-12-02 14:32:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:32:29,958 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:32:29,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:32:29,959 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:32:29,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53ea8b9-4cd6-45ff-8927-4dc5ea2f0dac/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2023-12-02 14:32:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:32:30,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 14:32:30,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:32:31,087 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 27 treesize of output 13 [2023-12-02 14:32:33,385 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 [2023-12-02 14:32:35,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 17 [2023-12-02 14:32:36,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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