./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/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_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/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_5db76dd3-232a-4e89-a642-4baa32d48ba8/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 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:33:16,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:33:17,000 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 08:33:17,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:33:17,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:33:17,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:33:17,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:33:17,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:33:17,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:33:17,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:33:17,057 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:33:17,058 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:33:17,059 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:33:17,059 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:33:17,060 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:33:17,061 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:33:17,061 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:33:17,062 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:33:17,062 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:33:17,063 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:33:17,064 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:33:17,065 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:33:17,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:33:17,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:33:17,067 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:33:17,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:33:17,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:33:17,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:33:17,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:33:17,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:33:17,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:33:17,070 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:33:17,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:33:17,071 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:33:17,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:33:17,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:33:17,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:33:17,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:33:17,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:33:17,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:33:17,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:33:17,073 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:33:17,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:33:17,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:33:17,074 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:33:17,074 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:33:17,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:33:17,074 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_5db76dd3-232a-4e89-a642-4baa32d48ba8/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_5db76dd3-232a-4e89-a642-4baa32d48ba8/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 -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2023-12-02 08:33:17,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:33:17,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:33:17,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:33:17,358 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:33:17,359 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:33:17,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2023-12-02 08:33:20,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:33:20,510 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:33:20,510 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2023-12-02 08:33:20,518 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/data/b977f13d8/8be3868e21a845ddbec703ce49c3f526/FLAG62d03ebd6 [2023-12-02 08:33:20,532 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/data/b977f13d8/8be3868e21a845ddbec703ce49c3f526 [2023-12-02 08:33:20,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:33:20,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:33:20,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:33:20,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:33:20,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:33:20,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411cd385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20, skipping insertion in model container [2023-12-02 08:33:20,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,564 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:33:20,699 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_5db76dd3-232a-4e89-a642-4baa32d48ba8/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2023-12-02 08:33:20,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:33:20,726 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:33:20,737 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_5db76dd3-232a-4e89-a642-4baa32d48ba8/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2023-12-02 08:33:20,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:33:20,760 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:33:20,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20 WrapperNode [2023-12-02 08:33:20,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:33:20,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:33:20,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:33:20,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:33:20,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,790 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2023-12-02 08:33:20,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:33:20,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:33:20,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:33:20,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:33:20,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:33:20,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:33:20,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:33:20,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:33:20,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (1/1) ... [2023-12-02 08:33:20,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:33:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:33:20,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:33:20,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:33:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:33:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:33:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:33:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:33:20,964 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:33:20,967 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:33:21,093 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:33:21,144 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:33:21,144 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 08:33:21,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:33:21 BoogieIcfgContainer [2023-12-02 08:33:21,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:33:21,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:33:21,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:33:21,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:33:21,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:33:20" (1/3) ... [2023-12-02 08:33:21,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60844f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:33:21, skipping insertion in model container [2023-12-02 08:33:21,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:20" (2/3) ... [2023-12-02 08:33:21,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60844f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:33:21, skipping insertion in model container [2023-12-02 08:33:21,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:33:21" (3/3) ... [2023-12-02 08:33:21,158 INFO L112 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2023-12-02 08:33:21,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:33:21,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 08:33:21,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:33:21,232 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;@7d09fab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:33:21,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 08:33:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:33:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 08:33:21,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:33:21,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 08:33:21,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:33:21,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash 73372351, now seen corresponding path program 1 times [2023-12-02 08:33:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:33:21,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79401504] [2023-12-02 08:33:21,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:21,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:33:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:33:21,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:33:21,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79401504] [2023-12-02 08:33:21,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79401504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:33:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:33:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:33:21,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418054415] [2023-12-02 08:33:21,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:33:21,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 08:33:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:33:21,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 08:33:21,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 08:33:21,427 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:33:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:33:21,449 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-12-02 08:33:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 08:33:21,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 08:33:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:33:21,462 INFO L225 Difference]: With dead ends: 15 [2023-12-02 08:33:21,462 INFO L226 Difference]: Without dead ends: 7 [2023-12-02 08:33:21,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 08:33:21,471 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:33:21,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:33:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-12-02 08:33:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-12-02 08:33:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:33:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-12-02 08:33:21,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2023-12-02 08:33:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:33:21,507 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-12-02 08:33:21,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:33:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-12-02 08:33:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 08:33:21,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:33:21,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 08:33:21,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:33:21,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:33:21,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2044617620, now seen corresponding path program 1 times [2023-12-02 08:33:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:33:21,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878778935] [2023-12-02 08:33:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:21,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:33:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:33:21,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 08:33:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:33:21,597 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 08:33:21,598 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 08:33:21,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 08:33:21,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 08:33:21,604 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 08:33:21,607 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 08:33:21,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:33:21 BoogieIcfgContainer [2023-12-02 08:33:21,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 08:33:21,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 08:33:21,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 08:33:21,632 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 08:33:21,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:33:21" (3/4) ... [2023-12-02 08:33:21,634 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 08:33:21,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 08:33:21,637 INFO L158 Benchmark]: Toolchain (without parser) took 1100.59ms. Allocated memory is still 176.2MB. Free memory was 126.8MB in the beginning and 75.8MB in the end (delta: 51.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-12-02 08:33:21,637 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 176.2MB. Free memory was 141.7MB in the beginning and 141.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:33:21,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.43ms. Allocated memory is still 176.2MB. Free memory was 126.8MB in the beginning and 116.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 08:33:21,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.75ms. Allocated memory is still 176.2MB. Free memory was 115.7MB in the beginning and 114.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 08:33:21,639 INFO L158 Benchmark]: Boogie Preprocessor took 20.77ms. Allocated memory is still 176.2MB. Free memory was 114.2MB in the beginning and 113.6MB in the end (delta: 627.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:33:21,640 INFO L158 Benchmark]: RCFGBuilder took 333.59ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 101.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 08:33:21,641 INFO L158 Benchmark]: TraceAbstraction took 480.63ms. Allocated memory is still 176.2MB. Free memory was 100.4MB in the beginning and 76.5MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-02 08:33:21,642 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 176.2MB. Free memory was 76.5MB in the beginning and 75.8MB in the end (delta: 640.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:33:21,646 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.25ms. Allocated memory is still 176.2MB. Free memory was 141.7MB in the beginning and 141.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.43ms. Allocated memory is still 176.2MB. Free memory was 126.8MB in the beginning and 116.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.75ms. Allocated memory is still 176.2MB. Free memory was 115.7MB in the beginning and 114.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.77ms. Allocated memory is still 176.2MB. Free memory was 114.2MB in the beginning and 113.6MB in the end (delta: 627.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 333.59ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 101.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 480.63ms. Allocated memory is still 176.2MB. Free memory was 100.4MB in the beginning and 76.5MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 176.2MB. Free memory was 76.5MB in the beginning and 75.8MB in the end (delta: 640.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: 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 someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 32. Possible FailurePath: [L14] float pi = 3.14159 ; [L20] float x = __VERIFIER_nondet_float() ; [L21] float octant = pi/3 ; [L22] CALL assume_abort_if_not(x > octant && x < pi) [L10] COND FALSE !(!cond) [L22] RET assume_abort_if_not(x > octant && x < pi) [L23] float oddExp = x ; [L24] float evenExp = 1.0 ; [L25] float term = x ; [L26] unsigned int count = 2 ; [L27] int multFactor = 0 ; [L28] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=53, pi=314159/100000, term=53, x=53] [L30] COND TRUE 1 [L32] term = term * (x/count) [L33] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L35] evenExp = evenExp + multFactor*term [L37] count++ [L39] term = term * (x/count) [L41] oddExp = oddExp + multFactor*term [L43] count++ [L45] temp = __VERIFIER_nondet_int() [L46] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=53] [L49] CALL __VERIFIER_assert( oddExp >= evenExp ) [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L12] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 7 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 4 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-02 08:33:21,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/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_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/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_5db76dd3-232a-4e89-a642-4baa32d48ba8/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 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:33:23,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:33:23,799 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 08:33:23,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:33:23,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:33:23,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:33:23,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:33:23,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:33:23,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:33:23,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:33:23,845 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:33:23,846 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:33:23,846 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:33:23,847 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:33:23,847 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:33:23,848 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:33:23,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:33:23,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:33:23,851 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:33:23,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:33:23,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:33:23,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:33:23,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:33:23,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:33:23,854 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 08:33:23,855 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 08:33:23,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 08:33:23,856 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:33:23,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:33:23,857 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:33:23,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:33:23,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 08:33:23,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:33:23,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:33:23,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:33:23,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:33:23,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:33:23,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:33:23,861 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 08:33:23,861 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 08:33:23,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:33:23,862 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:33:23,862 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:33:23,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:33:23,862 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_5db76dd3-232a-4e89-a642-4baa32d48ba8/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_5db76dd3-232a-4e89-a642-4baa32d48ba8/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 -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2023-12-02 08:33:24,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:33:24,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:33:24,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:33:24,204 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:33:24,205 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:33:24,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2023-12-02 08:33:27,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:33:27,224 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:33:27,224 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2023-12-02 08:33:27,231 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/data/fcdc3369f/cdf8aa5273804ed782898bbaffab7f61/FLAG287a5531a [2023-12-02 08:33:27,245 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/data/fcdc3369f/cdf8aa5273804ed782898bbaffab7f61 [2023-12-02 08:33:27,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:33:27,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:33:27,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:33:27,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:33:27,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:33:27,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4c44f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27, skipping insertion in model container [2023-12-02 08:33:27,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,279 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:33:27,428 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_5db76dd3-232a-4e89-a642-4baa32d48ba8/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2023-12-02 08:33:27,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:33:27,465 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:33:27,477 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_5db76dd3-232a-4e89-a642-4baa32d48ba8/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2023-12-02 08:33:27,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:33:27,502 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:33:27,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27 WrapperNode [2023-12-02 08:33:27,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:33:27,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:33:27,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:33:27,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:33:27,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,542 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2023-12-02 08:33:27,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:33:27,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:33:27,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:33:27,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:33:27,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:33:27,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:33:27,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:33:27,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:33:27,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (1/1) ... [2023-12-02 08:33:27,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:33:27,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:33:27,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:33:27,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:33:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:33:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 08:33:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:33:27,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:33:27,723 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:33:27,725 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:33:30,732 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:33:30,771 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:33:30,771 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 08:33:30,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:33:30 BoogieIcfgContainer [2023-12-02 08:33:30,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:33:30,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:33:30,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:33:30,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:33:30,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:33:27" (1/3) ... [2023-12-02 08:33:30,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b350990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:33:30, skipping insertion in model container [2023-12-02 08:33:30,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:33:27" (2/3) ... [2023-12-02 08:33:30,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b350990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:33:30, skipping insertion in model container [2023-12-02 08:33:30,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:33:30" (3/3) ... [2023-12-02 08:33:30,788 INFO L112 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2023-12-02 08:33:30,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:33:30,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 08:33:30,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:33:30,853 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;@3a46d146, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:33:30,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 08:33:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:33:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 08:33:30,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:33:30,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:33:30,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:33:30,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash 515220282, now seen corresponding path program 1 times [2023-12-02 08:33:30,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:33:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170796983] [2023-12-02 08:33:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:30,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:33:30,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:33:30,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:33:30,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 08:33:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:31,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 08:33:31,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:33:31,033 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:33:31,033 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:33:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170796983] [2023-12-02 08:33:31,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170796983] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:33:31,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:33:31,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:33:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463084747] [2023-12-02 08:33:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:33:31,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 08:33:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:33:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 08:33:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 08:33:31,067 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:33:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:33:31,100 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2023-12-02 08:33:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 08:33:31,102 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 08:33:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:33:31,110 INFO L225 Difference]: With dead ends: 20 [2023-12-02 08:33:31,110 INFO L226 Difference]: Without dead ends: 9 [2023-12-02 08:33:31,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 08:33:31,118 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:33:31,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:33:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-02 08:33:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-02 08:33:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:33:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-12-02 08:33:31,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2023-12-02 08:33:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:33:31,154 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-12-02 08:33:31,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:33:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-12-02 08:33:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 08:33:31,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:33:31,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:33:31,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 08:33:31,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:33:31,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:33:31,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 568632303, now seen corresponding path program 1 times [2023-12-02 08:33:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:33:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882706709] [2023-12-02 08:33:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:31,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:33:31,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:33:31,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:33:31,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 08:33:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:45,979 WARN L260 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 08:33:45,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:20,264 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from false [2023-12-02 08:34:22,333 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from true [2023-12-02 08:35:13,367 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (.cse2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse2)))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse5) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| .cse5) (not (let ((.cse7 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse2)))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse0 .cse7))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse6))))))) is different from false [2023-12-02 08:35:30,898 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2023-12-02 08:35:32,966 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2023-12-02 08:35:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:35:32,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:35:32,967 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:35:32,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882706709] [2023-12-02 08:35:32,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882706709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:32,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:35:32,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:35:32,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074308376] [2023-12-02 08:35:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:32,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 08:35:32,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:35:32,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 08:35:32,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=13, Unknown=5, NotChecked=24, Total=56 [2023-12-02 08:35:32,971 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:35:37,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 08:35:39,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 08:35:41,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 08:35:43,926 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-02 08:35:47,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 08:35:49,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 08:35:51,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 08:35:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:51,931 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2023-12-02 08:35:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 08:35:52,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 08:35:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:52,227 INFO L225 Difference]: With dead ends: 15 [2023-12-02 08:35:52,227 INFO L226 Difference]: Without dead ends: 11 [2023-12-02 08:35:52,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=20, Invalid=20, Unknown=6, NotChecked=44, Total=90 [2023-12-02 08:35:52,229 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:52,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 6 Unknown, 50 Unchecked, 13.2s Time] [2023-12-02 08:35:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-02 08:35:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-02 08:35:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:35:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-02 08:35:52,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2023-12-02 08:35:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:52,236 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-02 08:35:52,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:35:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-02 08:35:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 08:35:52,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:52,237 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:52,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/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)] Forceful destruction successful, exit code 0 [2023-12-02 08:35:52,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:35:52,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:35:52,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1043471242, now seen corresponding path program 1 times [2023-12-02 08:35:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:35:52,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896645580] [2023-12-02 08:35:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:52,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:35:52,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:35:52,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 08:35:52,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 08:37:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:41,562 WARN L260 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 08:37:41,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:38:14,435 WARN L293 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:38:19,664 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:38:29,474 WARN L293 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:38:31,595 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse2) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-02 08:38:51,680 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:38:56,889 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:39:06,739 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:39:28,245 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from false [2023-12-02 08:39:30,351 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from true [2023-12-02 08:40:24,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (.cse3 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse8 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse5 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse3)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse9) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| .cse9) (let ((.cse13 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse11)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse3)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse0 .cse13)) (fp.mul roundNearestTiesToEven .cse0 .cse12)))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10))))))) is different from false [2023-12-02 08:40:43,441 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from false [2023-12-02 08:40:45,552 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from true [2023-12-02 08:40:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 08:40:45,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:41:10,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from false [2023-12-02 08:41:12,244 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from true [2023-12-02 08:41:35,215 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:41:40,404 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:41:50,171 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:42:00,083 WARN L293 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:42:08,528 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:42:11,999 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse12 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse9 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse12 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse9))))) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse7 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse10 .cse7)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse5 (fp.mul c_currentRoundingMode .cse10 .cse8))) (and (or .cse0 (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse12))) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse11))) (.cse1 (= (bvlshr .cse9 (_ bv1 32)) (_ bv0 32)))) (and (or .cse1 (fp.geq (fp.add c_currentRoundingMode .cse2 .cse3) (fp.add c_currentRoundingMode .cse4 .cse5))) (or (fp.geq (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse6 .cse7)) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 .cse8))) (not .cse1))))) (or (not .cse0) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse12)) .cse3) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse11)) .cse5))))))))) is different from false [2023-12-02 08:42:14,287 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse12 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse9 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse12 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse9))))) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse7 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse10 .cse7)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse5 (fp.mul c_currentRoundingMode .cse10 .cse8))) (and (or .cse0 (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse12))) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse11))) (.cse1 (= (bvlshr .cse9 (_ bv1 32)) (_ bv0 32)))) (and (or .cse1 (fp.geq (fp.add c_currentRoundingMode .cse2 .cse3) (fp.add c_currentRoundingMode .cse4 .cse5))) (or (fp.geq (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse6 .cse7)) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 .cse8))) (not .cse1))))) (or (not .cse0) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse12)) .cse3) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse11)) .cse5))))))))) is different from true [2023-12-02 08:42:20,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from false [2023-12-02 08:42:23,054 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from true [2023-12-02 08:42:34,540 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2023-12-02 08:42:36,723 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2023-12-02 08:42:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 08:42:36,724 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:42:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896645580] [2023-12-02 08:42:36,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896645580] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:42:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2139900530] [2023-12-02 08:42:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:42:36,724 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:42:36,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:42:36,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:42:36,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db76dd3-232a-4e89-a642-4baa32d48ba8/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-02 08:45:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:45:32,530 WARN L260 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 08:45:32,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:45:56,987 WARN L293 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:46:02,288 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:46:12,229 WARN L293 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:46:30,954 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:46:36,203 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:46:46,076 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:47:52,689 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 08:48:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 08:48:13,970 INFO L327 TraceCheckSpWp]: Computing backward predicates...