./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E --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 8967790177fc14e8157cff1ce1fb723d3ab55513216099f6dbb82db8bc4d5837 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:59:44,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:59:44,818 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:59:44,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:59:44,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:59:44,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:59:44,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:59:44,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:59:44,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:59:44,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:59:44,858 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:59:44,859 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:59:44,859 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:59:44,859 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:59:44,859 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:59:44,859 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:59:44,860 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:59:44,860 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:59:44,860 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:59:44,860 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:59:44,861 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:59:44,861 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:59:44,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:59:44,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:59:44,862 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:59:44,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:59:44,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:59:44,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:59:44,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:59:44,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:59:44,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:59:44,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:59:44,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:59:44,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:59:44,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:59:44,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:59:44,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:59:44,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:59:44,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:59:44,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:59:44,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:59:44,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:59:44,864 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:59:44,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:59:44,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:59:44,865 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:59:44,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:59:44,865 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E 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 -> 8967790177fc14e8157cff1ce1fb723d3ab55513216099f6dbb82db8bc4d5837 [2024-11-14 03:59:45,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:59:45,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:59:45,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:59:45,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:59:45,227 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:59:45,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c Unable to find full path for "g++" [2024-11-14 03:59:47,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:59:48,112 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:59:48,115 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c [2024-11-14 03:59:48,141 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/data/86cf7f272/4f1f43b9c2ff44f2a39faafd28904982/FLAG101e42a26 [2024-11-14 03:59:48,206 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/data/86cf7f272/4f1f43b9c2ff44f2a39faafd28904982 [2024-11-14 03:59:48,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:59:48,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:59:48,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:59:48,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:59:48,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:59:48,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c505f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48, skipping insertion in model container [2024-11-14 03:59:48,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:59:48,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c[570,583] [2024-11-14 03:59:48,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:59:48,504 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:59:48,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c[570,583] [2024-11-14 03:59:48,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:59:48,547 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:59:48,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48 WrapperNode [2024-11-14 03:59:48,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:59:48,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:59:48,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:59:48,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:59:48,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,592 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2024-11-14 03:59:48,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:59:48,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:59:48,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:59:48,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:59:48,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:59:48,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:59:48,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:59:48,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:59:48,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (1/1) ... [2024-11-14 03:59:48,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:59:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:59:48,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:59:48,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:59:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:59:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:59:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:59:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:59:48,818 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:59:48,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:59:48,988 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-14 03:59:48,988 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:59:49,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:59:49,056 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 03:59:49,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:59:49 BoogieIcfgContainer [2024-11-14 03:59:49,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:59:49,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:59:49,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:59:49,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:59:49,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:59:48" (1/3) ... [2024-11-14 03:59:49,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a6881a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:59:49, skipping insertion in model container [2024-11-14 03:59:49,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:48" (2/3) ... [2024-11-14 03:59:49,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a6881a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:59:49, skipping insertion in model container [2024-11-14 03:59:49,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:59:49" (3/3) ... [2024-11-14 03:59:49,070 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant.c [2024-11-14 03:59:49,091 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:59:49,093 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_biNewton_pseudoconstant.c that has 1 procedures, 8 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-14 03:59:49,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:59:49,198 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@549cb20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:59:49,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:59:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2024-11-14 03:59:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:59:49,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:49,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:59:49,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:59:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash 85267961, now seen corresponding path program 1 times [2024-11-14 03:59:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:59:49,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792250399] [2024-11-14 03:59:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:59:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:59:49,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:59:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:59:49,393 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:59:49,395 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:59:49,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 03:59:49,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:59:49,404 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 03:59:49,426 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:59:49,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:59:49 BoogieIcfgContainer [2024-11-14 03:59:49,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:59:49,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:59:49,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:59:49,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:59:49,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:59:49" (3/4) ... [2024-11-14 03:59:49,436 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:59:49,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:59:49,439 INFO L158 Benchmark]: Toolchain (without parser) took 1225.71ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 89.8MB in the end (delta: 39.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-14 03:59:49,440 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 167.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:59:49,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.04ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 118.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:59:49,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.65ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 116.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:59:49,441 INFO L158 Benchmark]: Boogie Preprocessor took 24.70ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 115.9MB in the end (delta: 969.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:59:49,442 INFO L158 Benchmark]: RCFGBuilder took 438.34ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 103.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:59:49,442 INFO L158 Benchmark]: TraceAbstraction took 370.60ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 89.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:59:49,443 INFO L158 Benchmark]: Witness Printer took 5.98ms. Allocated memory is still 167.8MB. Free memory was 89.9MB in the beginning and 89.8MB in the end (delta: 116.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:59:49,445 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 167.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.04ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 118.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.65ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 116.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.70ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 115.9MB in the end (delta: 969.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 438.34ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 103.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 370.60ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 89.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 5.98ms. Allocated memory is still 167.8MB. Free memory was 89.9MB in the beginning and 89.8MB in the end (delta: 116.5kB). 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: 13]: 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 someBinaryArithmeticDOUBLEoperation at line 21, overapproximation of someBinaryArithmeticDOUBLEoperation at line 38, overapproximation of someUnaryDOUBLEoperation at line 25, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 46. Possible FailurePath: [L15] double _EPS = 1e-6; [L43] double d, dd, r; [L44] double epsilon = 1e-8; [L46] d = 1. VAL [_EPS=1/1000000] [L46] COND TRUE d <= 20. [L48] dd = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L11] COND FALSE !(!cond) [L49] RET assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L51] CALL, EXPR SqrtR(dd) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; [L21] COND FALSE !(Input <= 1.0) [L21] xn = 1.0/Input [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 VAL [_EPS=1/1000000, cond=0, i=0] [L28] COND FALSE !(\read(cond)) [L38] return 1.0 / xnp1; [L51] RET, EXPR SqrtR(dd) [L51] r = SqrtR(dd) [L53] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L13] COND TRUE !(cond) VAL [_EPS=1/1000000] [L13] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 03:59:49,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E --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 8967790177fc14e8157cff1ce1fb723d3ab55513216099f6dbb82db8bc4d5837 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:59:52,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:59:53,037 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 03:59:53,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:59:53,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:59:53,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:59:53,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:59:53,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:59:53,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:59:53,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:59:53,097 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:59:53,098 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:59:53,099 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:59:53,099 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:59:53,099 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:59:53,099 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:59:53,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:59:53,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:59:53,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:59:53,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:59:53,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:59:53,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:59:53,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:59:53,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:59:53,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:59:53,102 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:59:53,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:59:53,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:59:53,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:59:53,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:59:53,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:59:53,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:59:53,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:59:53,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:59:53,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:59:53,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:59:53,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:59:53,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:59:53,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:59:53,104 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:59:53,104 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:59:53,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:59:53,104 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:59:53,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E 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 -> 8967790177fc14e8157cff1ce1fb723d3ab55513216099f6dbb82db8bc4d5837 [2024-11-14 03:59:53,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:59:53,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:59:53,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:59:53,511 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:59:53,512 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:59:53,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c Unable to find full path for "g++" [2024-11-14 03:59:55,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:59:55,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:59:55,978 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c [2024-11-14 03:59:55,992 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/data/dae2458b4/05cbcaf7745b4f6db37687ccd999daae/FLAGdfc9c96df [2024-11-14 03:59:56,026 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/data/dae2458b4/05cbcaf7745b4f6db37687ccd999daae [2024-11-14 03:59:56,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:59:56,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:59:56,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:59:56,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:59:56,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:59:56,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618ed480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56, skipping insertion in model container [2024-11-14 03:59:56,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:59:56,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c[570,583] [2024-11-14 03:59:56,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:59:56,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:59:56,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c[570,583] [2024-11-14 03:59:56,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:59:56,405 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:59:56,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56 WrapperNode [2024-11-14 03:59:56,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:59:56,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:59:56,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:59:56,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:59:56,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,463 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2024-11-14 03:59:56,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:59:56,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:59:56,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:59:56,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:59:56,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:59:56,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:59:56,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:59:56,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:59:56,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (1/1) ... [2024-11-14 03:59:56,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:59:56,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:59:56,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:59:56,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:59:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:59:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:59:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:59:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:59:56,702 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:59:56,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:00:06,717 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-14 04:00:06,717 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:00:06,734 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:00:06,735 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 04:00:06,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:00:06 BoogieIcfgContainer [2024-11-14 04:00:06,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:00:06,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:00:06,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:00:06,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:00:06,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:59:56" (1/3) ... [2024-11-14 04:00:06,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a6332d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:00:06, skipping insertion in model container [2024-11-14 04:00:06,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:59:56" (2/3) ... [2024-11-14 04:00:06,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a6332d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:00:06, skipping insertion in model container [2024-11-14 04:00:06,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:00:06" (3/3) ... [2024-11-14 04:00:06,752 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant.c [2024-11-14 04:00:06,772 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:00:06,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_biNewton_pseudoconstant.c that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-14 04:00:06,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:00:06,881 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c3469c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:00:06,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:00:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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) [2024-11-14 04:00:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:00:06,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:00:06,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:00:06,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:00:06,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:00:06,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1568240983, now seen corresponding path program 1 times [2024-11-14 04:00:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:00:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127336923] [2024-11-14 04:00:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:00:06,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:00:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:00:06,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:00:06,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 04:00:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:00:08,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 04:00:08,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:00:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:00:08,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:00:08,699 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:00:08,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127336923] [2024-11-14 04:00:08,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127336923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:00:08,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:00:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:00:08,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135612495] [2024-11-14 04:00:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:00:08,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:00:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:00:08,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:00:08,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:00:08,754 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2024-11-14 04:00:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:00:08,774 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2024-11-14 04:00:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:00:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-11-14 04:00:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:00:08,785 INFO L225 Difference]: With dead ends: 34 [2024-11-14 04:00:08,785 INFO L226 Difference]: Without dead ends: 14 [2024-11-14 04:00:08,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:00:08,792 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:00:08,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:00:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-14 04:00:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-14 04:00:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2024-11-14 04:00:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-14 04:00:08,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2024-11-14 04:00:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:00:08,833 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-14 04:00:08,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2024-11-14 04:00:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-14 04:00:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:00:08,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:00:08,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:00:08,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 04:00:09,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:00:09,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:00:09,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:00:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2050362027, now seen corresponding path program 1 times [2024-11-14 04:00:09,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:00:09,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674869939] [2024-11-14 04:00:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:00:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:00:09,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:00:09,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:00:09,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 04:00:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:00:10,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:00:10,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:00:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:00:12,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:00:12,045 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:00:12,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674869939] [2024-11-14 04:00:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674869939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:00:12,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:00:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:00:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820991524] [2024-11-14 04:00:12,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:00:12,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:00:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:00:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:00:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:00:12,049 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-14 04:00:15,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:17,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:19,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:21,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:23,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:25,968 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 [] [2024-11-14 04:00:27,976 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 [] [2024-11-14 04:00:31,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:33,135 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 [] [2024-11-14 04:00:35,142 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 [] [2024-11-14 04:00:37,152 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 [] [2024-11-14 04:00:39,158 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 [] [2024-11-14 04:00:41,160 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 [] [2024-11-14 04:00:43,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:44,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:46,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:00:47,467 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-14 04:00:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:00:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-14 04:00:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:00:47,475 INFO L225 Difference]: With dead ends: 28 [2024-11-14 04:00:47,475 INFO L226 Difference]: Without dead ends: 16 [2024-11-14 04:00:47,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:00:47,477 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:00:47,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 17 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 35.1s Time] [2024-11-14 04:00:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-14 04:00:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-14 04:00:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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) [2024-11-14 04:00:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-14 04:00:47,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2024-11-14 04:00:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:00:47,483 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-14 04:00:47,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-14 04:00:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-14 04:00:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:00:47,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:00:47,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:00:47,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 04:00:47,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:00:47,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:00:47,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:00:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash -275354665, now seen corresponding path program 1 times [2024-11-14 04:00:47,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:00:47,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800701403] [2024-11-14 04:00:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:00:47,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:00:47,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:00:47,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:00:47,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 04:00:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:00:50,981 WARN L253 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 04:00:50,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:11,734 WARN L851 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-14 04:02:08,718 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) (let ((.cse6 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3)) (.cse5 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))) (or (and (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse4 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse6 .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (not (fp.lt .cse2 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (not (fp.gt .cse2 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32))) (and (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse7 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode .cse6 (fp.add c_currentRoundingMode .cse7 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse8 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (let ((.cse9 (fp.add c_currentRoundingMode .cse8 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse6 .cse9) (fp.mul c_currentRoundingMode .cse3 .cse9))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-14 04:02:32,596 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (let ((.cse2 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (not (fp.lt .cse2 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (not (fp.gt .cse2 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-14 04:02:57,979 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse1 .cse1))) (let ((.cse2 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= (fp.div c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_SqrtR_#res#1|) (not (fp.lt .cse2 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (not (fp.gt .cse2 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-14 04:04:22,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse6 (fp.add roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (.cse7 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (and (or (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse3 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse4 .cse4))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse7 .cse2))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (not (fp.leq (fp.div roundNearestTiesToEven .cse3 .cse4) .cse5)) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3))))))) (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse10 (fp.div roundNearestTiesToEven .cse3 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse9 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse7 .cse9))) (and (not (fp.gt .cse8 (fp.mul roundNearestTiesToEven .cse1 .cse9))) (not (fp.lt .cse8 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6) (not (fp.geq (fp.div roundNearestTiesToEven .cse3 .cse10) .cse11)) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3)))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse15 (fp.div roundNearestTiesToEven .cse3 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse13 (fp.add roundNearestTiesToEven .cse15 .cse15))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse7 .cse13)) (.cse14 (fp.div roundNearestTiesToEven .cse3 .cse15))) (and (not (fp.gt .cse12 (fp.mul roundNearestTiesToEven .cse1 .cse13))) (not (fp.lt .cse12 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (fp.leq .cse14 .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3)) (fp.geq .cse14 .cse11)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2024-11-14 04:05:15,778 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.add roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse6 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse3 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse4 .cse4))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 .cse2))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (not (fp.leq (fp.div roundNearestTiesToEven .cse3 .cse4) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3))))))) (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse3 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.gt .cse7 (fp.mul roundNearestTiesToEven .cse1 .cse8))) (not (fp.lt .cse7 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.geq (fp.div roundNearestTiesToEven .cse3 .cse9) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3)))))))))) is different from false [2024-11-14 04:05:17,908 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.add roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse6 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse3 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse4 .cse4))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 .cse2))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (not (fp.leq (fp.div roundNearestTiesToEven .cse3 .cse4) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3))))))) (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_12| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse3 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.gt .cse7 (fp.mul roundNearestTiesToEven .cse1 .cse8))) (not (fp.lt .cse7 |v_ULTIMATE.start_SqrtR_~linf~0#1_12|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.geq (fp.div roundNearestTiesToEven .cse3 .cse9) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3)))))))))) is different from true [2024-11-14 04:05:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:05:17,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:05:17,909 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:05:17,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800701403] [2024-11-14 04:05:17,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800701403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:05:17,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:05:17,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 04:05:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798293510] [2024-11-14 04:05:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:05:17,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:05:17,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:05:17,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:05:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=32, Unknown=7, NotChecked=90, Total=156 [2024-11-14 04:05:17,912 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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) [2024-11-14 04:05:29,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:31,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:33,843 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 [] [2024-11-14 04:05:36,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 .cse0))) (and (= .cse0 |c_ULTIMATE.start_main_~epsilon~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (fp.geq |c_ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse1 .cse0)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse1)) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse1 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))) (= .cse1 |c_ULTIMATE.start_main_~d~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse2)))) is different from false [2024-11-14 04:05:38,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:40,322 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 [] [2024-11-14 04:05:42,330 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 [] [2024-11-14 04:05:45,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:47,706 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 [] [2024-11-14 04:05:49,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:51,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:53,788 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 [] [2024-11-14 04:05:55,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:57,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:59,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:02,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:04,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:06,533 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 [] [2024-11-14 04:06:12,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:14,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:16,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:18,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:21,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:23,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:25,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:27,105 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 [] [2024-11-14 04:06:29,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:31,349 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 [] [2024-11-14 04:06:33,360 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 [] [2024-11-14 04:06:35,370 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 [] [2024-11-14 04:06:37,377 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 [] [2024-11-14 04:06:39,388 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 [] [2024-11-14 04:06:41,392 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 [] [2024-11-14 04:06:43,405 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 [] [2024-11-14 04:06:45,412 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 [] [2024-11-14 04:06:47,421 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 [] [2024-11-14 04:06:50,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:52,597 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 [] [2024-11-14 04:06:54,601 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 [] [2024-11-14 04:06:56,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:06:58,631 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 [] [2024-11-14 04:07:01,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:07:03,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:07:05,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:07:07,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:07:09,312 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 [] [2024-11-14 04:07:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:07:09,453 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-11-14 04:07:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 04:07:09,456 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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 12 [2024-11-14 04:07:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:07:09,458 INFO L225 Difference]: With dead ends: 50 [2024-11-14 04:07:09,458 INFO L226 Difference]: Without dead ends: 48 [2024-11-14 04:07:09,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=8, NotChecked=154, Total=272 [2024-11-14 04:07:09,464 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 102.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:07:09,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 73 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 45 Unknown, 312 Unchecked, 102.5s Time] [2024-11-14 04:07:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-14 04:07:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 25. [2024-11-14 04:07:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2024-11-14 04:07:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-14 04:07:09,479 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 12 [2024-11-14 04:07:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:07:09,482 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-14 04:07:09,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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) [2024-11-14 04:07:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-14 04:07:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 04:07:09,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:07:09,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:07:09,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-14 04:07:09,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:07:09,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:07:09,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:07:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash 914941295, now seen corresponding path program 1 times [2024-11-14 04:07:09,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:07:09,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886727300] [2024-11-14 04:07:09,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:07:09,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:07:09,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:07:09,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:07:09,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 04:08:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:23,971 WARN L253 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 04:08:23,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:43,985 WARN L286 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:09:20,246 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse4))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 8.0) .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 6.0) .cse5) .cse5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 5.0) .cse5) .cse5) .cse5)))) ((_ to_fp 11 53) c_currentRoundingMode 16.0))) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-14 04:09:22,297 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse4))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 8.0) .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 6.0) .cse5) .cse5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 5.0) .cse5) .cse5) .cse5)))) ((_ to_fp 11 53) c_currentRoundingMode 16.0))) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-14 04:09:40,728 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:09:51,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse2))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (and (not (fp.gt .cse0 .cse1)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 8.0) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 6.0) .cse3) .cse3)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 5.0) .cse3) .cse3) .cse3)))) ((_ to_fp 11 53) c_currentRoundingMode 16.0))) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-14 04:09:54,013 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse2))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (and (not (fp.gt .cse0 .cse1)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 8.0) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 6.0) .cse3) .cse3)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 5.0) .cse3) .cse3) .cse3)))) ((_ to_fp 11 53) c_currentRoundingMode 16.0))) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-14 04:09:59,296 WARN L286 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:04,864 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:10,060 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:15,113 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:20,195 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:22,637 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (let ((.cse4 (fp.sub c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 8.0) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 6.0) .cse4) .cse4)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 5.0) .cse4) .cse4) .cse4)))) ((_ to_fp 11 53) c_currentRoundingMode 16.0))))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode .cse1 .cse1)))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.div c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_SqrtR_#res#1|) (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 (fp.neg .cse3)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-14 04:10:30,070 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:35,425 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:40,445 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:45,875 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:51,375 WARN L286 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:10:56,697 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:11:06,716 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:11:12,021 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:11:17,325 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:11:27,621 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:11:35,287 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:11:45,569 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:11:50,908 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:11:58,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (.cse5 (fp.sub roundNearestTiesToEven .cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 6.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (let ((.cse11 (fp.sub roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse6) .cse6)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse11) .cse11)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse11) .cse11) .cse11)))) .cse13)))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse6 .cse8)) (.cse0 (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse8 .cse6))) (.cse1 (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse8 .cse8)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse4) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6) (not (fp.gt .cse0 .cse1)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse16 (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (let ((.cse17 (fp.sub roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse6) .cse6)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse17) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse17) .cse17)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse17) .cse17) .cse17)))) .cse13)))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse16 .cse6))) (.cse15 (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse16 .cse16)))) (and (not (fp.lt .cse14 (fp.neg .cse15))) (not (fp.geq (fp.div roundNearestTiesToEven .cse6 .cse16) .cse3)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6) (not (fp.gt .cse14 .cse15)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse20 (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (let ((.cse21 (fp.sub roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse6) .cse6)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse21) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse21) .cse21)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse21) .cse21) .cse21)))) .cse13)))) (let ((.cse18 (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse20 .cse6))) (.cse19 (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse20 .cse20)))) (and (not (fp.lt .cse18 (fp.neg .cse19))) (not (fp.leq (fp.div roundNearestTiesToEven .cse6 .cse20) .cse4)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6) (not (fp.gt .cse18 .cse19))))))))))) is different from false [2024-11-14 04:12:05,928 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:12:21,059 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:12:26,272 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:12:38,687 WARN L286 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:12:44,027 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:12:49,047 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:12:54,383 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:12:57,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 6.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (let ((.cse8 (fp.sub roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse8) .cse8)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse8) .cse8) .cse8)))) .cse11)))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse3 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.geq (fp.div roundNearestTiesToEven .cse2 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (not (fp.gt .cse0 .cse1)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse14 (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (let ((.cse15 (fp.sub roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse15) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse15) .cse15)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse15) .cse15) .cse15)))) .cse11)))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse14 .cse2))) (.cse13 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse14 .cse14)))) (and (not (fp.lt .cse12 (fp.neg .cse13))) (not (fp.leq (fp.div roundNearestTiesToEven .cse2 .cse14) .cse10)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (not (fp.gt .cse12 .cse13))))))))) is different from false [2024-11-14 04:12:59,288 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 6.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (let ((.cse8 (fp.sub roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse8) .cse8)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse8) .cse8) .cse8)))) .cse11)))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse3 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.geq (fp.div roundNearestTiesToEven .cse2 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (not (fp.gt .cse0 .cse1)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse14 (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (let ((.cse15 (fp.sub roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse15) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 .cse15) .cse15)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse15) .cse15) .cse15)))) .cse11)))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse14 .cse2))) (.cse13 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse14 .cse14)))) (and (not (fp.lt .cse12 (fp.neg .cse13))) (not (fp.leq (fp.div roundNearestTiesToEven .cse2 .cse14) .cse10)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (not (fp.gt .cse12 .cse13))))))))) is different from true [2024-11-14 04:12:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-14 04:12:59,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:13:11,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) is different from false [2024-11-14 04:13:13,700 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) is different from true [2024-11-14 04:13:26,094 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (not (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))) is different from false [2024-11-14 04:13:28,178 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (not (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))) is different from true [2024-11-14 04:13:33,571 WARN L286 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:13:39,195 WARN L286 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:13:44,917 WARN L286 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 04:13:45,106 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 04:13:45,106 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:13:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886727300] [2024-11-14 04:13:45,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 04:13:45,107 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 04:13:45,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [803788080] [2024-11-14 04:13:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:13:45,108 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:13:45,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:13:45,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:13:45,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-14 04:13:45,146 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:386) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:84) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 42 more [2024-11-14 04:13:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035735888] [2024-11-14 04:13:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:13:45,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:13:45,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:13:45,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:13:45,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:13:45,196 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10| at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:386) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:84) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:13:45,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:13:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2024-11-14 04:13:45,197 ERROR L171 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2024-11-14 04:13:45,197 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-14 04:13:45,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:13:45,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-14 04:13:45,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 04:13:45,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-14 04:13:45,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82b6fa62-7671-4056-8366-f3475bfe18df/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:13:45,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-14 04:13:45,824 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:13:45,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:13:45 BoogieIcfgContainer [2024-11-14 04:13:45,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:13:45,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:13:45,831 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:13:45,832 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:13:45,832 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:00:06" (3/4) ... [2024-11-14 04:13:45,835 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:13:45,835 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:13:45,837 INFO L158 Benchmark]: Toolchain (without parser) took 829806.25ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 56.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-14 04:13:45,837 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:13:45,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.62ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 48.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:13:45,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.12ms. Allocated memory is still 83.9MB. Free memory was 48.4MB in the beginning and 47.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:13:45,838 INFO L158 Benchmark]: Boogie Preprocessor took 50.95ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:13:45,839 INFO L158 Benchmark]: RCFGBuilder took 10219.46ms. Allocated memory is still 83.9MB. Free memory was 45.8MB in the beginning and 34.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:13:45,839 INFO L158 Benchmark]: TraceAbstraction took 819090.55ms. Allocated memory is still 83.9MB. Free memory was 33.8MB in the beginning and 56.5MB in the end (delta: -22.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-14 04:13:45,839 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 83.9MB. Free memory was 56.5MB in the beginning and 56.5MB in the end (delta: 10.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:13:45,841 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.48ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.62ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 48.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.12ms. Allocated memory is still 83.9MB. Free memory was 48.4MB in the beginning and 47.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.95ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 10219.46ms. Allocated memory is still 83.9MB. Free memory was 45.8MB in the beginning and 34.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 819090.55ms. Allocated memory is still 83.9MB. Free memory was 33.8MB in the beginning and 56.5MB in the end (delta: -22.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 83.9MB. Free memory was 56.5MB in the beginning and 56.5MB in the end (delta: 10.8kB). 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: 13]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L15] double _EPS = 1e-6; [L43] double d, dd, r; [L44] double epsilon = 1e-8; [L46] d = 1. [L46] COND TRUE d <= 20. [L48] dd = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L11] COND FALSE !(!cond) [L49] RET assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L51] CALL, EXPR SqrtR(dd) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; [L21] COND TRUE Input <= 1.0 [L21] xn = 1.0 [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 [L28] COND TRUE \read(cond) [L29] double hn = 1. - Input*xn*xn; [L30] xnp1 = xn + xn * (8.0*hn + 6.0*hn*hn + 5.0*hn*hn*hn) / 16.0 [L31] residu = 2.0*(xnp1-xn) [L32] xn = xnp1 [L33] lsup = _EPS * (xn+xnp1) [L34] linf = -lsup [L35] cond = ((residu > lsup) || (residu < linf)) [L36] i++ [L28] COND FALSE !(\read(cond)) [L38] return 1.0 / xnp1; [L51] RET, EXPR SqrtR(dd) [L51] r = SqrtR(dd) [L53] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L13] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 819.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 147.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 60 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 137.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 135.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 312 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 37 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 3 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 80.5s SatisfiabilityAnalysisTime, 589.7s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 45 ConstructedInterpolants, 11 QuantifiedInterpolants, 8143 SizeOfPredicates, 16 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 0/1 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 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN